As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
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.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.