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


Parallel Balance Point In order to implement a parallel algorithm on a parallel computer, K number of processors is needed. It may be noted that the given input is assigned to

can i get a sample networking project for 20 computer with all network components?

DNS cache poisoning The DNA cache poisoning generally refers to the process of maintaining or developing the false information, in the cache of DNS server. This process refers

The Data link layer performs the following: Responsible for physically passing data from single node to another. Translates messages from the upper layers into data frames and adds

DNS Message There are  the only  two kinds  of DNS message DNS query and reply messages. Further mote both query  and reply message have  the same  format  as shown in figure.

Q. Show the Data Encryption Standard? Data Encryption Standard - Bit-level encryption method designed by IBM - Adopted as standard for nonmilitary and nonclassified us


Private  Networks The information routes from one networks  to another  network through  a leased line. If an  organization needs privacy  can use a private networks  or networ