Building small worlds in unstructured P2P networks using a multiagent Bayesian inference mechanism

Authors:
Prithviraj Dasgupta
Affiliations:
University of Nebraska, Omaha, NE
Venue:
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Year:
2007

Citing 4
Cited 1

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Leveraging Social Networks to Fight Spam

Computer
Adding structure to unstructured peer-to-peer networks: the use of small-world graphs

Journal of Parallel and Distributed Computing
A Multi-agent Mechanism for Topology Balancing in Unstructured P2P Networks

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology

Strategic Behavior in Interaction Selection and Contact Selection

WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02

Quantified Score

Hi-index	0.00

Visualization

Abstract

Over the past few years, peer-to-peer(p2p) unstructured networks have emerged as an attractive paradigm for enabling online interactions between a large number of users in a decentralized manner. However, the decentralized nature of unstructured p2p networks makes load balancing a challenging problem. Specifically, the self-interested nature of users on the nodes of a p2p network and dynamic changes in network topology give rise to an unbalanced distribution of nodes across an unstructured p2p network. This results in network congestion and significant search latencies for all nodes. In this paper, we describe a small-world network model and a Bayesian inference mechanism within a multiagent setting to address these issues. Simulation results for a file sharing p2p application show that our algorithm achieves an exponential reduction in number of messages exchanged and improves load-balancing across the network.