Online Algorithm for Application Layer Anycast

Authors:
Shui Yu;Zhongwen Li;Bin Liu
Affiliations:
School of Engineering and Information Technology, Deakin University, VIC 3125, Australia;College of Information Science and Technology, Xiamen University, Xiamen, 361005, P.R. China;School of Communication and Information Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, P.R. China
Venue:
Proceedings of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006
Year:
2006

Citing 4
Cited 0

Online computation and competitive analysis

Online computation and competitive analysis
A Routing Protocol for Anycast Messages

IEEE Transactions on Parallel and Distributed Systems
An Efficient Algorithm for Application-Layer Anycasting

DCW '02 Revised Papers from the 4th International Workshop on Distributed Communities on the Web
Application-Layer Anycasting

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Quantified Score

Hi-index	0.00

Visualization

Abstract

Application layer anycast possesses the property of flexibility, however, all the proposed application layer anycast routing algorithms are based on probing so far. One disadvantage of probing algorithms is that there are too many probing packets, which degrade the network performance, wast network bandwidth. In this paper, we propose an online algorithm, balance algorithm, for application layer anycast. Compared with the probing algorithms, the proposed algorithm has no probing cost at all. We model the two kinds of algorithms, and analyse the performance of the two algorithms. The results show that the online balance algorithm is better than the probing algorithms in terms of performance. A simulation is conducting as future work.