Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
EDUTELLA: a P2P networking infrastructure based on RDF
Proceedings of the 11th international conference on World Wide Web
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
P-Grid: A Self-Organizing Access Structure for P2P Information Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
JXTA: A Technology Facilitating Mobile Peer-To-Peer Networks
MobiWac '02 Proceedings of the International Workshop on Mobility and Wireless Access
Deconstructing the Kazaa Network
WIAPP '03 Proceedings of the The Third IEEE Workshop on Internet Applications
RChord: An Enhanced Chord System Resilient to Routing Attacks
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Should we build Gnutella on a structured overlay?
ACM SIGCOMM Computer Communication Review
Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies
ICPADS '04 Proceedings of the Parallel and Distributed Systems, Tenth International Conference
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Symphony: distributed hashing in a small world
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
DR-Chord-FAn Efficient Double-Ring Chord Protocol
GCC '07 Proceedings of the Sixth International Conference on Grid and Cooperative Computing
PERCOM '08 Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications
The FastTrack overlay: A measurement study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Super-Peer selection based framework using dynamic capacity and similarity
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Unstructured overlays have the disadvantage that queries may take a long time to find required data or it does not guaranty to locate an existing data item. We present an organised network architecture for unstructured peer-to-peer systems where nodes are added to the network in a systematic way to efficiently utilise the node resources. This network architecture is characterised by O(logm n) network diameter and O(logm n) messages for node joining and node failure, where n is the number of nodes in the network and m is the number of children of a node. Purely decentralised systems like Gnutella route the query in an environment where the node capabilities are not identified. Whereas the proposed hierarchical unstructured p2p (HUP) routes the query towards the high capable nodes. This organisation of nodes improves the probability of query success rate than that of purely unstructured systems.