Affiliation:
1. Mathematica, Inc., Princeton, NJ
Abstract
Two analytic models of a store-and-forward communications network are constructed, one to find the optimal message routing and the other to illustrate the equilibrium (stationary state) maintained by an adaptive routing algorithm. These models show that adaptive routing does not satisfy the necessary conditions for an optimal routing. Adaptive routing tends to overuse the direct path and underuse alternate routes because it does not consider the impact of its current routing decision on the future state of the network. The form of the optimality conditions suggests that a modification of the adaptive algorithm will result in optimality. The modification requires the substitution of a quadratic bias term instead of a linear one in the routing table maintained at each network node. Simulation results are presented which confirm the theoretical analysis for a simple network.
Publisher
Association for Computing Machinery (ACM)
Reference11 articles.
1. Statistical Analysis for Queueing Simulations
2. Routing in computer networks
3. The flow deviation method: An approach to store-and-forward communication network design
4. Fultz G.L. Adaptive routing techniques for messageswitching computer-communication networks. Rep. No. UCLA-Eng-7252 (ARPA) July 1972 UCLA Computer Sci. Dep. Available from NITS as document AD 749 678. Fultz G.L. Adaptive routing techniques for messageswitching computer-communication networks. Rep. No. UCLA-Eng-7252 (ARPA) July 1972 UCLA Computer Sci. Dep. Available from NITS as document AD 749 678.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. HALO: Hop-by-Hop Adaptive Link-State Optimal Routing;IEEE/ACM Transactions on Networking;2015-12
2. Optimal control of store-and-forward networks;Optimal Control Applications and Methods;2007-10-29
3. Unloading of congestion in deterministic queueing networks;Optimal Control Applications and Methods;2007-10-29
4. Characteristics of deterministic optimal routing for a simple traffic control problem;1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305);1999
5. Routing with packet duplication and elimination in computer networks;IEEE Transactions on Communications;1988-07