ACM Home Page
Please provide us with feedback. Feedback
Building small worlds in unstructured P2P networks using a multiagent Bayesian inference mechanism
Full text PdfPdf (232 KB)
Source
International Conference on Autonomous Agents archive
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems table of contents
Honolulu, Hawaii
SESSION: Environments and implementation techniques: poster papers table of contents
Article No. 144  
Year of Publication: 2007
ISBN:978-81-904262-7-5
Author
Prithviraj Dasgupta  University of Nebraska, Omaha, NE
Sponsor
: IFAAMAS
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 52,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1329125.1329300
What is a DOI?

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.



Collaborative Colleagues:
Prithviraj Dasgupta: colleagues