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

Layered architecture - computer network, Layered Architecture The best...

Layered Architecture The best  way to  understand  any complex system is to break  it into  pieces  and then analyze what they  do and  how they interact. The most logical app

Routing table - network layer and routing , Routing Table Each  router ...

Routing Table Each  router now  uses the  shortest path tree to construct its routing table . each  router  uses the same algorithm and the same link state  database its own sh

State the characteristics of thinnet, Thinnet Characteristics Short...

Thinnet Characteristics Shorter range (185 meters) as well as smaller capacity Bus topology LAN Connectors and cables include: thin coaxial cable, NICs and BNC-T

Communication model, discuss the communication model from the source to the...

discuss the communication model from the source to the destination including the detailed account of the task that must be performed in data communication system

Statements about ppp and slip for wan communications, State the statements ...

State the statements about PPP and SLIP for WAN communications?  Ans)    a) PPP uses its Network Control Programs (NCPs) component to encapsulate many protocols.  b) SLIP

What is the standard isdn term for a native isdn modem, TA is the standard...

TA is the standard ISDN term for a native ISDN modem

Explain systolic array interconnection networks, Systolic Array : This inte...

Systolic Array : This interconnection network is a kind of pipelined array architecture and it's intended for multidimensional flow of data. It is used for applying fixed algorithm

What is workstation, What is workstation? A workstation is a node in ne...

What is workstation? A workstation is a node in network that is more useful and can occur local information processing or graphics processing. A workstation generally has an in

Two types of transmission technology , What are the two types of Transmissi...

What are the two types of Transmission Technology available in ccna? Ans) Point - to - Point and Broadcast are the Two types of Transmission Technology available in CCNA

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