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

Difference between routable and non- routable protocols, What is the differ...

What is the difference between routable and non- routable protocols? Routable protocols can work with a router and can be used to make huge networks. Non-Routable protocols

Assignment, Hi Sir. I am Deep. I am studying masters of networking. I have ...

Hi Sir. I am Deep. I am studying masters of networking. I have an assignment which is due on Monday 28 August. Is this possible to make it within 5 days? And also tell me that how

Explain the acknowledged connectionless service, Explain the Acknowledged c...

Explain the Acknowledged connectionless service This is a cross between the previous two services. It provides that datagrams are to be acknowledged, but no prior logical conne

UDP Programming, I have a larget text file of 1MB, how do i break down into...

I have a larget text file of 1MB, how do i break down into chunks of packets to send over UDP? byte b[]=new byte[1024]; FileInputStream f=new FileInputStream("input.txt

Explain the bit-level encryption, Q. Explain the Bit-Level Encryption? ...

Q. Explain the Bit-Level Encryption? Bit-Level Encryption - Data is divided into blocks of bits then altered by encoding/decoding, permutation, substitution, exclusive OR

Subletting, Ask Design private subnetworks (using Class A range for CIDR) f...

Ask Design private subnetworks (using Class A range for CIDR) for each domain as in the table below, and complete the table. Hints: Consider how many network bits are required to a

Evaluate error detection in crc polynomials, Q. Evaluate Error Detection in...

Q. Evaluate Error Detection in CRC Polynomials? The divisor in the CRC generator is most habitually represented as an algebraic Polynomial. Reasons: It is short

Multi tasking environment, Multi Tasking Environment Multi tasking exp...

Multi Tasking Environment Multi tasking exploits parallelism by: 1)  Concurrently using the multiple functional units 2)  Pipelining functional units are pipe line toget

The world wide web http, The World  Wide Web HTTP The Hyper text Tran...

The World  Wide Web HTTP The Hyper text Transfer Protocols( HTTP) is a protocols  used mainly to  access data on the world  wide  web. HTTP functions as a carbonation of FTP(

Physical configurations sonet sdh , Physical Configurations Transport ...

Physical Configurations Transport signal multiplexer de multiplexer. It either  signal from multiple   sources into a STS singles  or de multiplexes and STS signal  into diffe

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