A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
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
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Grapes: Topology-Based Hierarchical Virtual Network for Peer-to-Peer Lookup Services
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
BRITE: Universal Topology Generation from a User''s Perspective
BRITE: Universal Topology Generation from a User''s Perspective
A Study of Discovery Mechanisms for Peer-to-Peer Applications
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Herald: Achieving a Global Event Notification Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
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
A new scheme on recovery from failure in NICE overlay protocol
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Phyllo: a peer-to-peer overlay security framework
NPSEC'05 Proceedings of the First international conference on Secure network protocols
Oasis: a hierarchical EMST based P2P network
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Journal of Network and Computer Applications
An adaptive sector-based routing model over structured peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
P2P systems based on Distributed hash table (DHT)such as CAN, Chord, Pastry, and Tapestry, use uniformhash functions to ensure load balance in each participantnodes. But the evenly distributed behavior in the virtualspace destroys the locality between participant nodes. Thetopology-based hierarchical overlay network like Grapes,exploits the physical distance information among the nodesto construct a two-layered hierarchy, highly improves thelocality, but damages the load balance property in originalDHTs. In this paper, we propose a dynamic P2P overlayinfrastructure, called Jelly. It can achieve both the loadbalancing and locality properties. Its design is based onthe hierarchical overlay and uses the DHT as its routingalgorithm. Because the load balancing issue in ahierarchical overlay is originated from whether the virtualhierarchy is balanced or not, Jelly uses a node joiningmechanism as a fine-tuning tool and a dynamic checkingmechanism as a coarse-tuning tool to balance thehierarchy. We also find that the average routing hops is apractical metric to evaluate the network size, and it isuseful for Jelly's dynamic mechanism.