Integrated routing algorithms for anycast messages

被引:35
作者
Jia, WJ [1 ]
Xuan, D
Zhao, W
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[2] Texas A&M Univ, Dept Comp Sci, College Stn, TX 77843 USA
关键词
Algorithms - Congestion control (communication) - Costs - Packet networks - Telecommunication traffic - Voice/data communication systems;
D O I
10.1109/35.815452
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same path for anycast packets from a source, while multipath routing splits anycast traffic into several different paths. The former is simple and easy to implement, while the latter may potentially reduce congestion, improving delay and throughput performance. However, multipath routing may require additional cost to maintain multipath information. To take advantage of both approaches and overcome their shortcomings, we develop a set of integrated routing algorithms that can adaptively select a subset of routers in the network to carry out multipath routing for anycast messages. We demonstrate that systems using our integrated routing algorithms perform substantially better than those where either the single-path or multipath approach is used alone.
引用
收藏
页码:48 / 53
页数:6
相关论文
共 10 条
[1]  
[Anonymous], 1884 RFC
[2]  
BHATTACHARJEE S, 1997, P IEEE INFOCOM 97 AP
[3]  
Deering S., 1998, INTERNET PROTOCOL VE
[4]   MINIMUM DELAY ROUTING ALGORITHM USING DISTRIBUTED COMPUTATION [J].
GALLAGER, RG .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1977, 25 (01) :73-85
[5]  
GUSTAFSSON E, 1997, IEEE NETWORK MAR, V11
[6]  
GUTTMAN E, 1998, SERVICE LOCATION PRO
[7]  
JIA W, 1999, IN PRESS IEEE T SEP
[8]  
PARTRIDGE C, 1998, IEEE ACM T NETWORKIN, V6
[9]  
Partridge Craig, 1993, 1546 RFC
[10]  
XUAN D, 1998, P ICPP 98 AUG