Shortest path - network layer and routing , Computer Networking

Assignment Help:

Shortest path

 The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree .

a.The algorithm  beings  to build  the tree identifying  its root. The root  of each router tree is the  router itself. The algorithm them attaches all nodes  that can  be reached from that  root in other words. All of the other neighbour  nodes and are  are temporary at this step.

b.The algorithm compares the tree temporary acres and identifies the are with the  lowest  commutative cost. This are and the node to which it  connecters are now a permanent part of  shortest path  tree.

c.The  algorithm examines the database  and identifies every node that  can be  reached from it  chosen  node. These nodes  and their  arcs are added temporarily to the tree.

d.The last  two  steps  are repeated until every node  in the network  has become  a permanent part of the tree. The only  permanent  arcs are those  that represent the shortest route to every  node.

The cost number  next to  each node  represents the cumulative cost  from  the root  node  not the cost of the individual arc. The second  third  steps  repeated until  four more  nodes  have  becomes  permanent.

 


Related Discussions:- Shortest path - network layer and routing

Determine about unique least-cost path, Determine about unique least-cost p...

Determine about unique least-cost path If there is a unique least-cost path, the two algorithms will yield the similar result because they are both guaranteed to search the lea

Determine the level of fibre channel standard, Determine the level of Fibre...

Determine the level of Fibre Channel standard The Fibre Channel standard is organized into five levels: FC-0: The Physical Interface and Media Level handles a variety of phy

Networking device, what is the best time to use brouter rather than router?...

what is the best time to use brouter rather than router? what are advantages of using brouter over router?

Explain in brief about router, Router Routing achieved commercially pop...

Router Routing achieved commercially popularity in the mid - 1980s - at a time when large-scale Internetworking began to change the fairly simple, homogeneous environments. Rou

State the security concerns, State the Security concerns The history of...

State the Security concerns The history of security concerns is not new. They have been of great worry to man and for many centuries man has been endeavouring to devise new tec

Receipt of acknowledgment - transport layer, Receipt of Acknowledgment ...

Receipt of Acknowledgment In our GBN  protocols  an acknowledgment for  packet with sequence number will be taken to be accumulative acknowledgment  indicating that all  packe

Modeling a wan, To model a WAN, we need a graph in which the nodes model sw...

To model a WAN, we need a graph in which the nodes model switches and the edges model direct join between switches. The modeling saves essence of network, and it ignores attached d

Subnets and classless addressing, As the Internet started, the original Cla...

As the Internet started, the original Classful addressing procedure became a limitation. The IP address space was being terminated because all networks had to select one of three p

Multiplexing - fundamentals of networks, Multiplexing Multiplexing ...

Multiplexing Multiplexing is the set of techniques that allows simultaneous transmission of multiple signals across a single  data like. It  is methods  for efficient utiliza

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