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

Connectionless service, In connectionless schema, there is no connection re...

In connectionless schema, there is no connection required. The source of data includes destination information in data and transmit to the network. Network transmit each data item

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

Describe about radio waves, Radio Waves - Frequency ranges: 3 KHz to 1...

Radio Waves - Frequency ranges: 3 KHz to 1 GHz - Omni directional - Susceptible to interference by other antennas utilizing same frequency or band - Ideal for long-di

Explain tree interconnection network, Tree interconnection network:   In tr...

Tree interconnection network:   In tree interconnection network, processors are organised in a complete binary tree pattern. Figure: Tree interconnection network

Networking project for 20 computers, can i get a sample networking project ...

can i get a sample networking project for 20 computer with all network components?

Determine three features of igrp, GRP uses a composite metric complete up o...

GRP uses a composite metric complete up of bandwidth and delay by default, it updates each 60 Seconds and will trigger an update if the topology changes.

Explain how snmp works, Question: a) One of the most important duties ...

Question: a) One of the most important duties of a system administrator is to protect the information that is stored on network servers. In the same context, describe both Ma

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).

Distribution of dns - application layer , Distribution of DNS 1.By cen...

Distribution of DNS 1.By centralized data base The information contained in the domain  name space must be stored. A simple design  or DNS would have one DNS server that co

Describe the count-to-infinity problem in distance vector, Describe the cou...

Describe the count-to-infinity problem in distance vector

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