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 topology, Q. What is Topology? - Physical/logical arrangement ...

Q. What is Topology? - Physical/logical arrangement - Topology of a network is the geometric depiction of the relationship of all the links and linking devices to one anothe

State the benefits of infrared light, State the benefits of Infrared light ...

State the benefits of Infrared light Infrared light does not penetrate walls or other opaque objects. This has two benefits: First, infrared communications can be more simply

Introduction to performance evaluations, INTRODUCTION In this part, th...

INTRODUCTION In this part, the topic of performance evaluation shows those parameters that are devised to calculate the performances of various parallel systems. Achieving the

What is data link of osi model, Q. What is data link of osi model? - Th...

Q. What is data link of osi model? - The data link layer offers access to the networking media and physical transmission across the media and this enables the data to locate it

Network design, Get the network design for a company

Get the network design for a company

Error detection-- crc, Error Detection-- CRC Powerful error detecti...

Error Detection-- CRC Powerful error detection system Rather than addition, binary division is utilized A series of redundant bits called "CRC" or else "CRC remai

Explain repeaters, Repeaters - Operate only in physical layer - Conn...

Repeaters - Operate only in physical layer - Connects two segments of the same LAN - Both segments must be of the same protocol - Only forwards frames; does not filter

Internet architecture, Company seldom uses a single router to connect its e...

Company seldom uses a single router to connect its entire network for two purpose. Because the router must transmit every packet, the processor in a provided router is insuff

Enhance the competition among the internet service providers, 1 Suppose you...

1 Suppose you are the new regulator in charge who has authority over Internet services (although in reality such a position may not exist depending on your country). You aim to enh

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