Department of Computer EngineeringDepartment of Mathematics2024-11-0920091389-128610.1016/j.comnet.2009.03.0212-s2.0-67650627742http://dx.doi.org/10.1016/j.comnet.2009.03.021https://hdl.handle.net/20.500.14288/9076We consider buffer management in support of large-scale gossip-based peer-to-peer data dissemination protocols. Coupled with an efficient buffering mechanism, system-wide buffer usage can be optimized while providing reliability and scalability in such protocols. We propose a novel approach, stepwise fair-share buffering, that provides uniform load distribution and reduces the overall buffer usage where every peer has a partial view of the system. We report and discuss the comparative performance results with existing buffering approaches as well as random buffering which serves as a benchmark. We present separate evaluations of bufferer selection and gossip-based data dissemination. Reliability, content dissemination time, message delay, buffering delay, and minimum buffer requirements are considered as the key metrics investigated through simulations. The performance of our approach in the case of multiple senders, link failures with multiple bufferers, and scalability to larger networks are investigated. Several power-law and hierarchical overlay topologies are considered. Analytical bounds for reliability of dissemination are also provided.Computer scienceHardware and architectureInformation systemsEngineeringElectrical and electronic engineeringTelecommunicationsConference proceeding1872-70692690684000026415