分布式直播中的异质性：祝福还是诅咒？
Heterogeneity in Distributed Live Streaming: Blessing or Curse?
摘要：
在过去的几年里，分布式直播带来了很多兴趣。在同构的情况下（所有节点具有相同的容量），已经提出了许多算法，这些算法已经被证明是几乎最优的或最优的。另一方面，异构系统的性能还没有完全理解。在本文中，我们调查的异质性的影响，可实现的延迟基于块的直播流媒体系统。我们提出了几种模型，考虑到一个块的原子性。对于所有这些模型，当考虑单个块的传输时，异构性确实是一种“不稳定”，因为可实现的延迟总是比等效的同构系统更快。但对于一个流的块，我们表明，它可以是一个“诅咒”：有系统的可实现的延迟可以是任意更大的等价的同构系统相比。然而，如果系统略微带宽过度供应，则最佳单个块扩散方案可以适应于块流，从而导致接近最佳的、比同构系统更快的异构直播流传输系统。
英文摘要：
Distributed live streaming has brought a lot of interest in the past few years. In the homogeneous case (all nodes having the same capacity), many algorithms have been proposed, which have been proven almost optimal or optimal. On the other hand, the performance of heterogeneous systems is not completely understood yet. In this paper, we investigate the impact of heterogeneity on the achievable delay of chunk-based live streaming systems. We propose several models for taking the atomicity of a chunk into account. For all these models, when considering the transmission of a single chunk, heterogeneity is indeed a ``blessing'', in the sense that the achievable delay is always faster than an equivalent homogeneous system. But for a stream of chunks, we show that it can be a ``curse'': there is systems where the achievable delay can be arbitrary greater compared to equivalent homogeneous systems. However, if the system is slightly bandwidth-overprovisioned, optimal single chunk diffusion schemes can be adapted to a stream of chunks, leading to near-optimal, faster than homogeneous systems, heterogeneous live streaming systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
