Telecommunications Network - Routing

Routing is the selection of paths for packets. This is usually done by the network but the source could also identify the path, if it has the necessary information.

Two types of transport are used by store and forward networks:-

Usefull Routing Algorithm Characteristics:

Robustness - it should adapt the routing decisions to changing conditions (i.e . network traffic and topology).

Stability - a small change in conditions should result in a small change in routing decisions.

Fairness - different users should experience equitable delays and transmission rates.

Optimality - maximizing the network designers objective function while satisfying the design constraints.

Classes of routing algorithm:-

Routing algorithms can be classified as non-adaptive and adaptive. If a network is stable in its topology and traffic flow a non-adaptive algorithm. In this case all routes are computed initially and never change. This relieves the nodes from havin to monitor changes and compute new routes.

Alternately adaptive algorithms attempt to make routing decisions based on current traffic and topology. These algorithms can be divided into 3 sub-classes.

 

 


metadata block
see also:

 

Correspondence about this page

Book Shop - Further reading.

Where I can, I have put links to Amazon for books that are relevant to the subject, click on the appropriate country flag to get more details of the book or to buy it from them.

cover The Essential Guide to Telecommunications (Essential Guide).

Commercial Software Shop

Where I can, I have put links to Amazon for commercial software, not directly related to the software project, but related to the subject being discussed, click on the appropriate country flag to get more details of the software or to buy it from them.

cover Palm Treo 650 GSM/GPRS Smartphone

This site may have errors. Don't use for critical systems.

Copyright (c) 1998-2015 Martin John Baker - All rights reserved - privacy policy.