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

why doesn''t c have nested functions, It's not trivial to execute nested f...

It's not trivial to execute nested functions such that they have the proper access to local variables in the having function(s), so they were deliberately left out of C as a simpli

Determine the decimal equivalent of binary 1100 ?, The decimal equivalent o...

The decimal equivalent of (1100) 2   is ? Ans. (1100) 2 = (12) 10

What are base tables of an aggregate object, What are base tables of an agg...

What are base tables of an aggregate object? The tables making up an aggregate object (primary and secondary) are known as aggregate object.

create a class called auditorium, Create a class called auditorium that sp...

Create a class called auditorium that specifies the seats in the auditorium. The class should include at least one data item: seat (two dimensional array of Char) and at least thre

Build and fix model, Why Build and fix model is considered as ad-hoc softwa...

Why Build and fix model is considered as ad-hoc software development model?

Find the magnetic declination, Question Use the National Geophysical Da...

Question Use the National Geophysical Data Center software tool to find the magnetic declination. The link to the web site is in Useful Links on the course Blackboard home page

Queue, A Queue is a FIFO ( rst in, rst out) data structure. Given the foll...

A Queue is a FIFO ( rst in, rst out) data structure. Given the following queue interface: public interface Queue { int size(); // current queue size boolean isEmpty(); //

Difference between shadow and override in programming, Overriding tell us o...

Overriding tell us only the methods, but shadowing tells us the entire element.

Payment, how can get payment

how can get payment

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