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

Write the generic name of the osi layer, Write the Generic Name of the OSI ...

Write the Generic Name of the OSI Layer a)  The figures below illustrate, side by side, the OSI 7-layer reference model and the Internet protocol stack. Inside each box represen

Division of the address space, The IP class procedure does not split the 32...

The IP class procedure does not split the 32-bit address space into same size class and the classes do not have the same value of networks. A prefix of n bits gives 2n unique ne

Advantages and disadvantages of public and private network, The disadvantag...

The disadvantages and advantages of Private and Public networks are shown in the table below:

What are tp-lite, What are TP-Lite and TP-Heavy Monitors? TP-Lite is si...

What are TP-Lite and TP-Heavy Monitors? TP-Lite is simply the integration of TP Monitor functions in the database engines. TP-Heavy is TP Monitors which handles the Client/S

Advantages - point to point , Advantages There are  times when  using ...

Advantages There are  times when  using  packet filters makes  sense. If the  connections require high  throughput  or the protocols  has proprietary technology that makes  it

Define the distance vector routing, Q. Define the Distance Vector Routing? ...

Q. Define the Distance Vector Routing? Distance Vector Routing Every router periodically shares its knowledge about the entire internet with its neighbours Sharing

Explain dynamic domain name system, Q. Explain Dynamic Domain Name System? ...

Q. Explain Dynamic Domain Name System? DDNS - Dynamic Domain Name System automatically updates the DNS master file - Sent by DHCP to a primary DNS server; secondary se

Bridges, BRIDGES:  A bridge is a hardware device also needed to connec...

BRIDGES:  A bridge is a hardware device also needed to connect two LAN code segments to extend a LAN. A bridge uses two NICs to connect two code segments. It listens to all tr

Define the class B addresses, Define the Class B Addresses? First t...

Define the Class B Addresses? First two octets are the network number as well as the last two octets are the host number 16382 probable blocks for assignment to organi

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