From static distributed systems to dynamic systems

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2005, Pages 109-118

  Mostefaoui, Achour ^a   Raynal, Michel ^a   Travers, Corentin ^a   Patterson, Stacy ^b   Agrawal, Divyakant ^b   El Abbadi, Amr ^b  

^a UNIVERSITÉ DE RENNES 1   (France)

^b University of California   (United States)

Author keywords

Communication abstraction; Dynamic system; Eventual stability condition; Peer to Peer system; Persistent reliable broadcast; Query response pattern

Indexed keywords

COMMUNICATION ABSTRACTION; DYNAMIC SYSTEMS; EVENTUAL STABILITY CONDITION; PEER-TO-PEER SYSTEM; PERSISTENT RELIABLE BROADCAST; QUERY-RESPONSE PATTERN;

ABSTRACTING; BROADCASTING; COMPUTATIONAL METHODS; DATA TRANSFER; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PROGRAM PROCESSORS; QUERY LANGUAGES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33749376260     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RELDIS.2005.19     Document Type: Conference Paper

References (28)

1. Aguilera M.K., A Pleasant Stroll Through the Land of Infinitely Many Creatures. ACM SIGACT News, Distributed Computing Column, 35(2):36-59, 2004.
2. Aguilera M.K., Delporte-Gallet C., Fauconnier H. and Toueg S., Communication-Efficient Leader Election and Consensus with Limited Link Synchrony. Proc. 23th ACM Symp. on Principles of Distributed Computing, ACM Press, pp. 328-337, 2004.
3. Angluin D., Local and Global Properties in Networks of Processes. Proc. 12th ACM Symp. on Theory of Computing (STOC'80), ACM Press, pp. 82-93, 1980.
4. Chandra T.D. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. J. of the ACM, 43(2):23-267, 1996.
5. Chandra T.D., Hadzilacos V. and Toueg S., The Weakest Failure Detector for Solving Consensus. J. of the ACM, 43(4):685-722, 1996.
6. Chandy K.M. and Misra J., How Processes Learn. Distributed Computing, 1(1):40-52, 1986.
7. Chawathe Y., Ratnasamy S., Breslau L., Nick Lanham, Shenker S., Making Gnutella-like P2P Systems Scalable. Proc. of the 2003 Conf. On Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM'03), pp. 407-418.
8. Fischer M.J., Lynch N. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374-382, 1985.
9. Flocchini P., Mans B. and Santoro N., Sense of Direction in Distributed Computing. Proc. 12th Int'l Symp. on Distributed Computing (DISC'98), Springer-Verlag LNCS #1499, pp. 1-16, 1998.
10. Friedman R., Raynal M. and Travers C., Two Abstractions for Implementing Atomic Objects in Dynamic Systems. Brief Announcement, Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC'05), ACM Press, July 2005. (http://www.irisa.fr/bibli/publi/pi/2005/1692/1692.html).
11. Gummadi K., Dunn R., Saroiu S., Gribble S., Levy H., and Zahorjan J., Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload, Proceedings of the 19th ACM Symp. on Operating Systems Principles (SOSP'03), pp. 381-394, 2003.
12. Guerraoui R. and Raynal M., The Information Structure of Indulgent Consensus. IEEE Trans. on Computers, 53(4):453-466, 2004.
13. Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press, N-Y, pp. 97-145, 1993.
14. Hermant J.-F. and Le Lann G., Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems. IEEE Trans. on Computers, 51(8):931-944, 2002.
15. Lamport, L., Time, Clocks and the Ordering of Events in a Distributed System. Comm. of the ACM, 21(7):558-565, 1978.
16. Lamport L., The Part-Time Parliament. ACM Trans. on Computer Systems, 16(2):133-169, 1998.
17. Larrea M., Fernández A. and Arèvalo S., Optimal Implementation of the Weakest Failure Detector for Solving Consensus. Proc. 19th Symp. on Reliable Distributed Systems (SRDS'00), IEEE Computer Society Press, pp. 52-60, 2000.
18. Liben-Nowell D., Balakkrishnan H. and Karger D., Analysis of the Evolution of Peer-to-Peer Systems. Proc. 21th ACM Symp. on Principles of Distributed Computing, ACM Press, pp. 233-242, 2002.
19. Merritt M. and Taubenfeld G., Computing Using Infinitely Many Processes. Proc. 14th Int'l Symposium on Distributed Computing (DISC'00), Springer-Verlag LNCS #1914, pp. 164-178, 2000.
20. Mostefaoui A., Mourgaya E., Raipin Parvedy Ph. and Raynal M., Evaluating the Condition-Based Approach to Solve Consensus. Proc. Int. IEEE Conference on Dependable Systems and Networks (DSN'03), IEEE Computer Society Press, pp. 541-550, 2003.
21. Mostefaoui A., Mourgaya E., and Raynal M., Asynchronous Implementation of Failure Detectors. Proc. Int. IEEE Conference on Dependable Systems and Networks (DSN'03), IEEE Computer Society Press, pp. 351-360, San Francisco (CA), 2003.
22. Mostefaoui A. and Raynal M., Leader-Based Consensus. Parallel Processing Letters, 11(1):95-107, 2001.
23. Mostefaoui A., Raynal M. and Travers C., Crash-Resilient TimeFree Eventual Leadership. Proc. 23th Symposium on Reliable Distributed Systems (SRDS'04), IEEE Computer Society Press, pp. 208-217, 2004.
24. Raynal M., A Short Introduction to Failure Detectors for Asynchronous Distributed Systems. ACM SIGACT News, Distributed Computing Column, 36(1):53-70, 2005.
25. Rowstron A. and Druschel P., Pastry: Scalable, Distributed Object Location and Routing for Large Scale Peer-to-Peer Systems. Proc.18th IFIP/ACMInt'l Conf. on Dist. Systems Platforms (Middleware 2001), Springer-Verlag LNCS #2218, pp. 329-350, 2001.
26. Stoica I., Morris R., Liben-Nowell D., Karger D., Kaashoek M.F., Dabek F. and Balakrishnan H., Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. ACM/IEEE Trans. on Networking, 11(1):17-32, 2003.
27. Stutzbach D. and Rejaie R., Towards a better Understanding of Churn in Peer-to-Peer Networks. Tech Report CIS-TR-04-06, Dpt of CS, University of Oregon, 2004.
28. Zhao B., Kubiatowicz J. and Joseph A., Tapestry: An Infrastructure for Fault-Tolerant Wide-area Location and Routing. Tech Report UCB/CSD-OI-I141, CS Division, U.C. Berkeley, 2001.