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

5 igrp supports a feature , 5 IGRP supports a feature that permits traffic ...

5 IGRP supports a feature that permits traffic to be distributed among up to 6 (4 default) paths to give greater allover throughput and reliability. What is this called? Ans) An

Subletting, Ask Design private subnetworks (using Class A range for CIDR) f...

Ask Design private subnetworks (using Class A range for CIDR) for each domain as in the table below, and complete the table. Hints: Consider how many network bits are required to a

What is a tag, In HTML, a tag shows the browser what to do. When you write ...

In HTML, a tag shows the browser what to do. When you write an HTML page, you enter tags for lot of  reasons -- to change the appearance of text, to show a graphic, or to make a co

Features of fdm - fundamentals of networks, Features of FDM 1.The FDM ...

Features of FDM 1.The FDM channel carries  only  one phone  circuit  at a time. 2.If an FDM channel is not in sue then  it is  sits idle and cannot be   used by  other user

Give the examples of the session layer, Session layer examples  are Netbios...

Session layer examples  are Netbios Names, SQL, NFS, X Windows, and RPC.

Packet processing on vpn router, Consider the site-to-site VPN scenario sho...

Consider the site-to-site VPN scenario shown in Figure 2. Let's deploy the AH protocol on the two VPN routers so that no desktop on the two sites need to do any AH operations. Assu

Security - fundamentals of networks, Security Security  is the  protec...

Security Security  is the  protection of hardware software and data  from  unauthorized access. Restricted physical  access to computer password protection limiting  user priv

Illustrate keep alive and time-waited timer, Q. Illustrate Keep alive and T...

Q. Illustrate Keep alive and Time-Waited Timer? Keep alive timer To prevent a long inactive connection between two TCPs - Either client or server crash

Typical functional units of the client/server applications, What are the mo...

What are the most typical functional units of the Client/Server applications? Ans) typical functional units of the Client/Server applications User interface Business Logic

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