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

Virtual lans, One of the design requirements is to isolate other network tr...

One of the design requirements is to isolate other network traffic and broadcast from finance department to improve security. In order for this to possible we will implement VLAN o

Difference between unicast and anycast, Difference between Unicast and Anyc...

Difference between Unicast and Anycast Unicast: An identifier for a single interface. A packet sent to a unicast address is delivered to the interface identified by that addres

Define network, Communication, Resource sharing and Media (When many host s...

Communication, Resource sharing and Media (When many host share their resources with every other OR when many devices connect with each other for resource sharing )

Delay, It is a basic quantitative property of networks. Delay is a calculat...

It is a basic quantitative property of networks. Delay is a calculate how long it takes for a bit of data to cross across the network from one end to the other. It is calculated in

Describe about the term- network, Describe about the term- network If n...

Describe about the term- network If network tends to lose the packets, it is better to acknowledge each one of them separately, so the lost packets could be retransmitted. On t

Mesh, Mesh It is of two dimensional network.  In this every processi...

Mesh It is of two dimensional network.  In this every processing elements are arranged in a two dimensional grid. The processor are in rows i and column j are denoted by PEi

Install, how to install xp via network

how to install xp via network

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.

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