Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Incentives for Sharing in Peer-to-Peer Networks
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Free-riding and whitewashing in peer-to-peer systems
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
QRON: QoS-aware routing in overlay networks
IEEE Journal on Selected Areas in Communications
Fighting pollution dissemination in peer-to-peer networks
Proceedings of the 2007 ACM symposium on Applied computing
Rater Credibility Assessment in Web Services Interactions
World Wide Web
RATEWeb: Reputation Assessment for Trust Establishment among Web services
The VLDB Journal — The International Journal on Very Large Data Bases
QCast: a QoS-aware peer-to-peer streaming system with DHT-based multicast
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
SimplyRep: A simple and effective reputation system to fight pollution in P2P live streaming
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
A routing overlay network is an application-layer overlay on the existing Internet routing substrate that allows an alternative routing service. Recent studies have suggested that such networks might contain selfish nodes, which develop their strategies by considering only their own objectives.Extremely selfish nodes, called free-riders, might even refuse to share their resources with the network, thus making overlay service unavailable to the nodes that depend on them. The authors use a game-theoretic approach to evaluate the selfish-node mechanism and increase quality of service (QoS) by detecting and excluding free-riders.