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

Explain physical layer of osi reference model, Q. Explain physical layer of...

Q. Explain physical layer of Osi reference model? - The physical layer deals among the physical characteristics of the transmission medium. - It defines the mechanical, elec

What is domain names, Q. What is Domain Names ? - Full domain name is a...

Q. What is Domain Names ? - Full domain name is a sequence of labels separated by dots (.) - Fully competent domain name (FQDN) contains the full name of a host cis.usouthal

#title. Wireless broadband, Hi, i am a college student doing a report on wi...

Hi, i am a college student doing a report on wireless broadband. I needed to know user requirements of user groups ie: Home user Small Medium Large Businesses Things like w

Applications of networks, Q. Applications of networks? End systems (h...

Q. Applications of networks? End systems (hosts): - Run application programs - Example email, Web - At -edge of network Client/server model - Client host

Cnet sliding window protocol, implementing cnet sliding window protocol wit...

implementing cnet sliding window protocol with 6 nodes

Parallel programming environment characteristics, Parallel Programming Envi...

Parallel Programming Environment Characteristics  The parallel programming environment consists of an debugger, a editor,  performance evaluator and programme visualizer for i

What is the meaning of p-persistent, What is the meaning of P-persistent ...

What is the meaning of P-persistent If the medium is idle, transmit with probability p, and delay one time unit with probability (1 - p); if the medium is busy, continue to lis

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

Assigment, what the domain name of 128.252.160.2000

what the domain name of 128.252.160.2000

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