Detect Selfishness with Available Bandwidth Estimation in Peer-to-peer Networks
Date Issued
2005
Date
2005
Author(s)
Chiang, Wen-Hui
DOI
en-US
Abstract
In recent years, peer-to-peer applications become popular in today’s Internet. However, there is an inherent selfish problem in peer-to-peer networks. Users attempt to strategically interact with other users to gain benefit for themselves. These selfish behaviors will decrease the performance and lead to instability of the network. Therefore, we focus our research on eliminating the effect from selfish users, especially the bandwidth-cheating problem, which means that users decrease throughput intentionally.
We aim to design an algorithm to discourage cheating behaviors in peer-to-peer networks. We propose a real-time cheating detection algorithm based on throughput and available bandwidth estimation. Thanks to the rapid development of available bandwidth estimation techniques, we are able to estimate dynamic available bandwidth in short time. We choose pathChirp to estimate available bandwidth based on its better accuracy and less overhead than other estimation tools. Our irregular throughput detection algorithm is able to identify more than 90% cheating peers and avoid misjudging honest users affected by unstable network conditions. Finally, our simulation results show that our algorithm improve the performance in application-layer multicast systems.
Subjects
同儕網路
可用頻寬偵測
peer-to-peer netowrk
available bandwidth estimation
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-94-R92922020-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):84140dd5feaaf66b2ae2de318a4066d1