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

Diiferentiate between html and http, Diiferentiate between HTML and HTTP ...

Diiferentiate between HTML and HTTP Hypertext Markup Language (HTML) The language used in writing pages for the World Wide Web. Knowledge of not HTML is not necessary f

ppp error detection on cisco routers , Which form of PPP error detection o...

Which form of PPP error detection on Cisco routers monitors data dropped on a link?  Ans) The Quality protocol monitors data dropped on a link. Magic Number avoids frame looping

Connection multiplexing, CONNECTION MULTIPLEXING:  In various circumst...

CONNECTION MULTIPLEXING:  In various circumstances transceiver can be in convenient e.g. workstations in a LAN. Connection multiplexer acts multiple computers to a single tran

EHR, ONE TO MANY

ONE TO MANY

Routing and routed protocols, What is difference among routing and routed p...

What is difference among routing and routed protocols? Ans) i) Routing use for top path selection ii) Routed protocol carries on source and destination information.

Why mac address called physical address, MAC address called Physical addres...

MAC address called Physical address Because it's not changeable

Explain typical network topologies, Question: a) Explain briefly three ...

Question: a) Explain briefly three typical network topologies giving one advantage and one disadvantage of each topology. Explain the three topologies with appropriate diagrams

Virtual local area network, VLAN ( Virtual Local Area Network) is a concept...

VLAN ( Virtual Local Area Network) is a concept of creating distinct broadcast domains. It is a network which aims at partitioning the physical network. VLAN comprises all the attr

Video encoder, How to start the video encoding in asp.net with c#

How to start the video encoding in asp.net with c#

What is sliding window, What is Sliding Window? The sliding window is a...

What is Sliding Window? The sliding window is an abstract method that explains the range of sequence numbers that is the concern of the sender and receiver. In other words, he

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