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

Network devices - network layer and routing , Network Devices a.Hub ...

Network Devices a.Hub b.Repeater c.Bridge d.Gateway e.Switch f.Router Connecting devices can  classified  into networking and internetworking  devices when

Http request message, HTTP Request Message The first  line of  an HTTP...

HTTP Request Message The first  line of  an HTTP request message  is called the  line. The subsequent lines are called  the header lines. The  request  line has  fields the me

Configure basic switch parameters- ccna, Configure basic switch parameters....

Configure basic switch parameters. Configure the S1, S2, and S3 switches according to the following guidelines: Configure the switch hostname. Disable DNS lookup.

How xor operations can implement key stream attacks, Question: a) In a...

Question: a) In a wireless network where WEP is enforced as security mechanism, what procedure would the network manager adopt for changing WEP default keys. b) Using Pla

Which layer is responsible for negotiating data transfer , Which layer is r...

Which layer is responsible for negotiating data transfer syntax? Ans) The Presentation layer does the following: Manages data representation conversions, or data transfer syntax

What are the key differences between gsm and gprs networks, Question : ...

Question : a) Describe the following core components of a cellular based network: i) Cell ii) MSC iii) HLR & VLR iv) PSTN b) Explain why frequency reuse is consi

Define csma/cd, CSMA/CD - A Simple Definition A netwo...

CSMA/CD - A Simple Definition A network station wishing to broadcast will first check the cable plant to make sure that no other station is currently transmit

Illustrate about rsa encryption, Q. Illustrate about RSA Encryption? R...

Q. Illustrate about RSA Encryption? RSA Encryption - Public key encryption technique - Encryption steps: - Encode data to be encrypted as a number to create the pla

Bit stuffing, bit stuffing program in python

bit stuffing program in python

Bit stuffing, bit stuffing program in python

bit stuffing program in python

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