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

What is dhcp, What is DHCP? DHCP is short for Dynamic Host Configuratio...

What is DHCP? DHCP is short for Dynamic Host Configuration Protocol. Its major task is to automatically assign an IP address to devices across the network. It first checks for

IP datagram, On a LAN where are IP Datagram transported?

On a LAN where are IP Datagram transported?

Explain about traffic shaping, Q. Explain about Traffic shaping ? Traf...

Q. Explain about Traffic shaping ? Traffic shaping -Method to control the amount and the rate of the traffic sent to the network.? Leaky bucket Token bucket -

Domains and sub domains, Hosts are generally, individual machines at a spec...

Hosts are generally, individual machines at a specific location. Normally Resources of host machine are shared and can be used by any user on Internet. Hosts & local networks are g

Switching via an interconnection network, Switching  via an interconnectio...

Switching  via an interconnection network The switching  techniques  overcome the bandwidth  limitation of a single  shared bus. This technique use a more sophisticated interco

At which layer of the osi model repeaters work, At the Physical layer of ...

At the Physical layer of the OSI model Repeaters work by regenerating the signal to extend the distance it can travel.

Disk encryption and block cipher, Suppose AES (or any block cipher) is used...

Suppose AES (or any block cipher) is used to encrypt data. Which mode of encryption covered in class is best suited for each of the following two scenarios and why? If more than on

Describe ethernet, Describe Ethernet. Ethernet is one of the well-liked...

Describe Ethernet. Ethernet is one of the well-liked networking technologies used these days. It was developed during the early 1970s and is based on specifications as stated i

How to configure vtp pruning on the switches-ccna, Configure VTP Pruning on...

Configure VTP Pruning on the Switches VTP pruning permits a VTP server to suppress IP broadcast traffic for particular VLANs to switches that do not have any ports in that VLAN

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