Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Anycasting in Adversarial Systems: Routing and Admission Control
 

Summary: Anycasting in Adversarial Systems:
Routing and Admission Control
Baruch Awerbuch1
, AndrŽe Brinkmann2
, and Christian Scheideler1
1
Department of Computer Science, Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD
21218, USA, {baruch,scheideler}@cs.jhu.edu
2
Heinz Nixdorf Institute and Department of Electrical Engineering, University of Paderborn, 33102
Paderborn, Germany, brinkman@hni.upb.de
Abstract. In this paper we consider the problem of routing packets in dynamically chang-
ing 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

  

Source: Awerbuch, Baruch - Department of Computer Science, Johns Hopkins University

 

Collections: Computer Technologies and Information Sciences