Agents and Peer-to-Peer Computing: 6th International Workshop, AP2PC 2007, Honululu, Hawaii, USA, May 14-18, 2007, Revised and Invited Papers
Sam Joseph, Zoran Despotovic, Moro Gianluca, Sonia Bergamaschi
Springer Science & Business Media, Jan 12, 2010 - Computers - 123 pages
Peer-to-peer(P2P)computinghasattractedsigni?cantmediaattention,initially spurred by the popularity of ?le-sharing systems such as Napster, Gnutella, and Morpheus. MorerecentlysystemslikeBitTorrentandeDonkeyhavecontinuedto sustain that attention. New techniques such as distributed hash-tables (DHTs), semantic routing, and Plaxton Meshes are being combined with traditional c- cepts such as Hypercubes, Trust Metrics, and caching techniques to pool - gether the untapped computing power at the “edges” of the Internet. These new techniques and possibilities have generated a lot of interest in many industrial organizations,and resulted in the creation of a P2P working group on standa- ization in this area (http://www. irtf. org/charter?gtype=rg&group=p2prg). In P2P computing, peers and services forego central coordination and - namically organize themselves to support knowledge sharing and collaboration, in both cooperative and non-cooperative environments. The success of P2P s- tems strongly depends on a number of factors. First, the ability to ensure eq- table distribution of content and services. Economic and business models which rely on incentive mechanisms to supply contributions to the system are being developed, along with methods for controlling the “free riding” issue. Second, the ability to enforce provision of trusted services. Reputation-based P2P trust management models are becoming a focus of the research community as a - able solution. The trust models must balance both constraints imposed by the environment (e. g. , scalability) and the unique properties of trust as a social and psychological phenomenon.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A Partial History of the AP2PC Workshop
Information Sharing among Autonomous Agents in Referral Networks
Performance Prediction in PeertoPeer MultiAgent Networks
Implementation and Testing
A Dynamic Pricing and Bidding Strategy for Autonomous Agents in Grids
AgentBased Autonomous Result Veriﬁcation Mechanism in Desktop Grid Systems
Other editions - View all
agent systems agents and P2P algorithm andavailability application approach architecture auction Autonomous Agents best false BitTorrent bloomﬁlters communication CompTorrent credibility CS-MVA decentralized deﬁned diﬀerent network distributed computing distributed hash table divided bloom filters Double Auction evaluate false positive rate ﬁgure ﬁlter FIPA ﬁrst flexible bloom filters Fonkey Fonkey server functional architecture Gnutella Grid Computing hash values Heidelberg identiﬁer IEEE implementation infrastructure interaction Internet InterPol LNCS LNAI mechanism metadata ﬁle Min/Max-Plus mobile agents multi-agent multi-agent systems MultiAgent Systems Named Package network conditions nodes object IDs oﬀers overlay network P2P Agent Platform P2P network P2P provider P2P systems paper parameters peer peer-to-peer performance policies protocol public key referral request result veriﬁcation Samuel R.H. Joseph scalable scheduling SETI@Home Signature Packages simulation speciﬁcation Springer tacks target false task/resource utilization tracker traﬃc trust University of Bologna uthR uthT volunteer