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

Error detection in lrc - performance, LRC - Performance Detects ev...

LRC - Performance Detects every burst errors up to length n (number of columns) If two bits in one data unit are damaged as well as two bits in exactly same positions

Simple mail transfer protocoland secure sockets layer, Simple Mail Transfer...

Simple Mail Transfer Protocoland Secure Sockets Layer SMTP: Simple Mail Transfer Protocol is a server-to-server protocol for delivering electronic mail. SSL: Secure Sockets

Point-to-point message passing, In point-to-point message passing, single p...

In point-to-point message passing, single process sends/receives message to/from another process. There are four communication modes for sending a message: i)    Buffered mode

What is the virtual path, Along any transmission path from a given source t...

Along any transmission path from a given source to a given destination, a group of virtual circuits can be grouped together into what is known as path.

What is the routing metric used by igrp, IGRP is a distance vector routing ...

IGRP is a distance vector routing protocol designed by Cisco. The maximum hop count is 255, and it uses a combination of variables to verify a composite metric. IGRP has an adminis

Example on TCP numbering, Q. Example on TCP numbering? Envision a TCP c...

Q. Example on TCP numbering? Envision a TCP connection is transferring a file of 6000 bytes. The first byte is numbered 10010. What are the sequence numbers for every seg

Difference between baseband and broadband transmission, What is difference ...

What is difference between baseband and broadband transmission? In a baseband transmission, the whole bandwidth of the cable is consumed by a one signal. In broadband transmiss

Cisco router architecture, Cisco Router architecture Overall architec...

Cisco Router architecture Overall architecture of Cisco 2600 router is given below The Following components of routers are 1.    WIC slots 2.    communications

Packet takes through an internetwork, What utility can you use to see the p...

What utility can you use to see the path a packet takes through an internetwork? Ans) Trace - Uses Time-To-Live (TTL) values to make messages from each router used along the pat

Explain what are the external threats, Explain what are the External Threat...

Explain what are the External Threats External security threats are the most problematic ones. Till date the greatest threat was the virus menace. Now, with the sophisticated

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