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

How a token ring networks allows sharing of bandwidth, Question: (a) E...

Question: (a) Explain how a Token Ring networks allows sharing of bandwidth (access control). (b) (i) CSMA/CD is not appropriate for wireless communication. Explain wh

What are the drawbacks of ethernet cabling, What are the drawbacks of Ether...

What are the drawbacks of Ethernet Cabling? The Ethernet cabling ahs the following drawbacks: 1. Ethernet is not a high-level performer in high-load environments. This proto

Enumerate about the server modules, Enumerate about the server modules ...

Enumerate about the server modules WebDAV is one of the best-used server modules and many companies developing Intranet software or groupware as well as various publishing and

Control - transport layer, Control This field  defines 6 different  co...

Control This field  defines 6 different  control  bits or  flags. These bits  enable flow  control  connection  establishment  and termination connection abortion and the mode

Approaches use in constructing application entities, The diagram below offe...

The diagram below offers an overall view on the methods use by both the OSI and TCP/IP model. ISO Approach - Occasionally called Horizontal Approach - OSI asse

Describe peer-to-peer networking, You are requested to design a secure home...

You are requested to design a secure home or small scale network (Fig. 1) to satisfy the key concepts underlying computer and network security: confidentiality, integrity, availabi

What are the routing techniques, Q. What are the Routing Techniques? R...

Q. What are the Routing Techniques? Routing Routing Techniques Static versus Dynamic Routing Routing Table for classful Addressing Routing Table for Cl

Error control in TCP, Q. Show the Error control in TCP? Error control ...

Q. Show the Error control in TCP? Error control in TCP Detect lost segments, out-of-order segments, corrupted segments and duplicated segments Three tools: chec

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