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 the count-to-infinity problem in distance vector, Describe the cou...

Describe the count-to-infinity problem in distance vector

What is dos, What is DoS? A do, or Denial-of-Service attack, is an atte...

What is DoS? A do, or Denial-of-Service attack, is an attempt to stop users from being able to access the internet or any other network services. Such attacks might be come in

Bit stream structure, In OSI 7 layer model, a header, or possibly a trailer...

In OSI 7 layer model, a header, or possibly a trailer, can be added to the data unit at each layerI 7 layer, but we will define a simple virtual packet which contains only 8bit dat

Protocol layers and their service models - computer network, Protocol Laye...

Protocol Layers and their Service Models The  internet is an extremely complicated system. It  consists of many  pieces like  numerous  applications and protocols  various  t

Explain transparent bridges and learning bridges, Transparent Bridges & Lea...

Transparent Bridges & Learning Bridges - Builds table by examining destination as well as source address of each packet it receives - Learning bridges - If address is not

Explain asynchronous FDDI, Explain Asynchronous FDDI Asynchronous bandw...

Explain Asynchronous FDDI Asynchronous bandwidth is allocated utilizing an eight-level priority scheme. Every station is assigned an asynchronous priority level. FDDI as wel

the default settings of ipx delay number, The "ipx delay number" command w...

The "ipx delay number" command will permit an administrator to alter the default settings. Explain the default settings? Ans) For LAN interfaces, one tick; for WAN interfaces, s

Benefits of mpls vpn- wireless technology, 1) The school has implemented a ...

1) The school has implemented a pilot MPLS VPN which is being evaluated to replace the Bell South Frame Relay solution that provides connectivity to the Bascom Palmer Eye-Institute

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