Load-balanced anycast routing in computer networks
作者： W.T. Zaumen , S. Vutukury , J.J. Garcia-Luna-Aceves
关键词: Routing domain 、 Anycast 、 Distance-vector routing protocol 、 Dynamic Source Routing 、 Path vector protocol 、 Distributed computing 、 Static routing 、 Distributed algorithm 、 Node (networking) 、 Destination-Sequenced Distance Vector routing 、 Computer science 、 Link-state routing protocol 、 Server 、 Hierarchical routing 、 Policy-based routing 、 Computer network 、 Triangular routing 、 Geographic routing 、 Load balancing (computing) 、 Equal-cost multi-path routing 、 Routing table 、 Multipath routing 、 Wireless Routing Protocol 、 Routing Information Protocol 、 Enhanced Interior Gateway Routing Protocol 、 Zone Routing Protocol 、 Routing protocol
摘要: We present a practical approach to routing and anycasting with near-optimum delays taking into account the processing loads at routers elements of computer network. To accomplish this, minimum-delay problem formulated by Gallager (1977) is generalized load-balancing for in network nodes (servers routers). Gallager's theorem necessary sufficient conditions modified include changes traffic levels nodes. The first distributed algorithm load-balanced networks presented. This algorithm, named MIDAS, provides approximate solutions routing. Simulations are use compare performance new traditional sever load balancing.
acm.org 
sci-hub.se 参考文章(14)
W.T. Zaumen, J.J. Garcia-Luna-Aceves, Loop-free multipath routing using generalized diffusing computations international conference on computer communications. ,vol. 3, pp. 1408- 1417 ,(1998) , 10.1109/INFCOM.1998.662958
Srinivas Vutukury, J. J. Garcia-Luna-Aceves, A simple approximation to minimum-delay routing acm special interest group on data communication. ,vol. 29, pp. 227- 238 ,(1999) , 10.1145/316188.316227
R. Gallager, A Minimum Delay Routing Algorithm Using Distributed Computation IEEE Transactions on Communications. ,vol. 25, pp. 73- 85 ,(1977) , 10.1109/TCOM.1977.1093711
Ariel Orda, Raphael Rom, Optimal packet fragmentation and routing in computer networks Networks. ,vol. 29, pp. 11- 28 ,(1997) , 10.1002/(SICI)1097-0037(199701)29:1<11::AID-NET2>3.0.CO;2-F
A. Segall, The Modeling of Adaptive Routing in Data-Communication Networks IEEE Transactions on Communications. ,vol. 25, pp. 85- 95 ,(1977) , 10.1109/TCOM.1977.1093715
D. Bertsekas, Dynamic behavior of shortest path routing algorithms for communication networks IEEE Transactions on Automatic Control. ,vol. 27, pp. 60- 74 ,(1982) , 10.1109/TAC.1982.1102884
A. Segall, M. Sidi, A Failsafe Distributed Protocol for Minimum Delay Routing IEEE Transactions on Communications. ,vol. 29, pp. 689- 695 ,(1981) , 10.1109/TCOM.1981.1095036
A. Orda, R. Rom, Routing with packet duplication and elimination in computer networks IEEE Transactions on Communications. ,vol. 36, pp. 860- 866 ,(1988) , 10.1109/26.2816
A. Orda, R. Rom, Optimal routing with packet fragmentation in computer networks IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings. pp. 602- 609 ,(1993) , 10.1109/INFCOM.1993.253312
J.J. Garcia-Luna-Aceves, S. Vutukury, W.T. Zaumen, A practical approach to minimizing delays in Internet routing international conference on communications. ,vol. 1, pp. 479- 483 ,(1999) , 10.1109/ICC.1999.767986