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

Command to configure a explanation on an interface, Recognize the command t...

Recognize the command to configure a explanation on an interface Ans) Router(config-if)# explanation Finance department

What is a dedicated server, What is a dedicated server? A network serve...

What is a dedicated server? A network server designated to provide one particular service is known as dedicated server. For example if a computer is assigned for database servi

What is a file server, What is a File server? File servers are helpful ...

What is a File server? File servers are helpful for sharing files across a network. With a file server, the client passes requests for file records over system to file server.

Authoritative dns servers application layer, Authoritative DNS Servers ...

Authoritative DNS Servers Every  organization with publicly  accessible hosts  ( such  as web  server and mail  several  on the  internet  must  provide  publicly accessible D

Unused reserved - trannsport layer, Unused Reserved This  is a 6 bi...

Unused Reserved This  is a 6 bite field  reserved for future use.

Relationship between throughput and delay, If a data packet switch has a qu...

If a data packet switch has a queue of data packets waiting when a new packet reach. The new packet will be located on the whole queue and will have to wait while the switch forwar

Network devices - network layer and routing , Network Devices a.Hub ...

Network Devices a.Hub b.Repeater c.Bridge d.Gateway e.Switch f.Router Connecting devices can  classified  into networking and internetworking  devices when

Show the seven layers of iso''s osi model, Q. Show the seven layers of ISO'...

Q. Show the seven layers of ISO's OSI model? Ans:- The seven layers are given below:   -  Application Layer -  Presentation Layer -  Session Layer -  Transport Laye

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