Deakin University
Browse

File(s) under permanent embargo

Online algorithm for application layer anycast

journal contribution
posted on 2006-01-01, 00:00 authored by Shui Yu, Z Li, B Liu
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.

History

Journal

Frontiers in artificial intelligence and applications: advances in intelligent IT: active media technology

Volume

138

Pagination

340 - 345

Publisher

IOS Press

Location

Amsterdam, Netherlands

ISSN

0922-6389

eISSN

1879-8314

Language

eng

Publication classification

C1 Refereed article in a scholarly journal

Copyright notice

2006, The authors

Usage metrics

    Research Publications

    Categories

    No categories selected

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC