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

Sap is used by the cisco ios for which encapsulation types, "SAP" is used b...

"SAP" is used by the Cisco IOS for which encapsulation types? Ans) Three types:- Ethernet_802.2 Token-Ring FDDI_802.2

Routing and routed protocols, What is difference among routing and routed p...

What is difference among routing and routed protocols? Ans) i) Routing use for top path selection ii) Routed protocol carries on source and destination information.

What is ping, What is Ping? Ping is a utility program that permits you ...

What is Ping? Ping is a utility program that permits you to check connectivity among network devices on the network. You can ping a device by using its IP address or device nam

Dynamic process groups in parallel virtual machine , Dynamic Process Groups...

Dynamic Process Groups To generate and manage dynamic groups, a separate library libgpvm3.a must be connected with the user programs that make use of any of the set functions.

Different types of subnet classfull networks are present, How many dissimil...

How many dissimilar types of subnet classful networks are present?

Perfect shuffle permutation-concept of permutation network, Perfect Shuffle...

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Determine about the tcp/ip, Determine about the TCP/IP Stands for Tr...

Determine about the TCP/IP Stands for Transmission Control Protocol/Internet Protocol. This is the group of protocols that define the Internet and communication method used

Routing principle - network layer and routing , Routing Principle The p...

Routing Principle The principle  criterion of  successful routing is of course correctness but it not only criterion. You might  prefer to take the most direct route ( the  one

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