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

Briefly describe about cryptography, Question 1 Describe any five differen...

Question 1 Describe any five different types of computers Question 2 Explain Bus Type LAN. Its advantages and disadvantages and examples Question 3 Explain the s

What is d-amps, What is D-AMPS D-AMPS uses 832 channels (in every dire...

What is D-AMPS D-AMPS uses 832 channels (in every direction) with three users sharing a sole channel. This allows D-AMPS to support up to the 2496 users simultaneously per cel

Security and reciprocity of RSA, Q. Security and Reciprocity of RSA? S...

Q. Security and Reciprocity of RSA? Security and Reciprocity of RSA - Kp and N are issued publicly. - Ks is kept secret. - Since the snooper does not know p and

Explain in brief about crc, What is CRC The CRC is computed while trans...

What is CRC The CRC is computed while transmission and appended to output stream as soon as last bit goes out onto wire. If the CRC were in header, it will be necessary to make

What is shielded twisted pair, Q. What is Shielded Twisted Pair? - A me...

Q. What is Shielded Twisted Pair? - A metal foil or braided-mesh covering encases every pair of insulated conductors to prevent electromagnetic noise called crosstalk - Cros

What is unacknowledged connectionless service, What is Unacknowledged conne...

What is Unacknowledged connectionless service This service is a datagram-style service. It is a very simple service that does not involve any of the flow- and error-control mec

Define firewall and its uses, Firewall is a device or a component that res...

Firewall is a device or a component that restricts access between a protected or an internal network from an external or untrustworthy network .A firewall basically limits unautho

Calculate the efficiency of stop and wait arq, (i)  Suppose that frames are...

(i)  Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frames are 25 bytes long. a)  Calculate the efficiency of stop-and-wait ARQ in

Length- transport layer, Length This is a 16 bit  field  that  defines...

Length This is a 16 bit  field  that  defines  the total  length  of the user  datagram, header  plus data. This 16 bit  can define  a total  length  of a 0 to 65, 535 bytes.

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