Abstract
The technique of Distributed Hash Table (DHT) has become a fundamental part to build peer-to-peer (P2P) overlay network. It provides routing and location algorithms, and assumes each node over the network has equal responsibilities. However, these approaches did not consider the heterogeneous nature and the asymmetric property. Because each node has different properties in computing power, storage space, and network bandwidth, their contributions are frequently asymmetric. This paper presents Japster, an improved approach to P2P networks, which selects a portion of high capability machines that will stay on the network for a long period to be super node for routing accelerator, making all lookup operation finish quickly with three hops. Japster combines DHT and super node to make a good infrastructure with efficiency, self-adaptation and fault-tolerance, scalability, and load-balance.
Chapter PDF
References
Gnutella, [Online] Available: http://gnutella.wego.com/
Napster, [Online] Available: http://www.napster.com/
“Secure Hash Standard,” U.S. Dept. Commerce/NIST, National Technical Information Service, Springfield, VA, FIPS 180-1 (April 1995I)
Beverly, Y., Hector, G.M.: Comparing Hybrid Peer-to-Peer Systems. Technical report, Stanford University (2001)
Beverly, Y., Hector, G.M.: Designing a super-peer network, Technical report, Stanford University (2002)
Beverly, Y., Hector, G.M.: Improving search in peer-to-peer networks. In: Proc. 22nd Int. Conf. Distributed Computing Systems, pp. 5–14 (July 2002)
Botros, S., Waterhouse, S.: Search in JXTA and other Distributed Networks. In: Proc. 2001 Int’l Conf. Peer-to-Peer Computing (2001)
Cabrera, L.F., Jones, M.B., Theimer, M.: Herald: Achieving a global event notification service. In: Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems, HotOS 2001 (2001)
Clarke: A distributed decentralized information storage and retrieval system, Master’s thesis, Univ. Edinburgh, Edinburgh, U.K (1999)
Clarke, Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Proc. ICSI Workshop Design Issues in Anonymity and Unobservability, Berkeley, CA (June 2000), [Online]. Available: http://freenet.source-forge.net
Chu, Y.H., Rao, S.G., Zhang, H.: A case for end system multicast. In: Proceedings of ACM SIGMETRICS 2000 (2000)
Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proceedings of the 18th ACM Symposium on Operating Systems Principles, SOSP 2001 (2001)
Druschel, P., Rowstron, A.: Past: Persistent and anonymous storage in a peer-to-peer networking environment. In: Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems, HotOS 2001 (2001)
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 4th USITS (2003)
Karger, D.R., Lehman, E., Leighton, F., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proc. 29th Annu. ACM Symp. Theory of Computing, El Paso, TX, May 1997, pp. 654–663 (1997)
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. 9th Int. Conf. Architectural Support for Programming Languages and Operating Systems(ASPLOS 2000), Boston, MA, November 2000, pp. 190–201 (2000)
Kwon, G., Ryu, K.D.: An efficient peer-to-peer file sharing exploiting hierarchy and asymmetry. In: Proc. 2003 Symposium Applications and the Internet, pp. 226–233 (2003)
Lewin, D.: Consistent hashing and random trees: Algorithm for caching in distributed networks. Master’s thesis, Department of Electric. Eng. Comput. Sci., Massachusetts Inst. Technol., Cambridge (1998)
Plaxton, C., Rajaraman, R., Richa, A.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. ACM Symp. Parallelism in Algorithms and Architectures, Newport, RI, June 1997, pp. 311–320 (1997)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A Scalable Content- Addressable Network. In: Proc. ACM SIGCOMM, San Diego, CA, August 2001, pp. 161–172 (2001)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application level multicast using content-addressable networks. In: Proceedings of the Third International Workshop on Networked Group Communication (2001)
Ratnasamy, S., Stoica, I., Shenker, S.: Routing Algorithms for DHTs: Some Open Questions. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (2003)
Ripeanu, M., Iamnitchi, A., Foster, I.: Mapping the Gnutella network. IEEE Internet Computing 6(1), 50–57 (2002)
Rowstron, Druschel, P.: Pastry: Scalable Distributed Object Location and Routing for Large-scale Peer-to-peer Systems. In: Proceedings of IFIP/ACM Middleware (2001)
Rowstron, Kermarrec, A.M., Castro, M., Druschel, P.: Scribe: The design of a largescale event notification infrastructure. In: Proceedings of the Third International Workshop on Networked Group Communication (2001)
Shin, K., Lee, S., Lim, G., Yoon, H., Ma, J.S.: Grapes: Topology-based Hierarchical Virtual Network for Peer-to-peer Lookup Services. In: Proceedings of the International Conference on Parallel Processing Workshops, ICPPW 2002 (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrkshnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proceedings of SIGCOMM, ACM, New York (2001)
Zhao, B.Y., Duan, Y., Huang, L.: Brocade: Landmark Routing on Overlay Networks. In: Proceedings of the 1st International Workshop on Peer-to Peer Systems (2002)
Zhao, Y., Kuibiatowicz, J.D., Joseph, A.D.: Tapestry: An Infrastructures for Faulttolerant Wide-area Location and Routing. Tech. Rep.UCB/CSD-01-1141, UC Berkeley, EECS (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
Wang, SD., Ko, HL., Zhuang, YY. (2004). Japster: An Improved Peer-to-Peer Network Architecture. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_100
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive