Computing shortest path in a graph, Computer Networking

Assignment Help:

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other one. Then extract next hop information from giving path information and add next hop information into routing tables.

WEIGHTED GRAPH

Djikstra's algorithm will add weights on edges in graph. The shortest path is then the path with minimum total weight. It could be noticed that the shortest path is not necessarily with fewest edges. For example as given in the figure below:

2244_weighted graph.png

The minimum path in the diagram from node 2 to node 6 is 2 to 3 and 3 to 6 as this way has the minimum weight so it is the shortest path.

DISTANCE MATRICS

Weights on graph nodes denote cost of traversing edge. This cost can be in time, hop or dollars counting (weight == 1). The resulting shortest path can not have fewest hops.


Related Discussions:- Computing shortest path in a graph

Protocols are used for logical network addressing, Which of the following p...

Which of the following protocols are used for logical network addressing? Ans) Internet Protocol - IP gives routing and a one interface to the upper layers. No upper layer proto

What is osi and what role does it play in computer networks, What is OSI an...

What is OSI and what role does it play in computer networks? OSI (Open Systems Interconnect) serves as a reference model for data communication. It is made up of 7 layers, with

Define client and server, Question 1 Define client and server. Explain the...

Question 1 Define client and server. Explain the Client server model Question 2 What is a Mainframe System? Write down the features of Mainframe System Question 3

Measurement on latency and bandwidth , Measure the performance (both latenc...

Measure the performance (both latency and throughput) of  TCP and UDP protocol stack  running on a pair of PCs  or Workstations in the Lab, and compare the results of your software

What are the internal threats - security, What are the Internal Threats ...

What are the Internal Threats Internal security problems are probably the most common. One never knows what someone is going to do. Even the most loyal employees or workers can

Transition phases - point to point , Transition Phases A PPP connectio...

Transition Phases A PPP connection goes through phases  which can be  shown in a transition phase . Dead: In  the dead phase  the link is not  being used. There is  no ac

What are the benefits of layered network, Q. What are the benefits of layer...

Q. What are the benefits of layered network? Ans: Basic benefits of layered network are given below: -  Complex systems will be broken down into understandable subsystems.

Ethernet framing is used for tcp/ip, Which type of Ethernet framing is used...

Which type of Ethernet framing is used for TCP/IP and AppleTalk Ans)Ethernet SNAP

What is groupware server, What is Groupware server? Groupware addresses...

What is Groupware server? Groupware addresses the management of semi-structured information like text, image, mail, bulletin boards and the flow of work. These Client/Server sy

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd