End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Slide—the key to polynomial end-to-end communication
Journal of Algorithms
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
From static to dynamic routing: efficient transformations of store-and-forward protocols
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Stability of networks and protocols in the adversarial queueing model for packet routing
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Stability of Adversarial Queues via Fluid Models
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Universal stability results for greedy contention-resolution protocols
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Simple Routing Strategies for Adversarial Systems
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Polynomial end-to-end communication
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
A simple local-control approximation algorithm for multicommodity flow
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
On local algorithms for topology control and routing in ad hoc networks
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
Branch-and-bound algorithm for anycast flow assignment in connection-oriented networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Anycasting in connection-oriented computer networks: Models, algorithms and results
International Journal of Applied Mathematics and Computer Science - Computational Intelligence in Modern Control Systems
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Heuristic algorithm for anycast flow assignment in connection-oriented networks
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Packet routing and information gathering in lines, rings and trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Lagrangean heuristic for anycast flow assignment in connection-oriented networks
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Page migration in dynamic networks
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Connectivity games over dynamic networks
Theoretical Computer Science
Hi-index | 0.00 |
In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations but only has to reach any one of them. This set of destinations may just be given implicitly by some anycast address. For example, each service (such as DNS) may be given a specific anycast address identifying it, and computers offering this service will associate themselves with this address. This allows communication to be made transparent from node addresses, which makes anycasting particularly interesting for dynamic networks, in which redundancy and transparency are vital to cope with a dynamically changing set of nodes. However, so far not much is known from a theoretical point of view about how to efficiently support anycasting in dynamic networks. This paper formalizes the anycast routing and admission control problem for arbitrary traffic in arbitrary dynamic networks, and provides first competitive solutions. In particular, we show that a simple local load balancing approach allows to achieve a near-optimal throughput if the available buffer space is sufficiently large compared to an optimal algorithm. Furthermore, we show via lower bounds and instability results that allowing admission control (i.e. dropping some of the injected packets) tremendously helps in keeping the buffer resources necessary to compete with optimal algorithms low.