DKS(N, k, f): A family of low communication, scalable and fault-tolerant infrastructures for P2P applications

Proceedings - CCGrid 2003: 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid

Volumn , Issue , 2003, Pages 344-350

  Alimal, Luc Onana ^a   El Ansary, Sameh ^b   Brand, Per ^b   Haridi, Seif ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b SWEDISH INSTITUTE OF COMPUTER SCIENCE   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH CONSUMPTION; FAULT-TOLERANT; NORMAL OPERATIONS; P2P APPLICATIONS; PEER-TO-PEER APPLICATION; ROUTING ENTRY; ROUTING TABLE; THREE PARAMETERS;

CLUSTER COMPUTING; FAULT TOLERANCE; OVERLAY NETWORKS;

PEER TO PEER NETWORKS;

EID: 15744383947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCGRID.2003.1199386     Document Type: Conference Paper

References (7)

1. Mozart Consortium, http://www.mozart-oz.org
2. Flaviu Cristian. Understanding fault-tolerant distributed systems. Communications of the ACM, 34(2):56-78, 1991
3. Sameh El-Ansary, Luc Onana Alima, Per Brand, and Seif Haridi. A framework for peer-to-peer lookup services based on k-ary search. Technical Report TR-2002-06, SICS, May 2002
4. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content addressable network. Technical Report TR-00-010, Berkeley, CA, 2000
5. Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Lecture Notes in Computer Science, 2218, 2001
6. I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Bal-akrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In ACM SIGCOMM 2001, pages 149-160, San Deigo, CA, August 2001
7. Ben Y. Zhao, John D. Kubiatowicz, and Anthony D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. U. C. Berkeley Technical Report UCB//CSD-01-1141, April 2000.