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

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

Objectives of parallel programming, OBJECTIVES After reading this unit,...

OBJECTIVES After reading this unit, you should be able to: Describe the basics of parallel programming; Explain the parallel programming based on message passing;

What is the cladding, A layer of a glass surrounding the center fiber of gl...

A layer of a glass surrounding the center fiber of glass under a fiber-optic cable.

Explain the network allocation vector, Network Allocation Vector Timer ...

Network Allocation Vector Timer which shows how much time must pass before a station is allowed to check the channel

Networks - fundamental of network , Normal 0 false false fa...

Normal 0 false false false EN-IN X-NONE X-NONE Networks A networks  consists of two  or m

Explain fdm and tdm with example, Question 1 Explain FDM and TDM with exam...

Question 1 Explain FDM and TDM with example Question 2 Define B-ISDN and explain its services Question 3 What is symmetric key cryptography? Describe one symmetric

Troubleshooting tcp/ip, I''m having trouble with understanding a diagram fo...

I''m having trouble with understanding a diagram for my assignment

Describe the tcp/ip reference model, Computer Networks 1. Differentiate...

Computer Networks 1. Differentiate WAN and LAN. 2. Describe the TCP/IP Reference Model with diagram. 3. Explain Circuit switching and message switching. 4. List the fu

Explain types of networking and internetworking device, What is the differe...

What is the different type of networking / internetworking devices? 1. Repeater: Also known as a regenerator, it is an electronic device that operates only at physical layer.

Parallel balance point, Parallel Balance Point In order to implement a ...

Parallel Balance Point In order to implement a parallel algorithm on a parallel computer, K number of processors is needed. It may be noted that the given input is assigned to

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