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
Describe the term - Certification Authority The certification is most easily implemented with a custom solution combined with a server, called the Certification Authority (CA).

Determine about the infrared spectrum (1) The spectrum for infrared is virtually unlimited, which shows the possibility of achieving extremely high data rates. (2) The infra

SSK Software Corporation has opened an office in Toledo, Ohio. The office will have a wireless Wi-Fi (WLAN), and a Corporate wired Ethernet LAN. Workstation requirements are as

Define Routing? The process of determining systematically hoe to forward messages toward the destination nodes based on its address is known as routing.

What is meant by Symmentric Multiprocessing (SMP)? It treats all processors as equal. Any processor can do the work of any other processor. Applications are divided into thread

Q. Example of go back - N protocol? The window size is 4. A sender has sent frame 6 as well as the timer expires for frame 3 (frame 3 not ACKn'd). The sender goes back as we

State the types of performance of computer hardware The hardware, i.e., the server or computer has a direct relationship on performance in the following areas: Reliabili

How LANs connected to Internet. Doubling every 18 months means factor of four gains in 3 years. In 9 years, gain is then 43 or 64, which leads to 6.4 billion hosts. My intuitio

Hosts are generally, individual machines at a specific location. Normally Resources of host machine are shared and can be used by any user on Internet. Hosts & local networks are g

Post Office  Protocols Version In computing  the post office protocol  version 3 (POP3) is an  application layer internet standard  protocols  used by  local e mail  clients