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

Find out the current flows through the photodiode, Quetion: A photodiod...

Quetion: A photodiode with a dark current of 10 nA has a responsivity of 0.4 A/W at a certain wavelength. What current flows through the photodiode when it is reverse biased an

What are gateways, What are gateways? Gateways give connectivity among ...

What are gateways? Gateways give connectivity among two or more network segments. It is usually a computer that runs the gateway software and gives translation services. This t

What are the advantages of adaptive routing, What are the Advantages of ada...

What are the Advantages of adaptive routing  (1) An adaptive routing method can improve performance, as realised by the network user. (2) An adaptive routing method can aid

What is client/server, What is client/server? Client/server is a type o...

What is client/server? Client/server is a type of network wherein one or more computers act as servers. Servers give a centralized repository of resources like printers and fil

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

Show the model for network access security, Q. Show the Model for Network A...

Q. Show the Model for Network Access Security? Model for Network Access Security (1) Gatekeeper functions comprise Password-based login authentications. (2)

Network Fundamentals BTech Telecommunication, Write a report on your chosen...

Write a report on your chosen topic that has been approved by your Lecturer. Your report should include appropriate figures, about 2000 words. Topics: 1 MAN- Metro Ethernet 2 Inte

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

Deadlock avoidance or prevention, Deadlock Avoidance To avoid deadlock...

Deadlock Avoidance To avoid deadlocks two types of strategies are used: 1) Static prevention: It uses V and P operators and Semaphores to allocate and deallocate shared res

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