One pervasive challenge in providing a high quality-of-service for live communication is to recover lost packets in real-time. Streaming codes are a class of erasure codes that are designed for such strict, low-latency streaming communication settings. Motivated by applications that transmit messages whose sizes vary over time, such as live video streaming, this paper considers the setting of streaming codes under variable-size messages. In practice, streaming codes operate in an "online" setting where the sizes of the future messages are unknown. "Offline" codes, in contrast, have access to the sizes of all messages, including future ones. This paper introduces the first online rate-optimal streaming codes for communicating over a burst-only packet loss channel for two broad parameter regimes. These two online codes match the rates of optimal offline codes for the two settings despite the apparent advantage of the offline setting. This paper further establishes that online codes cannot attain the optimal rate for offline codes for all remaining parameter settings.
翻译:为实时通信提供高质量服务的一个普遍挑战是实时回收丢失的软件包。串流代码是为这种严格、低纬度流传通信设置而设计的取消代码的一类。由于传送时间大小不同的信息的应用,如现场视频流,本文考虑在可变大小信息下设置流码。在实践中,流流代码在“在线”设置中运行,因为未来信息大小未知。相反,“离线”代码能够获取所有信息(包括未来信息)的大小。本文为两个宽度参数系统引入了第一个在线费率-最佳流码,用于在只发生爆炸的包丢失频道上进行通信。这两个在线代码符合两种环境的最佳离线代码速度,尽管离线设置显然有优势。本文进一步规定,在线代码无法达到所有剩余参数设置的离线代码的最佳速度。</s>