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

Determine the 802.11g ofdm, 802.11g OFDM a) Uses OFDM with same 2.4 GH...

802.11g OFDM a) Uses OFDM with same 2.4 GHz band b) Achieves a 54-Mbps data rate c) Works with same 802.11b equipment

What is a management information base, What is a Management Information Bas...

What is a Management Information Base (MIB)? A Management Information Base is part of each SNMP-managed device. Every SNMP agent has the MIB database that having information ab

What are general middleware, What are General Middleware? It contains t...

What are General Middleware? It contains the communication stacks, authentication services, distributed directories, network time, RPC, Queuing services with the network OS ext

What do you understand by the term lan, Question: (a) What do you mean...

Question: (a) What do you meant by the term ‘LAN'? How is a LAN different from a WAN? (b) Explain three types of cables which are commonly used with LANs. (c) Three com

Explain priority and reservation of token passing, Priority and Reservation...

Priority and Reservation Higher priority stations may possibly access the token sooner Each station has a priority code Since token passes by station waiting to t

Define bandwidth and latency, Define Bandwidth and Latency? Network per...

Define Bandwidth and Latency? Network performance is calculated in Bandwidth (throughput) and Latency (Delay). Bandwidth of a network is given by the number of bits that can be

What is mesh topology, What is mesh topology Mesh topology is a setup w...

What is mesh topology Mesh topology is a setup wherein every device is linked directly to each other device on the network. Consequently, it needs that each device has at least

Show the security policy as well integrated security, Q. Show the Security ...

Q. Show the Security Policy as well Integrated Security ? Security policy is on paper statement describing what assets are to be protected and why who is responsible and which

What is stop-and-wait protocol, What is Stop-and-Wait Protocol? In Stop...

What is Stop-and-Wait Protocol? In Stop and wait protocol, sender sends single frame, waits unless it receives confirmation from the receiver (okay to go ahead), and then sends

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