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

Hypercube network and properties, Hypercube Network The hypercube archi...

Hypercube Network The hypercube architecture has played a vital role in the development of parallel processing and is still not much popular and influential. The highly symmetr

Distinguish among client process and server process, QUESTION (a) Expla...

QUESTION (a) Explain briefly what is meant Client-server Computing? (b) Distinguish among client process and server process (c) What are the four basic characteristics of

Write down the purpose of arp?, Address Resolution Protocol resolves the MA...

Address Resolution Protocol resolves the MAC address if the IP address is known. It is a layer 3 protocol.

Thin ethernet wiring, THIN ETHERNET WIRING: Thin Ethernet needs thin c...

THIN ETHERNET WIRING: Thin Ethernet needs thin coax cable that is cost effective and easier to install than thick Ethernet coax. In this case transceiver electronics are creat

Type of failures and bathtub curve, AILURES AND BATHTUB CURVE The life ...

AILURES AND BATHTUB CURVE The life of a component system can be grouped into three different phases typical curve depicting these three is called the bathtub curve due to its s

Evolution of data communication, Question 1 Discuss the following         ...

Question 1 Discuss the following                     Evolution of Data Communication                     Elements of Data Communication System Question 2 Explain the following

How xor operations can implement key stream attacks, Question: a) In a...

Question: a) In a wireless network where WEP is enforced as security mechanism, what procedure would the network manager adopt for changing WEP default keys. b) Using Pla

Which statement is true regarding half duplex, Half duplex is analogous to ...

Half duplex is analogous to a one a lane bridge, it can handle traffic in both directions but no at the similar time.

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

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