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

Snort deployed in the dmz network, Let's consider the network shown in Figu...

Let's consider the network shown in Figure 1 where Snort is deployed. In Figure 1, why is Snort deployed in the DMZ instead of the Internal Network? In Figure 1, say True or

Security goals confidentiality- integrity- digital signature, Question 1   ...

Question 1   This question concerns the main security goals (confidentiality, integrity, availability). Describe a situation which provides the goal of confidentiality but does not

Network protocols - computer networks, Network Protocols In computer  ...

Network Protocols In computer  networks  communication  occurs between  the entities in different  systems an entity  is anything  that is  capable  of sending  or receiving

Write a long note on internet and privacy, Question 1 Write a long note on...

Question 1 Write a long note on computers in television development Question 2 Write a long note on the ‘Steadicam' Question 3 Write a long note on Internet and pr

Flash updates, IGRP uses flash updates, poison reverse updates, hold down t...

IGRP uses flash updates, poison reverse updates, hold down times, and divide horizon. How often does it broadcast its routing table updates? Ans) 90 seconds

Illustrate the products based on socks protocol, Illustrate the products ba...

Illustrate the products based on Socks protocol There are a number of products based on SOCKS specifications such as Auto SOCKS available in the market. The latest version is S

What is the standard isdn term for a native isdn modem, TA is the standard...

TA is the standard ISDN term for a native ISDN modem

What is the main purpose of ospf, What is the main purpose of OSPF? OSP...

What is the main purpose of OSPF? OSPF, or Open Shortest Path First, is a link-state routing protocol that uses routing tables to verify the best possible path for data exchang

Which osi reference layer is concerned with logical address, There are two ...

There are two logical addressing :- a) Datalink is physical (hardware) addressing. b) Network is logical (software) addressing.

What are main types of networks and explain, a)  Peer-to-Peer Network Co...

a)  Peer-to-Peer Network Computers can act as both servers sharing resources and as clients using the resources. b)  Server-based Network Give centralized control of netwo

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