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 an object server, What is an Object server? With an object serv...

What is an Object server? With an object server, the Client/Server application is printed as a set of communicating objects. Client object converse with server objects using an

Define about the term - hackers, Define about the term - hackers Every ...

Define about the term - hackers Every time technology updates itself, new techniques evolve. At the same time thieves or intruders (in the information technology line, they are

What are the hardware requirement for an intranet, Hardware requirement for...

Hardware requirement for an intranet To setup a WAN, one would need to have some type of communication between different sites. National ISDN, Very Small Aperture Terminal (VSA

What are called fat clients and fat servers, If the amount of the applicati...

If the amount of the application runs on the Client side, then it is Fat clients. It is mostly used for decision support and personal software. If the amount of the application

Define the term - frame and packets, Define the term - frame and packets ...

Define the term - frame and packets Frames sum up packets. When a packet arrives at data link layer, the complete packet, header, data and remaining all, is used as data field

Give the types of firewalls, Give the types of firewalls Conceptually,...

Give the types of firewalls Conceptually, there are two types of firewalls: 1.  Network Level 2.  Application Level Network Level Firewall/Packet Filters The Net

Explain the cost of a path between two nodes, Explain the cost of a path be...

Explain the cost of a path between two nodes Given a network of nodes linked by bidirectional links, where every link has a cost associated with it in each direction, explain t

Explain what a digital signature is and how it works, Question: a) Out...

Question: a) Outline the concept of the Real Time Gross Settlement (RTGS) system in Mauritius and name the three main system components of the MACSS. b) Differentiate bet

Show the tcp connections, Q. Show the TCP connections? Connection estab...

Q. Show the TCP connections? Connection establishment Three-way handshake Why is two-way handshake not enough? Connection termination Four steps

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