Explain adaptive routing, Computer Engineering

Assignment Help:

Explain adaptive routing.

Adaptive routing defines the ability of a system, by which routes are characterised through their destination, to change the path that the route takes by the system in response to a modification in conditions. The adaptation is intended to permit as many routes as possible to remain valid (which have destinations which can be reached) in response to the change.

People utilizing a transport system can display adaptive routing. For illustration, if a local railway station is closed, people can alight from a train at other station and use another way, as a bus, only to reach their destination.


Related Discussions:- Explain adaptive routing

EDC, Conparision of masfet and jfet

Conparision of masfet and jfet

Write the game using writing functions, The year is 2199. For many generati...

The year is 2199. For many generations, the robotic Cyleth have faithfully served humanity. However, under the direction of the computerized superintelligence Skyweb, they have tur

What are the various functional verification methodologies, What are the va...

What are the various functional verification methodologies Ans: TLM (Transaction Level Modelling) Linting RTL Simulation (Environment  involving  :  stimulus  generators,

What are function modules, What are function modules? Function m...

What are function modules? Function modules are general-purpose library routines that are available system-wide.

What are the special features of direct rdram, What are the special feature...

What are the special features of Direct RDRAM? It is a two channel Rambus It has 18 data lines intended to transfer two bytes of data at a time There are no divide

Advantages and disadvantages of shared memory programming, Q. Show Advantag...

Q. Show Advantages and Disadvantages of Shared Memory Programming? Advantages of Shared Memory Programming Data sharing between processes is both rapid and uniform bec

#title.linear programming, zmax=7.5x1-3x2 subject to constraints 3x1-x2-x3>...

zmax=7.5x1-3x2 subject to constraints 3x1-x2-x3>=3 x1-x2+x3>=2 x1,x2,x3>=0

What is ai checkers, The major programs here are Arthur Samuel's, the rote ...

The major programs here are Arthur Samuel's, the rote learning method which is a lot like a memory based method, generalization learning which is a lot like backprop and a signatur

What is the difference among declaration and definition, The declaration te...

The declaration tells the compiler that at some later point we plan to show the definition of this declaration. E.g.: void stars () //function declaration The definition con

What is matrix addressing mode, What is Matrix Addressing Mode. Ans. M...

What is Matrix Addressing Mode. Ans. Matrix Addressing Mode: The arrangement which needs the fewest address lines is a square array of n rows and n columns for a whole memory

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