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

Describe differential manchester, Q. Describe Differential Manchester? ...

Q. Describe Differential Manchester? - Inversion at middle of bit interval is utilized for synchronization - Presence or else absence of additional transition at beginning o

What is source route and ospf, What is source route and OSPF? Source r...

What is source route and OSPF? Source route It is a series of IP addresses identifying the route a datagram must follow. A source route might optionally be included in an

Explain functions and protocols and services of each layer, Describe in pro...

Describe in proper details about OSI Model ? Explain the functions and protocols and services of each layer ?

Explain the concept of fragmentation, Fragmentation - Wireless environm...

Fragmentation - Wireless environment is very noisy - Corrupt frames must be retransmitted - Large frames must be divided into smaller ones to increase efficiency

Show the process of mail delivery, Q. Show the process of Mail Delivery? ...

Q. Show the process of Mail Delivery? Mail Delivery -Consists of three stages -First stage - email goes from user agent to local server, where it is stored until it ma

Broadcast and multicast , Broadcast and Multicast : Broadcast and Mult...

Broadcast and Multicast : Broadcast and Multicast :In the broadcast interconnection network, at one time one node transfer the data and all other nodes get that data.  Broadca

Networking security, difference between spambox and inbox in gmail

difference between spambox and inbox in gmail

Explain the term hardware cost, Hardware Cost It indicates to the cost ...

Hardware Cost It indicates to the cost concerned in the functioning of an interconnection network. It comprises the cost of arbiter unit, connectors, switches, interface logic

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