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

Modern computer , modern technology in world of 21 century

modern technology in world of 21 century

Explain the cost of a path between two nodes, Explain the cost of a path be...

Explain the cost of a path between two nodes Given a network of nodes linked by bidirectional links, where every link has a cost associated with it in each direction, explain t

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

What do you understand by osi, Q. What do you understand by OSI? Ans: T...

Q. What do you understand by OSI? Ans: The Open System Interconnection (OSI) reference model illustrates how information from a software application in one computer goes throug

Who initiates the ‘trap'' message, Question 1 Who initiates the ‘Trap' mes...

Question 1 Who initiates the ‘Trap' message? When is this message generated? Question 2 Discuss the features of a typical Network Management System.List (Fault Management,

State token bus frame format, Token Bus Frame Format No length fiel...

Token Bus Frame Format No length field Data is able to be much larger (timers prevent hogs) Frame control Ack required? Data vs Control frame and how is

What do you mean by modems, Q. What do you mean by Modems? Telephone M...

Q. What do you mean by Modems? Telephone Modems - A telephone line has a bandwidth of approximately 2400 Hz for data transmission

State about transcontinental ?ber, State about transcontinental ?ber A ...

State about transcontinental ?ber A transcontinental ?ber link may have many gigabits/sec of the bandwidth, but latency will also be high due to speed of light propagation abov

How do you disable cdp on the whole router, By using this command Router(c...

By using this command Router(config)# no cdp run we can disable CDP on the entire Router

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