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
Mean node-node path The mean node-node path is two times the mean node-root path.  Number the levels of the tree with the root as 1 and the deepest level as N.  The path from t

However what if you don't know about the IP address of the computer you wished to connect to? What if you have to access a web server referred to as www.abc.com? How does your web

Describe unbound transmission media. Unbound transmission media are the media of transmitting data without using any cables. These are not bounded by any physical geography. Ex

In this question, you will compare delays in packet switching (i.e. in IP networks), in circuit switching (i.e. in PSTN telephony) and in virtual circuit packet switching (i.e. in

What is OLTP? In the transaction server, the client component usually contains GUI and the server components usually having of SQL transactions against a database. These applic


It treats all processors as equivalent. Any processor can do the work of any other processor. Applications are separated into threads that can run simultaneously on any available p

A typical layer 2 switch has a number of features. Identify and explain 5 features that you think are important that you would consider in your evaluation of L2 switches offered b

Question: (a) (i) Distinguish between Physical topology and Logical topology. (ii) Explain the following statement with the help of a diagram: "A star topology can have a l

Two neighbouring nodes (A and B) use a Go-Back-N protocol with a 3-bit sequence number and a window size of 4. Acknowledgments are cumulative. Assuming A is transmitting and B is r