Mode-Suppression: A Simple, Stable and Scalable Chunk-Sharing Algorithm for P2P Networks
Mode-Suppression: A Simple, Stable and Scalable Chunk-Sharing Algorithm for P2P Networks
复制标题
DOI：
10.1109/tnet.2021.3092008
复制
发表时间：
2021-12-01
影响因子：
3.7
通讯作者：
Shakkottai, Srinivas
中科院分区：
文献类型：
--
作者：
Reddyvari, Vamseedhar;Bobbili, Sarat Chandra;Shakkottai, Srinivas
P2P网络以与同行的到达率成比例扩大其吞吐量的能力最近被证明取决于所采用的块共享策略。某些政策可能导致特定块的低频，即缺失的块综合征，这可以大大减少吞吐量并导致系统的不稳定。例如，普遍使用的政策名义上“增强”了诸如著名最稀有优先算法之类的少数块的共享是不稳定的。我们采用一个互补的观点，而是考虑一项政策，该策略简单地阻止了我们称为模式支持的最常见块的共享。我们还考虑一个更通用的版本，仅当模式频率大于最低频率的固定阈值时，才能抑制模式。我们证明了使用Lyapunov技术证明模式支持的稳定性，并使用Kingman Bund Cragn来表明总下载时间不会随着同伴到达率而增加。然后，我们设计了模式抑制的版本，每次对少数同行进行采样，并通过随时间汇总这些样本来构建嘈杂的模式估计。我们以数字显示抑制模式可以稳定并胜过所有最近提出的块共享算法，并通过集成在NS-3上运行的Bittorrent实现，以确保在现实世界中确保稳定，低的索期时间操作。
The ability of a P2P network to scale its throughput up in proportion to the arrival rate of peers has recently been shown to be crucially dependent on the chunk sharing policy employed. Some policies can result in low frequencies of a particular chunk, known as the missing chunk syndrome, which can dramatically reduce throughput and lead to instability of the system. For instance, commonly used policies that nominally "boost" the sharing of infrequent chunks such as the well-known rarest-first algorithm have been shown to be unstable. We take a complementary viewpoint, and instead consider a policy that simply prevents the sharing of the most frequent chunk(s), that we call mode-suppression. We also consider a more general version that suppresses the mode only if the mode frequency is larger than the lowest frequency by a fixed threshold. We prove the stability of mode-suppression using Lyapunov techniques, and use a Kingman bound argument to show that the total download time does not increase with peer arrival rate. We then design versions of mode-suppression that sample a small number of peers at each time, and construct noisy mode estimates by aggregating these samples over time. We show numerically that mode suppression stabilizes and outperforms all other recently proposed chunk sharing algorithms, and via integration into BitTorrent implementation operating over the ns-3 that it ensures stable, low sojourn time operation in a real-world setting.