End-to-end packet delay and loss behavior in the internet
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Dummynet: a simple approach to the evaluation of network protocols
ACM SIGCOMM Computer Communication Review
The performance of a service for network-aware applications
SPDT '98 Proceedings of the SIGMETRICS symposium on Parallel and distributed tools
Using pathchar to estimate Internet link characteristics
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Incentives for Sharing in Peer-to-Peer Networks
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A measurement study of available bandwidth estimation tools
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Free Riding on Gnutella Revisited: The Bell Tolls?
IEEE Distributed Systems Online
Influences on cooperation in BitTorrent communities
Proceedings of the 2005 ACM SIGCOMM workshop on Economics of peer-to-peer systems
Nettimer: a tool for measuring bottleneck link, bandwidth
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
| Hi-index | 0.00 |
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.