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

Give the structure of an atm uni cell header, a) Consider a hypothetical a...

a) Consider a hypothetical arrangement of ‘self-learning' bridges shown in the figure below. Assuming all are initially empty, give the forwarding tables for each of the bridges B

What is the effect on the security of the password, Question: (a) What...

Question: (a) What is a script kiddie? Is it a significant security threat, and why? (b) Assume that UNIX uses the user login name in lieu of the traditional salt, what is

Explain 10base-T- twisted pair ethernet, 10Base-T: Twisted Pair Ethernet ...

10Base-T: Twisted Pair Ethernet Most popular standard simplest to install and reconfigure Star topology LAN utilize UTP cable no need for AUI It supports data rag

Describe any good security technology, Describe any good security technolog...

Describe any good security technology A good security technology should be powerful enough to support the features that the administrators need, including rules validation to i

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

Explain monitor stations of token passing, Monitor Stations Lost t...

Monitor Stations Lost tokens - timer is issued each time a frame or token is generated If no frame is received in time period new token is generated by a monitor stat

Define rs232 interface, Q. Define RS232 Interface? - Indicates the inte...

Q. Define RS232 Interface? - Indicates the interface between DTE and DCE: V.28 mechanical as well as electrical characteristics V.24: functional as well as procedur

Advantages and disadvantages of public and private network, The disadvantag...

The disadvantages and advantages of Private and Public networks are shown in the table below:

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