Article

On name resolution in peer-to-peer networks

Authors:

C. Greg PlaxtonAuthors Info & Claims

POMC '02: Proceedings of the second ACM international workshop on Principles of mobile computing

Pages 82 - 89

https://doi.org/10.1145/584490.584507

Published: 30 October 2002 Publication History

Abstract

An efficient name resolution scheme is the cornerstone of any peer-to-peer network. The name resolution scheme proposed by Plaxton, Rajaraman, and Richa, which we hereafter refer to as the PRR scheme, is a scalable name resolution scheme that also provides provable locality properties. However, since PRR goes to extra lengths to provide these locality properties, it is somewhat complicated. In this paper, we propose a scalable, locality-aware, and fault-tolerant name resolution scheme which can be considered a simplified version of PRR. Although this new scheme does not provide as strong locality guarantees as PRR, it exploits locality heuristically yet effectively.

References

[1]

R. D. Blumofe, C. G. Plaxton, and S. Ray. Verification of a concurrent deque implementation. Technical Report TR--99--11, Department of Computer Science, University of Texas at Austin, June 1999.]]

Digital Library

[2]

M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron. Exploiting network proximity in peer-to-peer overlay networks. In International Workshop on Future Directions in Distributed Computing (FuDiCo), June 2002.]]

[3]

I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the Workshop on Design Issues in Anonymity and Unobservability, pages 46--66, July 2000.]]

Digital Library

[4]

F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area cooperative storage with CFS. In Proceedings of the 18th ACM Symposium on Operating Systems Principles, pages 202--215, October 2001.]]

Digital Library

[5]

P. Druschel and A. Rowstron. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. In Proceedings of the 18th ACM Symposium on Operating Systems Principles, pages 188--201, October 2001.]]

Digital Library

[6]

Gnutella. Available at http://gnutella.wego.com.]]

[7]

M. P. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13:124--149, 1991.]]

Digital Library

[8]

K. Hildrum, J. Kubiatowicz, S. Rao, and B. Y. Zhao. Distributed data location in a dynamic network. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 41--52, August 2002.]]

Digital Library

[9]

D. Karger and M. Ruhl. Finding nearest neighbors in growth-restricted metrics. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 741--750, May 2002.]]

Digital Library

[10]

J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In Proceedings of the 9th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), pages 190--201, November 2000.]]

Digital Library

[11]

D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, June 2002.]]

Digital Library

[12]

Napster. Available at http://www.napster.com.]]

[13]

C. G. Plaxton, R. Rajaraman, and A. W. Richa. Accessing nearby copies of replicated objects in a distributed environment. Theory of Computing Systems, 32:241--280, 1999.]]

[14]

R. Rajaraman, A. W. Richa, B. Vocking, and G. Vuppuluri. A data tracking scheme for general networks. In Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 247--254, July 2001.]]

Digital Library

[15]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content addressable network. In Proceedings of the 2001 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 161--172, 2001.]]

Digital Library

[16]

S. Ratnasamy, M. Hanley, R. Karp, and S. Shenker. Topologically-aware overlay construction and server selection. In Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), June 2002.]]

[17]

A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), November 2001.]]

Digital Library

[18]

A. Rowstron, A. Kermarrec, M. Castro, and P. Druschel. Scribe: The design of a large-scale event-notification infrastructure. In Proceedings of the 3rd International Workshop on Network Group Communications, pages 30--43, November 2001.]]

Digital Library

[19]

I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pages 149--160, 2001.]]

Digital Library

[20]

B. Zhao, Y. Duan, L. Huang, A. D. Joseph, and J. D. Kubiatowicz. Brocade: Landmark routing on overlay networks. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS), March 2002.]]

Digital Library

[21]

B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Computer Science Division, University of California at Berkeley, April 2001.]]

Digital Library

[22]

S. Zhuang, B. Zhao, A. Joseph, R. Katz, and J. Kubiatowicz. Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. In Proceedings of the 11th International Workshop on Network and OS Support for Digital Audio and Video (NOSSDAV), pages 11--20, July 2001.]]

Digital Library

Cited By

