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

Switch - network layer and routing , Switch Generally called  as two ...

Switch Generally called  as two  layer switch . it  performs  on physical  and data  link  layers. It  is  a bridge it has many  ports  that allow  better  performance. Since

Straight through lan cable, Q. Straight through Lan Cable ? Straight t...

Q. Straight through Lan Cable ? Straight through Cable - Maintain the pin connection each the way through the cable. - The wire connected to pin 1 is the similar on bo

Multimode for transmitting optical signals, Q. Multimode for transmitting o...

Q. Multimode for transmitting optical signals? - Multiple beams from light source travel through core at different paths - Multimode step-index fiber Density remains

Internet transport service proposal, will you have this done to day? And ho...

will you have this done to day? And how long will this take?

Achieving universal services, The purpose of internetworking is universal s...

The purpose of internetworking is universal service across heterogeneous networks. To give this service all computers, and routers have to agree to forward information from a sourc

Tree interconnection network, Tree interconnection network Tree inter...

Tree interconnection network Tree interconnection network(TIN)), processors are organized in a whole binary tree pattern.

Define metropolitan area network, Q. Define Metropolitan Area Network? ...

Q. Define Metropolitan Area Network? Metropolitan Area Network (MAN) Cable Network Architecture: Overview Protocols and Standards - Set of regulations that go

What is groupware, What is Groupware Groupware are a collection of sof...

What is Groupware Groupware are a collection of software tools that encompass a broad range of applications. Even though groupware broadly consists of applications like calend

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 man, What is MAN? MAN - Metropolitan Area Networks. MAN is b...

What is MAN? MAN - Metropolitan Area Networks. MAN is bigger than a LAN and as its name implies, covers the area of a single city. MANs rarely extend beyond 100 KM and frequ

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