Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Enabling conferencing applications on the internet using an overlay muilticast architecture
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Towards global network positioning
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Brocade: Landmark Routing on Overlay Networks
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
SCRIBE: The Design of a Large-Scale Event Notification Infrastructure
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Canon in G Major: Designing DHTs with Hierarchical Structure
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Analyzing peer-to-peer traffic across large networks
IEEE/ACM Transactions on Networking (TON)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A construction of locality-aware overlay network: mOverlay and its performance
IEEE Journal on Selected Areas in Communications
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Chord2: A two-layer Chord for reducing maintenance overhead via heterogeneity
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fast and proximity-aware multi-source overlay multicast under heterogeneous environment
Computer Communications
Hybrid Overlay Networks Management for Real-Time Multimedia Streaming over P2P Networks
MMNS '07 Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services
Using Heterogeneity to Enhance Random Walk-based Queries
Journal of Signal Processing Systems
On the self-organization of a hybrid peer-to-peer system
Journal of Network and Computer Applications
A topology adaptation protocol for structured superpeer overlay construction
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Tide: An effective and practical design for hierarchical-structured P2P model
Computer Communications
Survey A survey of peer-to-peer live video streaming schemes - An algorithmic perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Application-level multicast on structured overlays often suffer several drawbacks: 1) The regularity of the architecture makes it difficult to adapt to topology changes; 2) the uniformity of the protocol generally does not consider node heterogeneity. It would be ideal to combine the scalability of these overlays with the flexibility of an unstructured topology. In this paper, we propose a locality-aware hybrid overlay that combines the scalability and interface of a structured network with the connection flexibility of an unstructured network. Nodes self-organize into structured clusters based on network locality, while connections between clusters are created adaptively through random walks. Simulations show that this structure is efficient in terms of both delay and bandwidth. The network also supports the scalable fast rendezvous interface provided by structured overlays, resulting in fast membership operations.