Latency effects on reachability in large-scale peer-to-peer networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Peer-to-peer information systems: concepts and models, state-of-the-art, and future systems
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Using the small-world model to improve freenet performance
ACM SIGCOMM Computer Communication Review
The diameter of a long range percolation graph
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Scalable analysis and design of ad hoc networks via random graph theory
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Improving Data Access in P2P Systems
IEEE Internet Computing
Social Networks: From the Web to the Enterprise
IEEE Internet Computing
The diameter of a long-range percolation graph
Random Structures & Algorithms
Graph-Theoretic Web Algorithms: An Overview
IICS '01 Proceedings of the International Workshop on Innovative Internet Computing Systems
Proceedings of the Joint JSAI 2001 Workshop on New Frontiers in Artificial Intelligence
ECDL '01 Proceedings of the 5th European Conference on Research and Advanced Technology for Digital Libraries
Anchored Path Discovery in Terminode Routing
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
A Peer-to-Peer Communication System
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Autonomic Computing for Pervasive ICT — A Whole-System Perspective
BT Technology Journal
Using the small-world model to improve Freenet performance
Computer Networks: The International Journal of Computer and Telecommunications Networking
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Small-world overlay P2P networks: construction, management and handling of dynamic flash crowds
Computer Networks: The International Journal of Computer and Telecommunications Networking
Targeted local immunization in scale-free peer-to-peer networks
Journal of Computer Science and Technology
A Diophantine model of routes in structured P2P overlays
ACM SIGMETRICS Performance Evaluation Review
A structured P2P network based on the small world phenomenon
The Journal of Supercomputing
IPBGA: a hybrid P2P based grid architecture by using information pool protocol
The Journal of Supercomputing
Design and performance of wireless data gathering networks based on unicast random walk routing
IEEE/ACM Transactions on Networking (TON)
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks
Journal of Network and Computer Applications
Kronecker Graphs: An Approach to Modeling Networks
The Journal of Machine Learning Research
A distributed implementation of the SWAN peer-to-peer look-up system using mobile agents
AP2PC'02 Proceedings of the 1st international conference on Agents and peer-to-peer computing
IPBGA: a hybrid P2P based grid architecture by using information pool protocol
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
SW-Uinta: a small-world P2P overlay network
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Future directions in distributed computing
Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Network sampling and classification: An investigation of network model representations
Decision Support Systems
Small-World optimization algorithm for function optimization
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Routing algorithm using skipnet and small-world for peer-to-peer system
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Smart search over desirable topologies: towards scalable and efficient p2p file sharing
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Using the linking model to understand the performance of DHT routing algorithms
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Adaptive service placement algorithms for autonomous service networks
Engineering Self-Organising Systems
A market-oriented model for grid service management
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Hi-index | 0.00 |
Long a matter of folklore, the ``small-world phenomenon'''' --the principle that we are all linked by short chains of acquaintances --was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960''s. This work was among the first to make the phenomenon quantitative, allowing people to speak of the ``six degrees of separation'''' between any two people in the United States. Since then, a number of network models have been proposed as frameworks in which to study the problem analytically. One of the most refined of these models was formulated in recent work of Watts and Strogatz; their framework provided compelling evidence that the small-world phenomenon is pervasive in a range of networks arising in nature and technology, and a fundamental ingredient in the evolution of the World Wide Web. But existing models are insufficient to explain the striking algorithmic component of Milgram''s original findings: that individuals using local information are collectively very effective at actually constructing short paths between two points in a social network. Although recently proposed network models are rich in short paths, we prove that no decentralized algorithm, operating with local information only, can construct short paths in these networks with non-negligible probability. We then define an infinite family of network models that naturally generalizes the Watts-Strogatz model, and show that for one of these models, there is a decentralized algorithm capable of finding short paths with high probability. More generally, we provide a strong characterization of this family of network models, showing that there is in fact a unique model within the family for which decentralized algorithms are effective.