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

Unix for multiprocessor system, UNIX For Multiprocessor System:- The UN...

UNIX For Multiprocessor System:- The UNIX operating system for a multiprocessor system has a number of additional features as compared to the normal UNIX operating system.  Let

url connection instance, What is the difference among URL instance and URL...

What is the difference among URL instance and URL Connection instance? Ans) A URL instance represents the location of a resource, and a URL Connection instance shows a link for

Company access - computer network, Company Access Company  access is t...

Company Access Company  access is that in which  end systems are connected in connecting end  systems in a organization or educational  institution into the network. On  co

Define osi , OSI= Open System Interconnection.

OSI= Open System Interconnection.

Print Servers, Which of the following commands will display the current pri...

Which of the following commands will display the current print jobs on a printer named Office Printer 01?

Connection multiplexing, CONNECTION MULTIPLEXING:  In various circumst...

CONNECTION MULTIPLEXING:  In various circumstances transceiver can be in convenient e.g. workstations in a LAN. Connection multiplexer acts multiple computers to a single tran

Data mining, The following DNA sequences are extracted from promoter region...

The following DNA sequences are extracted from promoter region of genes which are co-regulated by the same transcription factor (TF). The nucleotide segments capitalized in the giv

Ethernet fields, ETHERNET FIELDS:  In Ethernet fields the preamble and...

ETHERNET FIELDS:  In Ethernet fields the preamble and CRC is usually not given in frame. The destination address of each is the broadcast address. There is special value reser

What is the frame, What is the Frame A presentation format, which en...

What is the Frame A presentation format, which enables Web page designers and users to mark a part of the screen for links to other pages. Frames usually appear on the left

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