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

Define the tasks for which sns is used, Define the tasks for which SNS is u...

Define the tasks for which SNS is used SNA can be used for the following types of tasks: -  Terminal access to mainframe and midrange computer applications. -  File trans

Tcp-ip routing architecture, Q. Explain TCP-IP Routing Architecture? ...

Q. Explain TCP-IP Routing Architecture? The TCP/IP routing architecture looks extremely much like the OSI routing architecture. Hosts utilize a discovery protocol to o

Classification of access networks - computer network, Classification of Ac...

Classification of Access Networks Access  networks  can loosely  be classified into three  categories 1. Residential Access 2. Company Access 3. Wireless Access

Frame filtering, FRAME FILTERING:  The very important task a bridge op...

FRAME FILTERING:  The very important task a bridge operates is frame filtering. If both the destination and source are on the same segment, it does not repeat the frame to the

Clock-driven scheme , Assume that the clock-driven scheme for generating st...

Assume that the clock-driven scheme for generating starting sequence numbers is used with a 16-bit wide clock counter (that is, sequence numbers range from 0 to 2^16).  The clock t

Two commands that copies the configuration in nvram to ram, Recognize the t...

Recognize the two commands that copies the configuration in NVRAM to RAM Ans) a) Copy startup-config running-config b)  Configure memory

Working of TCP - buffers, Q. Working of  TCP - buffers? TCP - buffers ...

Q. Working of  TCP - buffers? TCP - buffers Sending & receiving buffers - Processes don't consume data at the same speed Sending site: - White section: unfilled

What is star topology, Star Topology   Devoted point-to-point links to...

Star Topology   Devoted point-to-point links to central controller (hub)   Controller acts like exchange   Advantages - Less expensive - Robustness   Disadv

Lan- wan network module expansion slot, WAN interface card(WIC) slots T...

WAN interface card(WIC) slots Two fixed WIC slots are present in  2600 series router except 2691. It has contained 3 WIC slots. Network Module Expansion Slot( NM) slot

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