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

Combine subtitution and transposition, how to own cipher to encrypt and dec...

how to own cipher to encrypt and decrypt message by combine both substitution ans transposition algorithm using c program

Concurrently read concurrently write (crcw), It is one of the models based ...

It is one of the models based on PRAM. In this model, the processors access the memory locations concurrently for reading as well as writing operations. In the algorithm, which use

Digital encoding scheme, what are the applications of different encoding sc...

what are the applications of different encoding schemes

Types of wires, TYPES OF WIRES:  Cable used for wiring would match the...

TYPES OF WIRES:  Cable used for wiring would match the following: The intended speed The distance between computers The amount of noise Anticipated future r

Describe about the noiseless channel, Describe about the noiseless channel ...

Describe about the noiseless channel A noiseless channel can transmit an arbitrarily large amount of information, no matter how frequently it is sampled. Just send a lot of dat

What are the benefits of networking, What are the benefits of Networking? ...

What are the benefits of Networking? The following are the distinct notes in favor of computer networking. a. The computers, staff and information can be well managed b.

Path overhead - sonet sdh , Path  Overhead It is part  of SPE  and con...

Path  Overhead It is part  of SPE  and contain followings  information: Performance monitor of synchronous transport , signal , path , track ,parity ,checks,  and path  status.

Need for standards, Need for standards - Over the past couple of decade...

Need for standards - Over the past couple of decades several of the networks that were built used different hardware and software implementations therefore they were incompatib

Show the network layer duties, Network layer duties Internetwork ...

Network layer duties Internetwork - Physical and Data link layers are jointly responsible for data delivery on the network from node to node

Telecoms, What is a Multiplexor

What is a Multiplexor

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