Shortest path - network layer and routing , Computer Networking

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.

 

Posted Date: 3/16/2013 3:24:10 AM | Location : United States







Related Discussions:- Shortest path - network layer and routing , Assignment Help, Ask Question on Shortest path - network layer and routing , Get Answer, Expert's Help, Shortest path - network layer and routing Discussions

Write discussion on Shortest path - network layer and routing
Your posts are moderated
Related Questions
I WOULD LIKE TO MAKE MY SELF CLEAR WHETHER THIS TYPE OF PROGRAMS ARE BASED ON COMPLETE SEVER RELATED AND MAINTENANCE OF AN ENTIRE SMALL ENTERPRISE NETWORK.


User Datagram Protocol - UDP is a connectionless oriented transport protocol for use when the upper layers give error-recovery and reliability. UDP does not series data or re-assem

#questi Scenario: Your Case Study must be based on the information provided. There will be no additional information. This must be submitted in a .doc, or .pdf format. If you sen

In Windows 2000, a domain describes both an administrative boundary and a security boundary for a collection of objects that are relevant to a particular group of users on a networ

The address recorded by a router should be its outgoing interface. That is, if a router forwards a datagram that has the record route option enabled, and if the datagram arrives at

Determine about the Internet The Internet as a source of information and reference material, browsing the World Wide Web (WWW) and Newsgroups for the latest gossip or sh


PARTS COUNT METHOD This prediction method is applicable at preliminary stages, during bid proposal and early design phases; when insufficient information is available regardin

What is Stop-and-Wait Protocol? In Stop and wait protocol, sender sends single frame, waits unless it receives confirmation from the receiver (okay to go ahead), and then sends