Abstract
Most Internet-based collaborative computing systems face the major problem: freeriding. The abundance of freeriders, and load imbalance it creates, punishes those peers who do actively contribute to the network by forcing them to overuse their resources. Hence, the overall system performance becomes to degrade quickly. The goal of this paper is aimed to provide an efficient approach to distinguish the dishonest peers from the honest peers. The key idea of our approach is to make use of the relationship between the perceived throughput and the available bandwidth. First, we do a comprehensive study of available bandwidth estimation tools. Next, we propose integrity-aware bandwidth guarding algorithm, which is designed according to the perceived throughput and the available bandwidth estimation. Finally, the simulation results illustrate that our approach can correctly identify dishonest peers and be of great help in constructing a better overlay structure for many peer-to-peer and multicast applications.
| Original language | English |
|---|---|
| Title of host publication | NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - 6th International IFIP-TC6 Networking Conference, Proceedings |
| Pages | 1060-1071 |
| Number of pages | 12 |
| Publication status | Published - 2007 Dec 24 |
| Event | 6th International IFIP-TC6 Networking Conference on NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - Atlanta, GA, United States Duration: 2007 May 14 → 2007 May 18 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4479 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 6th International IFIP-TC6 Networking Conference on NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet |
|---|---|
| Country | United States |
| City | Atlanta, GA |
| Period | 07/5/14 → 07/5/18 |
Fingerprint
Keywords
- Available bandwidth
- Freeriding
- Peer-to-peer
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
Integrity-aware bandwidth guarding approach in P2P networks. / Chiang, Wen Hui; Chen, Ling Jyh; Chou, Cheng Fu.
NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - 6th International IFIP-TC6 Networking Conference, Proceedings. 2007. p. 1060-1071 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4479 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Integrity-aware bandwidth guarding approach in P2P networks
AU - Chiang, Wen Hui
AU - Chen, Ling Jyh
AU - Chou, Cheng Fu
PY - 2007/12/24
Y1 - 2007/12/24
N2 - Most Internet-based collaborative computing systems face the major problem: freeriding. The abundance of freeriders, and load imbalance it creates, punishes those peers who do actively contribute to the network by forcing them to overuse their resources. Hence, the overall system performance becomes to degrade quickly. The goal of this paper is aimed to provide an efficient approach to distinguish the dishonest peers from the honest peers. The key idea of our approach is to make use of the relationship between the perceived throughput and the available bandwidth. First, we do a comprehensive study of available bandwidth estimation tools. Next, we propose integrity-aware bandwidth guarding algorithm, which is designed according to the perceived throughput and the available bandwidth estimation. Finally, the simulation results illustrate that our approach can correctly identify dishonest peers and be of great help in constructing a better overlay structure for many peer-to-peer and multicast applications.
AB - Most Internet-based collaborative computing systems face the major problem: freeriding. The abundance of freeriders, and load imbalance it creates, punishes those peers who do actively contribute to the network by forcing them to overuse their resources. Hence, the overall system performance becomes to degrade quickly. The goal of this paper is aimed to provide an efficient approach to distinguish the dishonest peers from the honest peers. The key idea of our approach is to make use of the relationship between the perceived throughput and the available bandwidth. First, we do a comprehensive study of available bandwidth estimation tools. Next, we propose integrity-aware bandwidth guarding algorithm, which is designed according to the perceived throughput and the available bandwidth estimation. Finally, the simulation results illustrate that our approach can correctly identify dishonest peers and be of great help in constructing a better overlay structure for many peer-to-peer and multicast applications.
KW - Available bandwidth
KW - Freeriding
KW - Peer-to-peer
UR - http://www.scopus.com/inward/record.url?scp=37249052285&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=37249052285&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:37249052285
SN - 9783540726050
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1060
EP - 1071
BT - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - 6th International IFIP-TC6 Networking Conference, Proceedings
ER -