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

What is clipper, Clipper is a compiler that was well recognized at the time...

Clipper is a compiler that was well recognized at the time of80's and early times of 90's. We can build DOS based applications (even large applications too) using clipper. There is

Cisco router architecture, Cisco Router architecture Overall architec...

Cisco Router architecture Overall architecture of Cisco 2600 router is given below The Following components of routers are 1.    WIC slots 2.    communications

Explain different network structures in use, Computer Networking 1. Exp...

Computer Networking 1. Explain different network structures in use. 2. Elaborate the architecture and usage of ISDN. 3. Discuss the concept of framing in Data Link Layer

Application layer , Normal 0 false false false EN-IN ...

Normal 0 false false false EN-IN X-NONE X-NONE Application Layer   The application  layer

Show the use of flow control, Q. Show the Use of flow control? Flow co...

Q. Show the Use of flow control? Flow control denotes to a set of procedures used to restrict the amount of data that the sender can send before waiting for Error Control

Flash updates, IGRP uses flash updates, poison reverse updates, hold down t...

IGRP uses flash updates, poison reverse updates, hold down times, and divide horizon. How often does it broadcast its routing table updates? Ans) 90 seconds

Overview of the transport layer protocols, Overview of the Transport  Laye...

Overview of the Transport  Layer Protocols Transport layer  can be  available  more than  protocols  to the  network  applications. For  example the network  applications. For

Explain torus interconnection networks, Torus: The mesh network with wrap ...

Torus: The mesh network with wrap around connections is termed as Tours Network. Figure: Torus network

Determine the concept of placing antenna on hieght, Determine the concept o...

Determine the concept of placing antenna on hieght First, starting deployment simply placed cells in regions where there was high density of vehicle or human population. Once t

Network layer of the osi responsible for, What is the Network Layer of the ...

What is the Network Layer of the OSI responsible for? Ans) The Network Layer routes data from single node to another sends data from the source network to the destination networ

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