The missing piece syndrome in peer-to-peer communication

Typical protocols for peer-to-peer file sharing over the Internet divide files to be shared into pieces. New peers strive to obtain a complete collection of pieces from other peers and from a seed. In this paper we identify a problem that can occur if the seeding rate is not large enough. The problem is that, even if the statistics of the system are symmetric in the pieces, there can be symmetry breaking, with one piece becoming very rare. If peers depart after obtaining a complete collection, they can tend to leave before helping other peers receive the rare piece. 1

• Publication year

  2010

• Venue

  2010 IEEE International Symposium on Information Theory

• Publication date

  2010-02-18

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/ISIT.2010.5513266arXiv 1002.3493
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Stability of a Peer-to-Peer Communication System

  2011cited by this paper
• Raptor codes

  2011cited by this paper
• Estimating Self-Sustainability in Peer-to-Peer Swarming Systems

  2010cited by this paper
• Interacting branching processes and linear file-sharing networks

  2009cited by this paper
• On the stability of two-chunk file-sharing systems

  2009cited by this paper
• Coupon replication systems

  2008cited by this paper
• Performance of peer-to-peer networks: Service capacity and role of resource sharing policies

  2006cited by this paper
• Algebraic gossip: a network coding approach to optimal multiple rumor mongering

  2006cited by this paper
• Gossiping With Multiple Messages

  2006cited by this paper
• Network coding for large scale content distribution

  2005cited by this paper
• Service capacity of peer to peer networks

  2004cited by this paper
• Modeling and performance analysis of BitTorrent-like peer-to-peer networks

  2004cited by this paper
• Incentives Build Robustness in Bit-Torrent

  2003influential reference
• LT codes

  2002cited by this paper
• Network information flow

  2000cited by this paper
• Approximation of Population Processes

  1987cited by this paper
• CBMS-NSF REGIONAL CONFERENCE SERIES IN APPLIED MATHEMATICS

  1978cited by this paper
• Some inequalities for the queue GI/G/1

  1962cited by this paper
• Biometrika

  1902cited by this paper

• Rarest-First With Probabilistic-Mode-Suppression (RFwPMS)

  2022influential citation
• Heterogeneous download times in bandwidth-homogeneous BitTorrent swarms

  2021cites this paper
• Data flow dissemination in a network

  2021cites this paper
• A New Stable Peer-to-Peer Protocol With Non-Persistent Peers: The Group Suppression Protocol

  2020influential citation
• Stable and Efficient Piece-Selection in Multiple Swarm BitTorrent-like Peer-to-Peer Networks

  2020influential citation
• Building Highly Reliable Networks with GRASP/VND Heuristics

  2019cites this paper
• Mode-Suppression: A Simple, Stable and Scalable Chunk-Sharing Algorithm for P2P Networks

  2019influential citation
• PR ] 5 O ct 2 01 8 Balanced Allocation with Random Walk Based Sampling ∗

  2018cites this paper
• Balanced Allocation with Random Walk Based Sampling

  2018cites this paper
• Mode-Suppression: A Simple and Provably Stable Chunk-Sharing Algorithm for P2P Networks

  2018cites this paper
• A Hybrid GRASP/VND Heuristic for the Design of Highly Reliable Networks

  2018cites this paper
• A new stable peer-to-peer protocol with non-persistent peers

  2017influential citation
• Enhanced Chunk Regulation Algorithm for Superior QoS in Heterogeneous P2P Video on Demand

  2016cites this paper
• Fluid Models of Population and Download Progress in P2P Networks

  2016cites this paper
• Analysing and leveraging client heterogeneity in swarming-based live streaming

  2016cites this paper
• Delivering application-layer traffic optimization services based on public routing data at Internet eXchange points : Serviços para otimização do tráfego de aplicações a partir de informações públicas de roteamento nos Pontos de troca de tráfego na internet

  2016cites this paper
• Stable Distributed P2P Protocols Based on Random Peer Sampling

  2015influential citation
• Layered queueing networks : performance modelling, analysis and optimisation

  2015cites this paper
• Queueing analysis of peer-to-peer swarms: Stationary distributions and their scaling limits

  2015cites this paper
• A Comprehensive Analysis of Swarming-based Live Streaming to Leverage Client Heterogeneity

  2015cites this paper
• Scalability Issues in P2P Systems

  2014cites this paper
• A stable fountain code mechanism for peer-to-peer content distribution

  2014cites this paper
• On the Service Capacity of P2P Systems

  2014influential citation
• From resource allocation to neighbor selection in peer-to-peer networks

  2014cites this paper
• Can P2P networks be super-scalable?

  2013cites this paper
• On the Interplay between Content Popularity and Performance in P2P Systems

  2013cites this paper
• Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach

  2013cites this paper
• Tree dynamics for peer-to-peer streaming

  2013cites this paper
• Stable and scalable universal swarms

  2013cites this paper
• Data Dissemination in Opportunistic Networks

  2013cites this paper
• Content dynamics in P2P networks from queueing and fluid perspectives

  2012cites this paper
• Computer-Assisted Proofs and Other Methods for Problems Regarding Nonlinear Differential Equations

  2012cites this paper
• On the global stability of a peer-to-peer network model

  2012cites this paper
• Modelling and performance analysis of content sharing and distribution in community networks with infrastructure support

  2012cites this paper
• Spatial Interactions of Peers and Performance of File Sharing Systems

  2011cites this paper
• Enabling peer-to-peer swarming for multi-commodity dissemination

  2011influential citation
• CheatSheet : A Model-Driven Approach for Capacity Allocation in Managed Swarming

  2011cites this paper
• Implications of peer selection strategies by publishers on the performance of P2P swarming systems

  2011influential citation
• Heterogeneous download times in a homogeneous BitTorrent swarm

  2011cites this paper
• How impatience affects the performance and scalability of P2P video-on-demand systems

  2011cites this paper
• On the stability and optimality of universal swarms

  2011influential citation
• Path-vector routing stability analysis

  2011cites this paper
• Codes for a distributed caching based Video-on-Demand system

  2011cites this paper
• Stability of a Peer-to-Peer Communication System

  2011cites this paper
• Estimating Self-Sustainability in Peer-to-Peer Swarming Systems

  2010cites this paper
• Hybrid Metaheuristics

  2010influential citation
• On the stability of two-chunk file-sharing systems

  2009influential citation
• Content Availability and Bundling in Swarming Systems

  2009cites this paper
• Mathematisches Forschungsinstitut Oberwolfach Mathematical Challenges in Stochastic Networks

  year unknowncites this paper