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

Define unicast - multicast and reserved addresses, Q. Define Unicast - Mult...

Q. Define Unicast - Multicast and Reserved Addresses? Unicast, Multicast, and Reserved Addresses Unicast address - identifies a specific device Multicast address

How is hop-by-hop segmentation of the ipv6 packets avoided, Question 1: ...

Question 1: (a) How are IPv4 addresses transformed into IPv6 addresses using IPv4 compatible addresses? (b) Name some of the simplifications that were introduced in IPv6.

Residential access - computer network, Residential Access Residential ...

Residential Access Residential  access is connecting home  end  systems ( typically a PC but increasingly a home network) into the network. One form  of residential  access  i

Network design, Get the network design for a company

Get the network design for a company

Flash updates, IGRP uses flash updates, poison reverse updates, hold down t...

IGRP uses flash updates, poison reverse updates, hold down times, and divide horizon. How often does it broadcast its routing table updates? Ans) 90 seconds

Describe techniques used in location based services, Question: a) Comp...

Question: a) Compare Bluetooth and WIFI based networks over the following factors: Data rate, Range, Application Focus, Battery Power, Frequency Band, Security. b) Differe

Networking, discuss the interdependence of workstation hardware with releva...

discuss the interdependence of workstation hardware with relevant software

Describe at one disadvantage of a peer to peer network, Describe at one dis...

Describe at one disadvantage of a peer to peer network. When you are accessing the resources that are shared by one of the workstations on the network, that workstation takes

Explain the term- gateway, What is the Gateway A Gateway is a device li...

What is the Gateway A Gateway is a device like a mini or microcomputer capable of operating on a standalone basis but which also gives connection for communication with the oth

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