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 osi and what role does it play in computer networks, What is OSI an...

What is OSI and what role does it play in computer networks? OSI (Open Systems Interconnect) serves as a reference model for data communication. It is made up of 7 layers, with

Subnet mask, Given the address 172.16.2.120 and the subnet mask of 255.255....

Given the address 172.16.2.120 and the subnet mask of 255.255.255.0. How many hosts are available? Ans) 172.16.2 120 is a standard Class B address with a subnet mask that permit

Explain about star backbone network, Q. Explain about Star Backbone network...

Q. Explain about Star Backbone network? - Collapsed or switched backbone - Backbone is just one switch that connects LANs - Utilized as distribution backbone inside a bui

Collective message passing, In collective message passing, all the processe...

In collective message passing, all the processes of a set participate in communication. MPI gives a number of functions to execute the collective message passing. Some of them are

Explain bus topology, Explain Bus Topology. The physical Bus topology i...

Explain Bus Topology. The physical Bus topology is the easiest and most widely used of the network designs. It having of one continuous length of cable (trunk) and a terminatin

Hierarchical routing strategy, i want a program of hierarchical programming...

i want a program of hierarchical programming in c language with its output. please help me .

Discuss user datagram protocol, Problem 1 Bring out the differences bet...

Problem 1 Bring out the differences between POP and IMAP4 Problem 2 Discuss User Datagram protocol Problem 3 Explain the various steps in TCP congestion control

Coffee and Company Security Case Study, This is a report, I am working on a...

This is a report, I am working on another one. This report is on finding a better solution dealing with customer, wifi, management, etc.

Explain about the intranet hardware and software, Explain about the Intrane...

Explain about the Intranet hardware and software Intranets not only provide a secure environment for companies but also provide an excellent working environment that is full of

Thick ethernet wiring, THICK ETHERNET WIRING:  It needs thick coax cab...

THICK ETHERNET WIRING:  It needs thick coax cable. AUI cable joins from NIC to transceiver. AUI cable take digital signal from NIC to transceiver. The transceiver creates anal

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