The small-world phenomenon: an algorithmic perspective
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
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
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Adding structure to unstructured peer-to-peer networks: the use of small-world graphs
Journal of Parallel and Distributed Computing
Building small worlds in unstructured P2P networks using a multiagent Bayesian inference mechanism
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Topology adaptation based on mobile agent in unstructured p2p networks
PCM'12 Proceedings of the 13th Pacific-Rim conference on Advances in Multimedia Information Processing
| Hi-index | 0.00 |
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to congestion and bottleneck problems around the hubs ensuing search latencies for users' resource search queries. Here, we describe a multi-agent enabled P2P network setup protocol that maintains a small-world network structure to prevent the formation of scale-free graphs in unstructured P2P networks.