Bari MHaque MAhmed RBoutaba RMathieu B(2011)Persistent naming for P2P Web hosting2011 IEEE International Conference on Peer-to-Peer Computing10.1109/P2P.2011.6038745(270-279)Online publication date: Aug-2011
https://doi.org/10.1109/P2P.2011.6038745
Cristea VDobre CStratan CPop FCristea VDobre CStratan CPop FCostan A(2010)CommunicationLarge-Scale Distributed Computing and Applications10.4018/978-1-61520-703-9.ch003(47-74)Online publication date: 2010
https://doi.org/10.4018/978-1-61520-703-9.ch003
Li XMisra JGreg Plaxton C(2010)Maintaining the Ranch topologyJournal of Parallel and Distributed Computing10.1016/j.jpdc.2010.06.00470:11(1142-1158)Online publication date: 1-Nov-2010
https://dl.acm.org/doi/10.1016/j.jpdc.2010.06.004
Show More Cited By

Index Terms

On name resolution in peer-to-peer networks
1. Networks
  1. Network properties
    1. Network structure
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Locality in structured peer-to-peer networks

Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems, provide efficient mechanisms for resource placement and location. A key distinguishing feature of current DHT systems, such as Chord, Pastry, CAN and Tapestry, is ...
Cost-effective broadcast for fully decentralized peer-to-peer networks

Fully unstructured and decentralized peer-to-peer networks such as Gnutella are appealing for a variety of applications, among which file-sharing is the most prominent one. The decentralized nature of these systems provides a high degree of robustness ...
A connection management protocol for promoting cooperation in Peer-to-Peer networks

The existence of a high degree of free riding in Peer-to-Peer (P2P) networks is an important threat that should be addressed while designing P2P protocols. In this paper we propose a connection-based solution that will help to reduce the free riding ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

POMC '02: Proceedings of the second ACM international workshop on Principles of mobile computing

October 2002

112 pages

ISBN:1581135114

DOI:10.1145/584490

General Chair:
Andre Schiper
EPFL
,
Program Chairs:
Roberto Baldoni
University of Rome "La Sapienza"
,
Ravi Prakash
University of Texas at Dallas

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 October 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

POMC02

Sponsor:

POMC02: Principles of Mobile Computing

October 30 - 31, 2002

Toulouse, France

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
563
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Bari MHaque MAhmed RBoutaba RMathieu B(2011)Persistent naming for P2P Web hosting2011 IEEE International Conference on Peer-to-Peer Computing10.1109/P2P.2011.6038745(270-279)Online publication date: Aug-2011
Cristea VDobre CStratan CPop FCristea VDobre CStratan CPop FCostan A(2010)CommunicationLarge-Scale Distributed Computing and Applications10.4018/978-1-61520-703-9.ch003(47-74)Online publication date: 2010
Li XMisra JGreg Plaxton C(2010)Maintaining the Ranch topologyJournal of Parallel and Distributed Computing10.1016/j.jpdc.2010.06.00470:11(1142-1158)Online publication date: 1-Nov-2010
Pentikousis K(2009)Distributed Information Object ResolutionProceedings of the 2009 Eighth International Conference on Networks10.1109/ICN.2009.31(360-366)Online publication date: 1-Mar-2009
Brands EKaragiannis G(2009)Taxonomy of P2P Applications2009 IEEE Globecom Workshops10.1109/GLOCOMW.2009.5360707(1-8)Online publication date: Nov-2009
Deri LAndrews R(2008)N2N: A Layer Two Peer-to-Peer VPNResilient Networks and Services10.1007/978-3-540-70587-1_5(53-64)Online publication date: 2008
Buford JYu HLua E(2008)P2P Networking and ApplicationsundefinedOnline publication date: 12-Dec-2008
Ye WGu N(2007)Robust Data Location Infrastructure in Distributed Collaborative EnvironmentComputer Supported Cooperative Work in Design III10.1007/978-3-540-72863-4_10(92-100)Online publication date: 2007
Ye WGu N(2006)Robust data location infrastructure in distributed collaborative environmentProceedings of the 10th international conference on Computer supported cooperative work in design III10.5555/1761628.1761639(92-100)Online publication date: 3-May-2006
Ye WGu N(2006)An Approach for Robust Distributed Data Retrieval in Data Intensive Grid Environments2006 First International Symposium on Pervasive Computing and Applications10.1109/SPCA.2006.297567(194-199)Online publication date: Aug-2006
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents