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

List some most useful advantages of token ring, List some most useful advan...

List some most useful advantages of Token Ring. Here are Token ring's most useful advantages: a. It depends excellent throughput under high-load conditions. b. Token Ring

Show the traffic profiles, Q. Show the Traffic profiles? Constant-...

Q. Show the Traffic profiles? Constant-bit-rate traffic - ADR=PDR No MBS Variable-bit-rate traffic ADR != PDR Small MBS Bursty traffic

Name the protocol responsible for finding the mac address , a)  What does t...

a)  What does the "CD" mean in the CSMA/CD? How is it implemented in the Ethernet?   b)  Consider an Ethernet hub with 8 ports and an Ethernet switch with 8 ports. In both cases

Discuss about the latest internet and intranet technologies, Latest Interne...

Latest Internet and Intranet technologies Even though the security capabilities of the latest Internet and Intranet technologies have enabled the companies to control the avail

Explain the building blocks of client/server, The client side building bloc...

The client side building block moves towards the client side of the application. The server side building block moves towards the server side of the application.

What are the internal threats - security, What are the Internal Threats ...

What are the Internal Threats Internal security problems are probably the most common. One never knows what someone is going to do. Even the most loyal employees or workers can

Explain mesh interconnection networks, Mesh : This is two dimensional netwo...

Mesh : This is two dimensional networks.  In this all processing elements are organised in a two dimensional grid. The processor in the row i and column j are indicated by PE i .

What is transmission media, Q. What is Transmission Media? - Actually s...

Q. What is Transmission Media? - Actually situated below the physical layer - Directly controlled through the physical layer - Data should be converted into electromagnet

Explain data processing, Question - 1 Define MIS and its objectives. What ...

Question - 1 Define MIS and its objectives. What are the characteristics of MIS? Question - 2 Explain data processing Question - 3 What are the recent developments in database

Database management, University of Wolverhampton School of Technology 6CI00...

University of Wolverhampton School of Technology 6CI007 Database Server Management Resit Assessment Hand in December 14th 2012 In this assignment you will build a small database t

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