Rarest-First with Probabilistic-Mode-Suppression
Nouman Khan, Mehrdad Moharrami, Vijay Subramanian

TL;DR
This paper introduces RFwPMS, a tunable piece-selection policy combining rarest-first with probabilistic mode suppression, ensuring stability and improved performance in BitTorrent-like networks with non-persistent users.
Contribution
It proposes RFwPMS, a novel protocol that guarantees stability across various network behaviors and improves steady-state performance over existing schemes.
Findings
RFwPMS is stable for all inter-swarm behaviors and arrival rates.
Expected steady-state sojourn time is independent of arrival rate in single-swarm.
Steady-state sojourn time scales linearly with file size.
Abstract
Recent studies suggested that the BitTorrent's rarest-first protocol, owing to its work-conserving nature, can become unstable in the presence of non-persistent users. Consequently, for any provably stable protocol, many peers, at some point, would have to be endogenously forced to hold off their file-download activity. In this work, we propose a tunable piece-selection policy that minimizes this (undesirable) requisite by combining the (work-conserving but not stabilizing) rarest-first protocol with only an appropriate share of the (non-work conserving and stabilizing) mode-suppression protocol. We refer to this policy as ``Rarest-First with Probabilistic Mode-Suppression'' or simply RFwPMS. We study RFwPMS using a stochastic abstraction of the BitTorrent network that is general enough to capture a multiple swarm setting of non-persistent users -- each swarm having its own altruistic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPeer-to-Peer Network Technologies · Caching and Content Delivery · Distributed systems and fault tolerance
