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

Which protocol resolves an ip address to a mac address, The Address Resolut...

The Address Resolution Protocol (ARP) sends out a broadcast to verify the MAC address from the IP address.

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.

Explain the architecture and usage of isdn, Computer Networks 1. Write ...

Computer Networks 1. Write about different network structures in use. 2. Explain the architecture and usage of ISDN. 3. Describe the concept of framing in Data Link Layer

Sorting using interconnection networks, The combinational circuits use the ...

The combinational circuits use the comparators for comparing the storing and number them on the basis of minimum and maximum functions. Likewise, in the interconnection networks th

What is fiber distributed data interface, FDDI -(Fiber Distributed Data Int...

FDDI -(Fiber Distributed Data Interface) FDDI Basics: FDDI (Fiber Distributed Data Interface) came about because system managers became concerned with network reliability i

Systolic array, Systolic Array This interconnection network is a kind o...

Systolic Array This interconnection network is a kind of pipelined array architecture and it is designed for multidimensional flow of data. It is used for executing fixed algor

Overview of the transport layer protocols, Overview of the Transport  Laye...

Overview of the Transport  Layer Protocols Transport layer  can be  available  more than  protocols  to the  network  applications. For  example the network  applications. For

Enable both arpa and snap encapsulation, You need to enable both arpa and s...

You need to enable both arpa and snap encapsulation on single router interface. How do you do this? Ans)Assign two network numbers, one for every encapsulation type.

WOrkstation, Interdepences of workstation hardware and software

Interdepences of workstation hardware and software

What is meant by symmentric multiprocessing (smp), It treats all processors...

It treats all processors as equivalent. Any processor can do the work of any other processor. Applications are separated into threads that can run simultaneously on any available p

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