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 do you use the aux port for, The auxiliary port is used to link a mode...

The auxiliary port is used to link a modem to for dial backups.

Typical functional units of the client/server applications, What are the mo...

What are the most typical functional units of the Client/Server applications? Ans) typical functional units of the Client/Server applications User interface Business Logic

How does a token-passing protocol works, How does a Token-Passing Protocol ...

How does a Token-Passing Protocol works? The token-passing protocol relies on a control signal known as the token. A token is a 24-bit packet that circulates throughout the net

Sonet sdh , SONET SDH To satisfy the  requirements  of ever inc...

SONET SDH To satisfy the  requirements  of ever increasing data rate  for diverse applications, ANS developed  a standard known as synchronous optical  network by utili

List the advantages of microwaves, List the Advantages of microwaves.  ...

List the Advantages of microwaves.  a. They need no right of way acquisition among towers. b. They can carry high quantities of information because of their high operating f

Intrinsic functions, Intrinsic Functions HPF introduces some new intri...

Intrinsic Functions HPF introduces some new intrinsic functions in addition to those defined in F90. The two most regularly used in parallel programming are the system inquiry

Enumerate the various internetworking facility, Enumerate the various inter...

Enumerate the various internetworking facility 1.) Give a link among networks. At minimum, a physical and link control connection is required.   (2) Provide for the routing

TRAFFIC CONGESTION ASSESSMENT, Can I get help for traffic congestion anlysi...

Can I get help for traffic congestion anlysis using GIS

What are the control frames for lost tokens, Control Frames for Lost Tokens...

Control Frames for Lost Tokens If station goes down ... token lost Predecessor listens for data frame or token Noticing none, retransmits token Sends whofoll

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