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 internet, What is Internet? Internet is a collection of network...

What is Internet? Internet is a collection of networks or network of networks. Various networks like LAN and WAN connected by suitable hardware and software to work in a seamle

Describe the specific ip-qos schemes, State how the different IP-QoS needs ...

State how the different IP-QoS needs for controling traffic, data and voice applications can be supported in your technology choice from Q7. Describe the specific IP-QoS schemes -

Types of vts sonet sdh, Types of VTs There are  several  option for  pa...

Types of VTs There are  several  option for  payload are actually mapped into the VT.  Locked mode VTs  bypass the pointers with a fixed  byte oriented mapping of limited flexi

State the congestion avoidance process, State the congestion avoidance proc...

State the congestion avoidance process Notifies the source that congestion avoidance process should be initiated where applicable for traffic in the opposite direction of the r

What are the data link protocols, What are the Data link protocols? Dat...

What are the Data link protocols? Data link protocols are sets of specifications used to implement the data link layer. The categories of Data Link protocols are 1. Asynchro

Discuss on basic services in gsm, Question 1 Explain the process of Compon...

Question 1 Explain the process of Components Identification and call establishment Question 2 Discuss on Basic services in GSM Question 3 Explain the Protocols Use

Topology, bus topology disadvantage?

bus topology disadvantage?

Calculate the efficiency of stop-and-wait ARQ, Suppose that frames are 1250...

Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frames are 25 bytes long. Calculate the efficiency of stop-and-wait ARQ (a) Transmits a

Undesirable sharing - fundamentals of networks, Undesirable Sharing ...

Undesirable Sharing With  the good  comes  the bad  while  networking  allow  the easy  sharing  of useful  information it also  the sharing  of undesirable  data. One sign

Cloud computing, Ask questiXYZ, is Pakistani company which is selling toys ...

Ask questiXYZ, is Pakistani company which is selling toys in all the major cities of Pakistan having 50 outlets in different cities. The company has the revenue of 10000000/- PKR p

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