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 are netbios and netbeui, What are NETBIOS and NETBEUI? NETBIOS is ...

What are NETBIOS and NETBEUI? NETBIOS is a programming interface that permits I/O requests to be sent to and received from a remote computer and it hides the networking hardwar

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

How to configure a wireless mac filter - ccna, Configure a Wireless MAC Fil...

Configure a Wireless MAC Filter Step: Add a Mac filter. Navigate back to the web utility page of the router (http://172.17.30.1). Navigate to the Wireless section a

Building and running mpi programs, MPI parallel programs are written with c...

MPI parallel programs are written with conventional languages like, C and Fortran  .One or more header files such as "mpi.h" may be needed to give the necessary definitions and dec

Show the class A addresses, Q. Show the Class A Addresses? Class A Add...

Q. Show the Class A Addresses? Class A Addresses Numerically the lowest Use merely one byte to identify the class type and netid Three bytes are obtainable

Define the bulletin board intranet, Define the Bulletin Board Intranet ...

Define the Bulletin Board Intranet This type of Intranet in an organisation extends to everyone the capability to review or update information that would normally be placed

What are general middleware, It consists of the communication stacks, distr...

It consists of the communication stacks, distributed directories, authentication services, network time, RPC, Queuing services along with the network OS extensions like the distrib

Evaluate error detection in crc polynomials, Q. Evaluate Error Detection in...

Q. Evaluate Error Detection in CRC Polynomials? The divisor in the CRC generator is most habitually represented as an algebraic Polynomial. Reasons: It is short

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