Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination

DOI10.1016/J.COMNET.2009.03.021MaRDI QIDQ838485zbMATH OpenOpenAlexWikidataFDO

Authors Oznur Ozkasap, Emrah Cem, Emrah Ahi, Emre Iskender, Mine Çağlar

Publication date 26 August 2009

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2009.03.021

zbMATH Keywords

bufferingdata disseminationdistributed systemsepidemicgossipingpeer-to-peerperformance of systemsreliabilityscalability

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Mobile peer-to-peer data dissemination in wireless ad-hoc networks
• An analytical model of information dissemination for a gossip-based protocol
• Gossiping With Multiple Messages
• Optimal scheduling of peer-to-peer file dissemination
• scientific article; zbMATH DE number 2080512

Cited in

(2)

• Mobile peer-to-peer data dissemination in wireless ad-hoc networks
• On collaborative content distribution using multi-message gossip

This page was built for publication: Stepwise fair-share buffering for gossip-based peer-to-peer data dissemination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q838485)