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

Virtual private network, Virtual Private Network (VPN) adds the features of...

Virtual Private Network (VPN) adds the features of both public and private  networks. It is fixed to single organization and needs public network for connectivity. These connect

Define encoder, Define Encoder? A device or program that uses predefine...

Define Encoder? A device or program that uses predefined algorithms to encode, or compress audio or video data for storage or transmission use. A circuit that is used to change

Define remote procedure call (rpc), RPC adumbrates the intricacies of the ...

RPC adumbrates the intricacies of the network by using the ordinary procedure call mechanism familiar to each programmer. A client process calls a function on a remote server and

Ip, what is dce

what is dce

Explain cube interconnection networks, Cube: It's a 3 dimensional intercon...

Cube: It's a 3 dimensional interconnection network.  In Cube PE s   are organised in a cube structure.  Figure 11: Cube interconnection network

Hierarchical routing strategy, i want a program of hierarchical programming...

i want a program of hierarchical programming in c language with its output. please help me .

Data sharing - fundamentals of networks, Data Sharing One of the most ...

Data Sharing One of the most important uses of networking is to allow the sharing of data. Before networking was common an accounting employee who wanted to prepare a report f

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