Abstract
In this paper, we propose a new structured P2P overlay network, named SW-Uinta, where employs a non-deterministic caching strategy that allows for polylogarithmic search time while having only a constant cache size. Compared with deterministic caching strategies proposed by previous P2P systems, the non-deterministic caching strategy can reduce communication overhead for maintaining the routing cache table. Cache entries in the peer can be updated by subsequent queries rather than only by running stabilization periodically. A novel cache replacement scheme is used to improve lookup performance. We compare the performance of our system with that of other structured P2P networks such as Chord and Uinta. It shows that the SW-Uinta protocol can achieve improved object lookup performance and reduce maintenance cost compared with some other protocols.
This paper is supported by National Science Foundation of China under grant 60433040, and CNGI projects under grant CNGI-04-12-2A and CNGI-04-12-1D.
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
Gnutella: http://www.gnutellaforums.com/
Leibowitz, N., Ripeanu, M., Wierzbicki, A.: Deconstructing the Kazaa Network. In: Proc. of 3rd IEEE Workshop on Internet Applications, Santa Clara, CA, pp. 112–120 (2003)
Clarke, I., Sandberg, O., Wiley, B., et al.: Freenet: A Distributed Anonymous Information Storage and Retrieval System. In: Proc. of Workshop on Design Issues in Anonymity and Unobservability. ICSI, pp. 311–320 (2000)
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 the ACM SIGCOMM, pp. 149–160. ACM Press, New York (2001)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proc. of ACM SIGCOMM, pp. 161–172. ACM Press, New York (2001)
Rowstron, A., Druschel, P.: Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems. In: Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms, pp. 329–350. Springer, Heidelberg (2001)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, J., Joseph, S.C., Kubiatowicz, A.D.: A Resilient Global-Scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22, 41–53 (2004)
Sarshar, N., Roychowdhury, V.P.: A Random Structure for Optimum Cache Size Distributed Hash Table (DHT) Peer-to-Peer Design (2002), http://www.ee.ucla.edu/~nima/Publications/opt_cache.pdf
Jin, H., Xu, J., Zou, B., Zhang, H.: Uinta: A P2P Routing Algorithm Based on the User’s Interest and the Network Topology. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 238–249. Springer, Heidelberg (2005)
Milgram, S.: The Small World Problem. Psychology Today 2, 60–67 (1967)
Watts, D., Strogatz, S.: Collective Dynamics of Small-World Networks. Nature 393, 440–442 (1998)
Kleinberg, J.: Small-World Phenomena and the Dynamics of Information. In: Proceedings of Advances in Neural Information Processing Systems, pp. 14–25. MIT Press, Cambridge (2002)
Kleinberg, J.: The Small-World Phenomenon: An Algorithmic Perspective. Cornell Computer Science Technical Report 99-1776 (2000)
Iamnitchi, A., Ripeanu, M., Foster, I.: Small-World File-Sharing Communities. In: Proceedings of IEEE INFOCOM, pp. 175–186 (2004)
Zhang, H., Goel, A., Govindan, R.: Using the Small-World Model to Improve Freenet Performance. In: Proceedings of IEEE INFOCOM 2002, pp. 1228–1237 (2002)
Mahanti, A.: Web Proxy Workload Characterization and Modeling. Master Thesis. Department of Computer Science, University of Saskatchewan (1999)
Zegura, E.W., Calvert, K., Bhattacharjee, S.: How to Model an Internet Work. In: Proceedings of INFOCOM 1996, pp. 594–602 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Xu, J., Jin, H. (2007). SW-Uinta: A Small-World P2P Overlay Network. In: Li, K., Jesshope, C., Jin, H., Gaudiot, JL. (eds) Network and Parallel Computing. NPC 2007. Lecture Notes in Computer Science, vol 4672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74784-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-74784-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74783-3
Online ISBN: 978-3-540-74784-0
eBook Packages: Computer ScienceComputer Science (R0)