Dijkstra algorithms - network layer and routing , Computer Networking

Assignment Help:

Dijkstra Algorithms

To calculate its  routing  table  each router applies an algorithm  called  the dijkstra algorithm to its  state database. The dijkstra algorithm  calculates the shortest path between two points on a network using a graph using a made up of nodes and arcs. Notes  are of two  types networks and routers. Arcs  are the connection between  a router  and a network ( router to network  and network  to router). Cost is applied  only to the are from router to network.  The cost  of the  from  network  to router is always zero .

 

Costs in the  dijkstra algorithm

 


Related Discussions:- Dijkstra algorithms - network layer and routing

Hyper text transfer protocols ( http), Hyper  Text Transfer Protocols ( HT...

Hyper  Text Transfer Protocols ( HTTP) The Hyper text  protocols ( HTTP) is at  the heart  of the  web. If a browser  developer follows  the rules  of the HTTP, the  browser w

Inductor, #clasification of inductor

#clasification of inductor

Local loop portion of the service starts, What is the juncture at which the...

What is the juncture at which the CPE ends and the local loop portion of the service starts?  Ans) The demarcation or demarc is the juncture at which the CPE ends and the local

Write a descriptive note on rmonv2, Question 1 What does the SNMP access p...

Question 1 What does the SNMP access policy represent? Question 2 Does there exist any formal functional specification for SNMPv1 management? Question 3 In the con

Telecommunication switching system, if the signal input to an amplifier is ...

if the signal input to an amplifier is 0 dBm what is the power output in mW if the gain of the amplifier is 20 dB ?

Sketch the output waveform square wave that symmetrical, Question: The ...

Question: The input to the circuit in the figure is a square wave that is symmetrical about 0V. Sketch the output waveform.

Karnaugh map, Qustions: Simplify the following expression using a Karna...

Qustions: Simplify the following expression using a Karnaugh map: F = XY‾Z + X‾Y‾Z + XY Z +X‾ Y Z

Explain the transport layer and network layer, Question: (a) Describe ...

Question: (a) Describe briefly the difference between flow control and congestion control in relation to a connection-oriented protocol such as TCP. (b) What is the initia

Ipx traffic on a network, To monitor ipx traffic on a network, what command...

To monitor ipx traffic on a network, what command would we use? Ans) show ipx traffic

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