Abstract
In this paper, we present C 2, a new overlay network based on CAN and Chord. For an n-peer C 2 system, each peer maintains only about O(logn) other peers’ information, and achieves routing within O(logn) hops. For each peer’s join or departure, C 2 can update the routing table within O(logn) messages with high probability. What distinguish C 2 from many other peer-to-peer data-sharing systems are its low computation cost and high routing efficiency in dynamic environment. In the case that considerable peers fail simultaneously (i.e., quite a lot other peers’ routing tables are out of date), the average hop number of successful routings does not increase obviously.
This work was supported by the Natural Science Foundation of China (NSFC) under grant no. 60373019, and Fudan University Innovation Foundation for Graduate Students.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: Oceanstore: An architecture for global-scale persistent storage. In: Proc. of ASPLOS 2000 (2000)
Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of the 21st ACM PODC (2002)
Plaxton, C., Rajaram, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. of SPAA (1997)
Ratnasamy, S., Francis, P., Handley, K., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proc. of ACM SIGCOMM 2001 (2001)
Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: Some open questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 45. Springer, Heidelberg (2002)
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of ACM International Conference on Distributed Systems Platforms (Middleware) (2001)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. of ACM SIGCOMM 2001, pp. 149–160. ACM Press, New York (2001)
Zhao, B., Kubiatowicz, J., Joseph, A.: Tapestry: An infrastructure for faulttolerant wide-area location and routing. Technical report, Tech. Rep. USB/CSD- 01-1141, University of California at Berkeley, Computer Science Department (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, W., Zhou, S., Xu, L., Qian, W., Zhou, A. (2004). C 2: A New Overlay Network Based on CAN and Chord. In: Li, M., Sun, XH., Deng, Qn., Ni, J. (eds) Grid and Cooperative Computing. GCC 2003. Lecture Notes in Computer Science, vol 3032. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24679-4_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24679-4_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21988-0
Online ISBN: 978-3-540-24679-4
eBook Packages: Springer Book Archive