Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Case for Cooperative Networking
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Free Riding on Gnutella Revisited: The Bell Tolls?
IEEE Distributed Systems Online
A peer-to-peer network for live media streaming using a push-pull approach
Proceedings of the 13th annual ACM international conference on Multimedia
EquiCast: scalable multicast with selfish users
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the topologies formed by selfish peers
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Service differentiated peer selection: an incentive mechanism for peer-to-peer media streaming
IEEE Transactions on Multimedia
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Push-to-pull peer-to-peer live streaming
DISC'07 Proceedings of the 21st international conference on Distributed Computing
An adaptive peer-to-peer live streaming system with incentives for resilience
Computer Networks: The International Journal of Computer and Telecommunications Networking
Impact of user selfishness in construction action on the streaming quality of overlay multicast
Computer Networks: The International Journal of Computer and Telecommunications Networking
Peer-to-peer streaming in heterogeneous environments
Image Communication
Hi-index | 0.00 |
Data dissemination in decentralized networks is often realized by using some form of swarming technique. Swarming enables nodes to gather dynamically in order to fulfill a certain task collaboratively and to exchange resources (typically pieces of files or packets of a multimedia data stream). As in most distributed systems, swarming applications face the problem that the nodes in a network have heterogeneous capabilities or act selfishly. We investigate the problem of efficient live data dissemination (e.g., TV streams) in swarms. The live streams should be distributed in such a way that only nodes with sufficiently large contributions to the system are able to fully receive it-even in the presence of freeloading nodes or nodes that upload substantially less than required to sustain the multimedia stream. In contrast, uncooperative nodes cannot properly receive the data stream as they are unable to fill their data buffers in time, incentivizing a fair sharing of resources. If the number of selfish nodes increases, our emulation results reveal that the situation steadily deteriorates for them, while obedient nodes continue to receive virtually all packets in time.