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

Example of parallel sections construct, This example demonstrates the use o...

This example demonstrates the use of parallel sections construct. The three functions, fun1, fun2, and fun3, all can be executed concurrently.  Note that all the section directives

What are the unix-based firewalls, What are the Unix-based firewalls T...

What are the Unix-based firewalls The Unix-based firewalls are considered most secured as compared to the Windows NT based ones. The firewalls bind the holes of the operating

Ring token, what is logical ring maintenance and how does it work>?

what is logical ring maintenance and how does it work>?

Internet backbone - computer network, Internet Backbone Internet backb...

Internet Backbone Internet backbone  is the  physical  networks ( usually relying  on fiber optic  cable ) that  carries  internet  traffic between  different  networks  and i

Show the refraction and reflection in Fiber-optic cable , Q. Show the Refra...

Q. Show the Refraction and Reflection in Fiber-optic cable ? - Refraction often takes place when light bends as it passes from one medium to another less dense medium - Wh

Describe flow and error control mechanisms, Q. Describe Flow and Error Cont...

Q. Describe Flow and Error Control Mechanisms? Flow and Error Control Mechanisms - Stop and Wait ARQ - Go-Back ARQ - Selective Repeat ARQ

What is a protocol, What is a protocol? The term protocol refers to a s...

What is a protocol? The term protocol refers to a set of rules and process that govern the transmission of messages over a physical networking medium. The most common network p

Substantial capital investments in new networks, Question: (a) How can...

Question: (a) How can governments provide the mobile industry with the long-term clarity and certainty it needs to make substantial capital investments in new networks? (b)

Basic working of spanning tree, Q. Basic working of Spanning Tree? Spa...

Q. Basic working of Spanning Tree? Spanning Tree - Redundant bridges may be installed to provide reliability - To prevent infinite looping of packets between bridges,

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