Abstract
In this letter, we consider peer-to-peer (P2P) networks, where multiple peers are interested in sharing their content. In the considered P2P system, autonomous and self-interested peers use a Markov Decision Process (MDP) framework to determine their upload bandwidth allocations, which maximize their individual utilities. This framework enables the peers to make foresighted decisions on their bandwidth allocations, by considering the future impact of their decisions. In this letter, we focus on the impact of the peers' bounded rationality on their resource reciprocation strategies and ultimately, on their achievable utilities. Specifically, we consider peers who have only a limited ability to model the other peers' strategies for resource reciprocation, and study how this impacts their own decisions.
Original language | English |
---|---|
Pages (from-to) | 675-678 |
Number of pages | 4 |
Journal | IEEE Signal Processing Letters |
Volume | 16 |
Issue number | 8 |
DOIs | |
State | Published - 2009 |
Bibliographical note
Funding Information:Manuscript received January 30, 2009; revised April 08, 2009. First published May 02, 2009; current version published June 05, 2009. This work was supported by the NSF Career and NSF CCF 0830556. The associate editor coordinating the review of this manuscript and approving it for publication was Prof. James E. Fowler.
Keywords
- Accuracy
- Bandwidth
- Bounded rationality
- Data mining
- IEEE
- Peer to peer computing
- Peer-to-peer (P2P) networks
- Probability density function
- Resource reciprocation
- Silicon