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 differential manchester, Q. Describe Differential Manchester? ...

Q. Describe Differential Manchester? - Inversion at middle of bit interval is utilized for synchronization - Presence or else absence of additional transition at beginning o

Explain the building blocks of client and server, Explain the building bloc...

Explain the building blocks of Client/Server? The client side building block runs the client side of the application. The server side building block runs the server side of

Straight through lan cable, Q. Straight through Lan Cable ? Straight t...

Q. Straight through Lan Cable ? Straight through Cable - Maintain the pin connection each the way through the cable. - The wire connected to pin 1 is the similar on bo

Network service model - network layer and routing, Network Service Model ...

Network Service Model The network  service  model  defines  the characteristics of end to end  transport of data between  one edge of the  network  to the  other  that is betwe

Subtle point, It is possible for a datagram to generate ICMP errors after i...

It is possible for a datagram to generate ICMP errors after it has been fragmented. For example, suppose that each of two fragments cannot be delivered. Seemingly, this would mean

Which layers are network support layers, Which layers are network support l...

Which layers are network support layers? a. Physical Layer b. Data link Layer and c. Network Layers

A default route is analogous to a, A default route is analogous to a defaul...

A default route is analogous to a default gateway. It is used to decrease the length of routing tables and to give complete routing capabilities when a router may not know the rout

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