Proceedings ArticleDOI
Designing a super-peer network
Beverly Yang,Hector Garcia-Molina +1 more
- pp 49-60
Reads0
Chats0
TLDR
This work examines super-peer networks in detail, gaming an understanding of their fundamental characteristics and performance tradeoffs, and presents practical guidelines and a general procedure for the design of an efficient super- Peer-to-peer network.Abstract:
A super-peer is a node in a peer-to-peer network that operates both as a server to a set of clients, and as an equal in a network of super-peers. Super-peer networks strike a balance between the efficiency of centralized search, and the autonomy, load balancing and robustness to attacks provided by distributed search. Furthermore, they take advantage of the heterogeneity of capabilities (e.g., bandwidth, processing power) across peers, which recent studies have shown to be enormous. Hence, new and old P2P systems like KaZaA and Gnutella are adopting super-peers in their design. Despite their growing popularity, the behavior of super-peer networks is not well understood. For example, what are the potential drawbacks of super-peer networks? How can super-peers be made more reliable? How many clients should a super-peer take on to maximize efficiency? we examine super-peer networks in detail, gaming an understanding of their fundamental characteristics and performance tradeoffs. We also present practical guidelines and a general procedure for the design of an efficient super-peer network.read more
Citations
More filters
Journal ArticleDOI
A survey of peer-to-peer content distribution technologies
TL;DR: This survey proposes a framework for analyzing peer-to-peer content distribution technologies and focuses on nonfunctional characteristics such as security, scalability, performance, fairness, and resource management potential, and examines the way in which these characteristics are reflected in and affected by the architectural design decisions adopted by current peer- to-peer systems.
Proceedings ArticleDOI
Improving search in peer-to-peer networks
TL;DR: Three techniques for efficient search in P2P systems are presented, and it is shown that while these techniques maintain the same quality of results as currently used techniques, they use up to 5 times fewer resources.
Journal ArticleDOI
Survey of research towards robust peer-to-peer networks: search methods
J. Risson,Tim Moors +1 more
TL;DR: In this article, the authors present a survey of peer-to-peer (P2P) search methods, including simple key lookup, keyword lookup, information retrieval and data management, and early efforts to optimize range, multiattribute, join and aggregation queries over P2P indexes.
Proceedings ArticleDOI
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
Wolfgang Nejdl,Martin Wolpers,Wolf Siberski,Christoph Schmitz,Mario T. Schlosser,Ingo Brunkhorst,Alexander Löser +6 more
TL;DR: These RDF-based P2P networks are able to support sophisticated routing and clustering strategies based on the metadata schemas, attributes and ontologies used, and the use of super-peer based topologies for these networks is described.
Proceedings ArticleDOI
Modeling peer-peer file sharing systems
TL;DR: This work shows that simple models coupled with efficient solution methods can be used to understand and answer questions related to the performance of peer-peer file sharing systems.
References
More filters
Proceedings ArticleDOI
Chord: A scalable peer-to-peer lookup service for internet applications
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
Book ChapterDOI
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
Proceedings ArticleDOI
A scalable content-addressable network
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
Journal ArticleDOI
OceanStore: an architecture for global-scale persistent storage
John Kubiatowicz,David Bindel,Yan Chen,Steven E. Czerwinski,Patrick Eaton,Dennis Geels,Ramakrishna Gummadi,Sean Rhea,Hakim Weatherspoon,Westley Weimer,Chris Wells,Ben Y. Zhao +11 more
TL;DR: OceanStore monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data.
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing
TL;DR: Tapestry is an overlay location and routing infrastructure that provides location-independent routing of messages directly to the closest copy of an object or service using only point-to-point links and without centralized resources.