Abstract
In conventional DHTs, each node is assigned an exclusive slice of identifier space. Simple it is, such arrangement may be rough. In this paper we propose a generic component structure: several independent nodes constitute a cell; a slice of identifier space is under nodes’ condominium; part of nodes in the same cell cooperatively and transparently shield the internal dynamism and structure of the cell from outsiders; this type of structure can be recursively repeated. Cells act like raw nodes in conventional DHTs and cell components can be used as bricks to construct any DHT-like systems. This approach provides encapsulation, scalable hierarchy, and enhanced security with bare incurred complexity.
This project is supported by the National Natural Science Foundation of China under Grant No. 60373004, No. 60373005, and No. 60273007, and by the National High Technology Development Program of China under Grant No. 2002AA104580
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: ICSI Technical Report (January 2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings ACM Sigcomm 2001, San Diego, CA (August 2001)
Druschel, A., Rowstron, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-peer System. In: Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, Middleware 2001 (2001)
Zhao, B.Y., Kubiatowicz, J., Joseph, A.D.: Tapestry: An Infrastructure for Faulttoleratnt Wide-area Location and Routing.Technical ReportUCB/CSD-01-1141
Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proceedings of the USENIX Symposium on Internet Technologies and Systems USITS (2003)
Kaashoek, F., Karger, D.R.: Koorde: A Simple Degree-optimal Hash Table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chen, M., Yang, G., Wu, Y., Liu, X. (2004). Paramecium: Assembling Raw Nodes into Composite Cells. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds) Network and Parallel Computing. NPC 2004. Lecture Notes in Computer Science, vol 3222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30141-7_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-30141-7_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23388-6
Online ISBN: 978-3-540-30141-7
eBook Packages: Springer Book Archive