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

Command to configure a explanation on an interface, Recognize the command t...

Recognize the command to configure a explanation on an interface Ans) Router(config-if)# explanation Finance department

What is the importance of encryption on a network, What is the importance o...

What is the importance of Encryption on a network? Encryption is the process of translating information into a code that is unreadable by the user. It is then translated back o

What is silly window syndrome, What is silly window syndrome? It is a d...

What is silly window syndrome? It is a difficulty that can ruin TCP performance. This problem happens when data are passed to the sending TCP entity in large blocks, but an int

WOrkstation, Interdepences of workstation hardware and software

Interdepences of workstation hardware and software

ILab 2: Office Network Expansion, iLab 2: Office Network Expansion ...

iLab 2: Office Network Expansion Connect to the iLab here. Submit your assignment to the Dropbox located on the silver tab at the top of this page. (See "Due Da

Advanced interface module and system bus, Advanced Interface Module (AIM) s...

Advanced Interface Module (AIM) socket This is an 100 pin internal socket. It is provide for plug in the Advance interface module card. Purpose of AIM card is concentrate in th

ppp error detection on cisco routers , Which form of PPP error detection o...

Which form of PPP error detection on Cisco routers monitors data dropped on a link?  Ans) The Quality protocol monitors data dropped on a link. Magic Number avoids frame looping

Describe differential manchester, Q. Describe Differential Manchester? ...

Q. Describe Differential Manchester? - Inversion at middle of bit interval is utilized for synchronization - Presence or else absence of additional transition at beginning o

Describe the main factors of switching delay, Describe the main factors of ...

Describe the main factors of switching delay No. The speed of propagation is 200,000 km/sec or 200 meters/µsec. In 10 µsec signal travels 2 km. Therefore, each switch adds equi

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