Stochastic processes
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
Using the small-world model to improve freenet performance
ACM SIGCOMM Computer Communication Review
A Lightweight, Robust P2P System to Handle Flash Crowds
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations
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
The Small-World Phenomenon: An Algorithmic Perspective
The Small-World Phenomenon: An Algorithmic Perspective
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Adding structure to unstructured peer-to-peer networks: the use of small-world graphs
Journal of Parallel and Distributed Computing
A Distributed Throttling Approach for Handling High Bandwidth Aggregates
IEEE Transactions on Parallel and Distributed Systems
BlåtAnt: Bounding Networks' Diameter with a Collaborative Distributed Algorithm
ANTS '08 Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence
A measure for cluster cohesion in semantic overlay networks
Proceedings of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
Rewiring strategies for semantic overlay networks
Distributed and Parallel Databases
Structured overlay for heterogeneous environments: Design and evaluation of oscar
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
iCluster: a self-organizing overlay network for P2P information retrieval
ECIR'08 Proceedings of the IR research, 30th European conference on Advances in information retrieval
SCDN: Stable Content Distribution Network based on demands
Journal of Parallel and Distributed Computing
Expansion and search in networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A framework for interest-based community evolution and sharing of latent knowledge
International Journal of Grid and Utility Computing
DS4: a distributed social and semantic search system
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Cooperative stalking of transient nomadic resources on overlay networks
Future Generation Computer Systems
| Hi-index | 0.00 |
We consider how to construct and maintain a structured overlay P2P network based on the small-world paradigm. Two main attractive properties of a small-world network are (1) a low average hop distance between any two randomly chosen nodes, and (2) a high clustering coefficient. A network with a low average hop distance implies small latency for object lookup. A network with a high clustering coefficient implies the ability to provide efficient object lookup even under heavy object traffic loadings, such as in a flash crowd scenario. We present the SWOP protocol for constructing a small-world overlay P2P network. We compare our system's performance with other structured P2P networks, such as Chord. Whereas the Chord protocol already provides a scalable object lookup latency of O(log(N)), where N is the number of nodes in a P2P network, we show that the SWOP protocol can further improve the object lookup performance. We also take advantage of the high clustering coefficient of a small-world P2P network to design an object replication algorithm that can handle heavy object traffic loading situations. We show that the SWOP network can efficiently deliver popular, possibly dynamic, objects to all the requesting nodes. To the best of our knowledge, ours is the first work that addresses how to handle dynamic flash crowds in a structured P2P network.