Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Incentive P2P networks: a protocol to encourage information sharing and contribution
ACM SIGMETRICS Performance Evaluation Review - Special issue on the fifth workshop on MAthematical performance Modeling and Analysis (MAMA 2003)
An Incentive Mechanism for P2P Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Limited reputation sharing in P2P systems
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
A game theoretic approach to provide incentive and service differentiation in P2P networks
Proceedings of the joint international conference on Measurement and modeling of computer systems
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Comparing economic incentives in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Fighting peer-to-peer SPAM and decoys with object reputation
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Dynamics of usage-priced communication networks: the case of a single bottleneck resource
IEEE/ACM Transactions on Networking (TON)
Clustering and sharing incentives in BitTorrent systems
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A model of the spread of randomly scanning Internet worms that saturate access links
ACM Transactions on Modeling and Computer Simulation (TOMACS)
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We study how BitTorrent exhibits peer clustering in terms of transaction success rate which is based on allocated uplink bandwidths for the purposes of file-swapping. The effects of optimistic unchoking and dissemination of choke lists are also considered. Under dynamic uplink assignment similar grouping results based on differences in how users derive utility from transaction success rates. The "limited information" game requires users periodically assess the effect of a change in uplink. Finally, we conclude with a discussion of how to extend the model to consider the complicating factors such as transient swarm behavior and peer churn.