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

Cdma gsm back haul network, S t d "B" 6.4 m Ku-BAND EARTH STATION (2004) ...

S t d "B" 6.4 m Ku-BAND EARTH STATION (2004)   D-Sat (District Satellite Project) circuits for rural connectivity via satellite are in operation. Purpose of this project i

Networks - fundamental of network , Normal 0 false false fa...

Normal 0 false false false EN-IN X-NONE X-NONE Networks A networks  consists of two  or m

Enable both arpa and snap encapsulation, You need to enable both arpa and s...

You need to enable both arpa and snap encapsulation on single router interface. How do you do this? Ans)Assign two network numbers, one for every encapsulation type.

Compute shortest path, Compute the shortest path from t to all network node...

Compute the shortest path from t to all network nodes.

What is 100base-fx, 100Base-FX Utilizes two identical optical fiber...

100Base-FX Utilizes two identical optical fibers in star topology One fiber holds frames from the station to hub one from hub to station Encoding is 4B/5B Si

In formation sharing at regular intervals, In formation  sharing at  regu...

In formation  sharing at  regular intervals For example  every 30 seconds each router sends its information  about the  whole  network  to its  neighbours. This sharing  occurs

What is data storage technology, Normally, we think of communications scien...

Normally, we think of communications science as dealing with the contemporaneous exchange of information among distant parties. Though, many of the same techniques employed in data

What are the disadvantages of ospf protocol, Disadvantages of OSPF protocol...

Disadvantages of OSPF protocol i) Single Area ii) High Hardware Requirements iii) Troubleshooting

Dns spoofing - domain name server, DNS spoofing This process is genera...

DNS spoofing This process is generally refers to the process of responding a DNS request that was supposed to implement for another server. This can be in the case where the s

Root, Originally Linux/UNIX systems had one all-powerful user called root t...

Originally Linux/UNIX systems had one all-powerful user called root that managed systems. Discuss the risks of having a single root user and how more limited management abilities c

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