Affiliation:
1. Université catholique de Louvain, Belgium
Abstract
Distributed systems with a centralized architecture present the well known problems of single point of failure and single point of congestion; therefore, they do not scale. Decentralized systems, especially as peer-to-peer networks, are gaining popularity because they scale well, and do not need a server to work. However, their complexity is higher due to the lack of a single point of control and synchronization, and because consistent decentralized storage is difficult to maintain when data constantly evolves. Self-management is a way of handling this higher complexity. In this paper, the authors present a decentralized system built with a structured overlay network that is self-organized and self-healing, providing a transactional replicated storage for small or large scale systems.
Reference28 articles.
1. Collet, R., & Van Roy, P. (2006). Failure handling in a network-transparent distributed programming language. In Advanced topics in exception handling techniques (p. 121-140).
2. Dabek, F., Brunskill, E., Kaashoek, M. F., Karger, D. R., Morris, R., Stoica, I., et al. (2001). Building peer-to-peer systems with Chord, a distributed lookup service. In Hotos (pp. 81-86). Washington, DC: IEEE Computer Society.
3. Daswani, N., & Garcia-Molina, H. (2002). Query-flood dos attacks in gnutella. In Proceedings of the 9th ACM conference on computer and communications security (Ccs ’02) (pp. 181-192). New York: ACM.
4. FreeNet Community. (2003). The freenet project. Retrieved from http://freenetproject.org
5. Ghodsi, A. (2006). Distributed k-ary system: Algorithms for dis-tributed hash tables. Unpublished doctoral dissertation, KTH – Royal Institute of Technology, Stockholm, Sweden.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献