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

Command that shows traffic statistics on serial 0/1, Recognize the command ...

Recognize the command that shows traffic statistics on serial0/1? Ans) show interface serial 0/1

Explain the term virtual circuit packet delivery, QUESTION a) Security ...

QUESTION a) Security is a very crucial component in a Distributed System. Describe three properties of a secure channel. b) During packet transmission, messages are subdivid

Electronic cheques, Electronic Cheques   Another mechanism for Internet p...

Electronic Cheques   Another mechanism for Internet payment is electronic cheques. With electronic cheques, the payer (either an individual consumer or a business) instructs his

Networking concepts and applications, iLab 2: Office Network Expansion ...

iLab 2: Office Network Expansion Connect to the iLab here. Submit your assignment to the Dropbox located on the silver tab at the top of this page. (See "Due Da

Calculate utilization percentage of the link, Q. Calculate Utilization perc...

Q. Calculate Utilization percentage of the link? - System: Stop and wait ARQ - Bandwidth: 1Mbps - Round trip for one bit: 20ms - Frame length: 1000 bits Utilizatio

Which layer are called upper layer, Three layers are called upper layers ...

Three layers are called upper layers a) Application Layer - 7 b) Presentation Layer - 6 c) Session Layer - 5

Show the congestion control in TCP, Q. Show the Congestion control in TCP? ...

Q. Show the Congestion control in TCP? Congestion control in TCP TCP assumes that the cause of lost segment is due to congestion in the network Retransmission of

Types of redundancy checks, Types of Redundancy Checks Parity Check ...

Types of Redundancy Checks Parity Check Simple Parity Check Two Dimensional Parity Check / Longitudinal Redundancy Check (LRC) CRC (Cyclic Redundancy Check)

Compute shortest path, Compute the shortest path from t to all network node...

Compute the shortest path from t to all network nodes.

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

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