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

Show the model for network access security, Q. Show the Model for Network A...

Q. Show the Model for Network Access Security? Model for Network Access Security (1) Gatekeeper functions comprise Password-based login authentications. (2)

Interconnection networks and sorting, As in PRAM, there was no direct commu...

As in PRAM, there was no direct communication medium among the processors, therefore another model called as interconnection networks have been designed. In the interconnection net

Logged into a router, You are logged into a router, what command would repr...

You are logged into a router, what command would represent you the IP addresses of routers linked to you? Ans)show cdp neighbors detail

Flash-nvram-system buffer-interface buffer, Flash It is also permanent...

Flash It is also permanent storage device. It stores the compressed form of Cisco IOS software image and the NVRAM data. Device structure One flash socket Support 80

Fault tree construction rules, FAULT TREE CONSTRUCTION RULES (a)  Defi...

FAULT TREE CONSTRUCTION RULES (a)  Define the  undesired  fault  condition  as the  "Top"  event. The  fault  event describes the state of either the system or a component. (b

What is the last step in data encapsulation, The Five steps to data encapsu...

The Five steps to data encapsulation (IN ORDER): 1) User information is changed into data. 2) Data is changed into segments. 3) Segments are changed into datagram and pack

What is the equivalent layer, What is the equivalent layer or layers of the...

What is the equivalent layer or layers of the TCP/IP Application layer in terms of OSI reference model? The TCP/IP Application layer really has three counterparts on the OSI mo

Describe the omni-directional and the directional antennas, Question: a...

Question: a) Describe the following two approaches used towards wireless frequency regulation. i. Regulated Band ii. Unlicensed Band b) An antenna is an electrical c

State about transcontinental ?ber, State about transcontinental ?ber A ...

State about transcontinental ?ber A transcontinental ?ber link may have many gigabits/sec of the bandwidth, but latency will also be high due to speed of light propagation abov

What are 10base2, 10Base2 an Ethernet term meaning a maximum transmitting r...

10Base2 an Ethernet term meaning a maximum transmitting rate of 10 Megabits per second that uses baseband signaling, with a contiguous cable segment length of 200 meters (185mts).

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