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

Describe smtp, a) Used for sending e-mail. b) Uses port 25.

a) Used for sending e-mail. b) Uses port 25.

What is the routing metric used by igrp, IGRP is a distance vector routing ...

IGRP is a distance vector routing protocol designed by Cisco. The maximum hop count is 255, and it uses a combination of variables to verify a composite metric. IGRP has an adminis

Introduction to operations research, explain the three classification of op...

explain the three classification of operation research

Question, On a lan where are ip datagram transported?

On a lan where are ip datagram transported?

Define what is interior and exterior routing protocol, Can you define what ...

Can you define what is interior and exterior routing protocols?

What is a dns resource record, What is a DNS resource record? A resourc...

What is a DNS resource record? A resource record is an entry in a name server's database. There are various types of resource records used, containing name-to-address resolutio

Password authentication protocols (pap), Password Authentication Protocols ...

Password Authentication Protocols (PAP) PAP  implements the  traditional username and password  authentication methods. At the  request from  an authenticator the client respon

What are called transactions, The grouped SQL statements are known as Trans...

The grouped SQL statements are known as Transactions (or) A transaction is a collection of actions embused with ACID properties.

Butterfly permutation, Butterfly permutation This permutation is gettin...

Butterfly permutation This permutation is getting by interchanging the important significant bit in address with smallest significant bit.

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