ACM Home Page
Please provide us with feedback. Feedback
A DoS-resilient information system for dynamic data management
Full text PdfPdf (437 KB)
Source
ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures table of contents
Calgary, AB, Canada
SESSION: Fault tolerance and reliability table of contents
Pages 300-309  
Year of Publication: 2009
ISBN:978-1-60558-606-9
Authors
Matthias Baumgart  Technische Universität München, Garching bei München, Germany
Christian Scheideler  University of Paderborn, Paderborn, Germany
Stefan Schmid  Technische Universität München, Garching bei München, Germany
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 39,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1583991.1584064
What is a DOI?

ABSTRACT

Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely connected servers) called Chameleon which is robust to DoS attacks on the nodes as well as the operations of the system. In particular, it allows nodes to efficiently look up and insert data items at any time, despite a powerful "past-insider adversary" which has complete knowledge of the system up to some time point t0 and can use that knowledge in order to block a constant fraction of the nodes and inject lookup and insert requests to selected data. This is achieved with a smart randomized replication policy requiring a polylogarithmic overhead only and the interplay of a permanent and a temporary distributed hash table. All requests in Chameleon can be processed in polylogarithmic time and work at every node.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
B. Awerbuch and C. Scheideler. A Denial-of-Service Resistant DHT. In Proc. 21st International Symposium on Distributed Computing (DISC), 2007.
 
3
D. Bernstein. SYN Cookies. In http://cr.yp.to/syncookies.html, 2008.
4
 
5
 
6
 
7
 
8
J. Ioannidis and S. M. Bellovin. Implementing Pushback: Router-Based Defense Against DDoS Attacks. In Proc. Network and Distributed System Security Symposium (NDSS), 2002.
 
9
10
11
12
 
13
 
14
 
15
Mazu Networks Inc. http://mazunetworks.com. 2008.
 
16
McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, pages 195--247. Springer Verlag, Berlin, 1998.
 
17
18
19
20
 
21
 
22
 
23
 
24
E. Ratliff. The Zombie Hunters. In The New Yorker, 2005.
25
 
26
C. Scheideler. Probabilistic Methods for Coordination Problems. HNI-Verlagsschriftenreihe 78, University of Paderborn, 2000.
 
27
 
28
29
 
30
I. Stoica, R. Morris, D. Liben-Nowell, D. Karger, M. F. Kaashoek, F. Dabek, and H. Kalakrishnan. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In Technical Report MIT, 2002.
 
31
M. Walfish, H. Balakrishnan, D. Karger, and S. Shenker. DoS: Fighting Fire with Fire. In Proc. Workshop on Hot Topics in Networks (HotNets), 2005.
32
33

Collaborative Colleagues:
Matthias Baumgart: colleagues
Christian Scheideler: colleagues
Stefan Schmid: colleagues