The Need for Adaptive Routing in the Chaotic and Unbalanced Traffic Environment
- 1 April 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 29 (4) , 481-490
- https://doi.org/10.1109/tcom.1981.1095005
Abstract
By classifying traffic conditions into four categories, we investigate the preference for a deterministic or an adaptive routing strategy with respect to a traffic category. The four categories are: 1) balanced, emulating known and stationary traffic conditions; 2) balanced with surge, emulating a balanced traffic condition with possible unexpected sudden increases in traffic demands between some source-destination pairs; 3) unbalanced, emulating unknown or nonstationary traffic conditions with low to moderate traffic loading; and 4) chaotic, emulating unknown or nonstationary traffic conditions with heavy traffic loading. Our study concludes that a well-chosen deterministic strategy is better for balanced traffic; both deterministic and adaptive procedures are appropriate for balanced traffic with surge; and a well-chosen adaptive strategy is preferred for the unbalanced and chaotic conditions. We also attempt to define a routing strategy that behaves almost deterministically when appropriate and adaptively otherwise. We contend that an adaptive routing strategy with a second-order metric , where are constants and is the queue size at a link, is a good compromise. (Values of a1and a2depend on network topology and congestion control strategies.) Our reasoning and results are supported and verified by experimenting with a detailed simulation program.Keywords
This publication has 13 references indexed in Scilit:
- An overview of the new routing algorithm for the ARPANETPublished by Association for Computing Machinery (ACM) ,1979
- A Basic Dynamic Routing Problem and DiffusionIEEE Transactions on Communications, 1978
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- Throughput in the ARPANET--Protocols and MeasurementIEEE Transactions on Communications, 1977
- On quadratic adaptive routing algorithmsCommunications of the ACM, 1976
- A study of line overhead in the ArpanetCommunications of the ACM, 1976
- Deterministic and adaptive routing policies in packet-switched computer networksPublished by Association for Computing Machinery (ACM) ,1973
- The flow deviation method: An approach to store‐and‐forward communication network designNetworks, 1973
- Improvements in the design and performance of the ARPA networkPublished by Association for Computing Machinery (ACM) ,1972
- The interface message processor for the ARPA computer networkPublished by Association for Computing Machinery (ACM) ,1970