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

Multicast routing protocols, Multicast Routing Protocols Multicast gr...

Multicast Routing Protocols Multicast group addresses are assigned by IANA [Internet Assigned Numbers Authority for well known services and protocols. Information is exchang

What to do to connection with external communication, What to do to connect...

What to do to connection with external communication For dealing with external communication, the Web server must have a static IP. Having a static IP could also be a problemat

What is passive topology , When the computers on the network basically list...

When the computers on the network basically listen and receive the signal, they are referred to as passive due to they don't amplify the signal in any way.

traffic flow mapping , Develop traffic flow mapping and performance requir...

Develop traffic flow mapping and performance requirements for flows. A) Traffic Flow Mapping B) Performance Requirements

What is a counter, What is a Counter A software code that indicates ...

What is a Counter A software code that indicates how many times a site has been visited. It gets automatically updated and is usually represented by a small rectangle with n

Program annotation packages, A fairly renowned approach in this area is Ope...

A fairly renowned approach in this area is OpenMP, a recently developed industry standard for shared memory programming on architectures with uniform memory access characteristics.

What are the two broad class classifications, What are the two broad class ...

What are the two broad class classifications under which Networks can be divided? All computer networks fit in one of the two dimensions namely: a)      Transmission Technol

Command to disable cdp on an interface, Recognize the command to disable CD...

Recognize the command to disable CDP on an interface Ans) Router(config-if)# no cdp enable

Division of the address space, The IP class procedure does not split the 32...

The IP class procedure does not split the 32-bit address space into same size class and the classes do not have the same value of networks. A prefix of n bits gives 2n unique ne

What is a pointer and does java support pointers, What is a pointer and doe...

What is a pointer and does Java support pointers? Pointer is a reference handle to a memory location. Improper handling of pointers leads to memory leaks and reliability issues

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