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

INAB-426-, As• New Content (Week 5) o System Integration Implementation P...

As• New Content (Week 5) o System Integration Implementation Plan ? Develop a detailed implementation plan that captures the following (address 4 of these): ? Testing activitie

Application of satellite communication , Application of Satellite Communica...

Application of Satellite Communication started with the installation and commissioning of STD- “B” Earth Station having 11m diameter antenna in 1982, Initially with to only three

Determine the level of fibre channel standard, Determine the level of Fibre...

Determine the level of Fibre Channel standard The Fibre Channel standard is organized into five levels: FC-0: The Physical Interface and Media Level handles a variety of phy

Explain about data link layer sub layers, Data Link Layer Sub layers ·  L...

Data Link Layer Sub layers ·  Logical Link Control (LLC) - upper layer · Handles control information, logical addressing and data · MAC (Medium Access Control) - lower layer ·

Wireless access - computer network, Wireless Access Wireless access co...

Wireless Access Wireless access connecting end  systems ( that are often  mobile) into the network. Today there are two broad types  of wireless internet access(1) wireless an

Path overhead - sonet sdh , Path  Overhead It is part  of SPE  and con...

Path  Overhead It is part  of SPE  and contain followings  information: Performance monitor of synchronous transport , signal , path , track ,parity ,checks,  and path  status.

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