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

What is redirector, What is redirector? Redirector is software that int...

What is redirector? Redirector is software that intercepts file or prints I/O requests and changes them into network requests. This comes under presentation layer.

Tqm in design manufacturing, Quality assurance through statistical methods...

Quality assurance through statistical methods is a key component in a manufacturing organization where TQM generally starts by sampling a random selection selection of th

Explain categorization according to pipeline configuration, Categorization ...

Categorization according to pipeline configuration According to the configuration of a pipeline, the below categories are recognized under this classification: Unifunct

Explain the working of transceivers, Explain the working of Transceivers ...

Explain the working of Transceivers Transceivers are used to connect nodes to the several Ethernet media. Most computers and network interface cards having a built-in 10BaseT o

Network problems, Network Problems Q1  Consider the single-sender CDM...

Network Problems Q1  Consider the single-sender CDMA example in Kurose & Ross. What would be the sender's output (for the 2 data bits shown), if the sender's CDMA code were (

What is border gateway protocol, What is BGP (Border Gateway Protocol)? ...

What is BGP (Border Gateway Protocol)? It is a protocol used to promote the set of networks that can be reached within an autonomous system. BGP enable this information to be c

Configure vtp on the switches - ccna, Configure VTP on the Switches VTP...

Configure VTP on the Switches VTP permits the network administrator to control the instances of VLANs on the network by creating VTP domains. Within each VTP domain, one or mor

Explain the acknowledged connectionless service, Explain the Acknowledged c...

Explain the Acknowledged connectionless service This is a cross between the previous two services. It provides that datagrams are to be acknowledged, but no prior logical conne

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