ACM Transactions on Computer Systems (TOCS)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Optimizing Buffer Management for Reliable Multicast
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Efficient Buffering in Reliable Multicast Protocols
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Modeling epidemic information dissemination on mobile devices with finite buffers
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on bio-inspired networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
For large-scale peer-to-peer applications, bio-inspired epidemic protocols have considerable advantages as they are robust against network failures, scalable and provide probabilistic reliability guarantees. While providing reliability, a key issue to consider is the usage of system wide buffer space. In this context, we introduce a novel scheme called stepwise probabilistic buffering that reduces the amount of buffering and distributes the load of buffering to the entire system where every peer does not have the complete view of the system. We compute the performance measures through simulations of large-scale application scenarios.