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

Networking, Discuss the interdependence of networking hardware and software...

Discuss the interdependence of networking hardware and software. Is it possible to have one without the other?

Projecr assingment, I have a project that need to be submit as soon as poss...

I have a project that need to be submit as soon as possible

Illustrate about OSI architecture, Explain ISO's OSI Architecture The O...

Explain ISO's OSI Architecture The Open System Interconnection (OSI) is a standard reference model for communication among two end users in a network. It is used in developing

General middleware in client server environment, What is General Middleware...

What is General Middleware in client server environment? Ans) It having the communication stacks, distributed directories, authentication services, network time, RPC, Queuing se

Network Topology, What are the different types of network topologies

What are the different types of network topologies

Show a simplex stop and wait automatic repeat request, Q. Show a simplex St...

Q. Show a simplex Stop and Wait automatic repeat request? A simplex Stop and Wait ARQ - Normal Operation - Frame lost - Acknowledgement lost - Acknowledgement de

Explain anti-aliasing techniques, Question: (a) Explain the issue assoc...

Question: (a) Explain the issue associated with vertices when the scan line scan line polygon fill algorithm is being applied? (b) Explain the logic of shortening edges to a

Explain token passing -token ring, Token Passing - Token Ring (IEEE 802.5) ...

Token Passing - Token Ring (IEEE 802.5) Needs that station take turns sending data Token passing coordinates process Token is a especially formatted three-byte fr

Interconnection networks and sorting, As in PRAM, there was no direct commu...

As in PRAM, there was no direct communication medium among the processors, therefore another model called as interconnection networks have been designed. In the interconnection net

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