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

Network Fundamental and Routing, I Have an exam Questions and i would like ...

I Have an exam Questions and i would like it to be answered. Thanks

Define the term socks- network security, Define the term Socks- Network sec...

Define the term Socks- Network security As it is well known, each type of network security protects data at a different layer of the OSI model. Built-in at each layer lies the

Dns - protocol attacks, DNS - Protocol Attacks Generally, in the DNS p...

DNS - Protocol Attacks Generally, in the DNS protocol, flaws are based on the implementation issues. The three common issues are generally, associated which can be of one of t

Show the network layer responsibilities, Q. Show the Network Layer Responsi...

Q. Show the Network Layer Responsibilities? - Source-to-destination delivery it is possibly across multiple networks - Logical addressing - Routing

What is a jam signal, What is a jam signal A jam signal is broadcasts ...

What is a jam signal A jam signal is broadcasts to network by the transmitting stations that detected the collision to ensure that all stations know of the collision. Every st

TCP, TCP creates a reliable data transfer service, in addition to IP''s unr...

TCP creates a reliable data transfer service, in addition to IP''s unreliable best-effort service. Study the related sections of the text, and in your own words, summarize how TCP

What is round trip time, What is Round Trip Time? The duration of time ...

What is Round Trip Time? The duration of time it takes to send a message from one end of a network to the other and back, is known as RTT.

ICT, state the advantages of the ICT

state the advantages of the ICT

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