当前位置: X-MOL 学术IEEE Trans. Inform. Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Streaming Codes for Variable-Size Messages
IEEE Transactions on Information Theory ( IF 2.2 ) Pub Date : 2022-04-28 , DOI: 10.1109/tit.2022.3170895
Michael Rudow 1 , K. V. Rashmi 1
Affiliation  

Live communication is ubiquitous, and frequently must contend with reliability issues due to packet loss during transmission. The effect of packet losses can be alleviated by using erasure codes, which aid in recovering lost packets. Streaming codes are a class of codes designed for the live communication setting, which encode a stream of message packets arriving sequentially for transmission over a packet-loss channel. The existing study of streaming codes considers settings where the sizes of the message packets to be transmitted are all fixed. However, message packets occur with unpredictable and variable sizes in many applications, such as videoconferencing. In this paper, we present a generalized model for streaming codes that incorporates message packets of variable sizes. We show that the variability in the sizes of message packets induces a new trade-off between the rate and the decoding delay under lossless transmission. Moreover, the variability in the sizes of message packets impacts the optimal rate of transmission. To address this, we introduce algorithms to compute upper and lower bounds on the optimal rate for any given sequence of sizes of message packets. We then design an explicit streaming code for the proposed model. We empirically evaluate the code construction over a live video trace for several representative parameter settings, and show that the rate of the construction is approximately 90% of an upper bound and 5%–48% higher than naively using the existing streaming codes.

中文翻译:

可变大小消息的流代码

实时通信无处不在,并且经常必须应对由于传输过程中的数据包丢失而导致的可靠性问题。使用纠删码可以减轻丢包的影响,这有助于恢复丢失的数据包。流代码是为实时通信设置设计的一类代码,它对顺序到达的消息包流进行编码,以便通过丢包通道进行传输。现有的流式编码研究考虑了要传输的消息包的大小都是固定的设置。然而,在许多应用程序(例如视频会议)中,消息包的大小不可预测且可变。在本文中,我们提出了一个包含可变大小消息包的流代码的通用模型。我们表明,消息包大小的可变性导致了无损传输下速率和解码延迟之间的新折衷。此外,消息包大小的可变性会影响最佳传输速率。为了解决这个问题,我们引入了算法来计算任何给定消息包大小序列的最佳速率的上限和下限。然后,我们为提出的模型设计一个显式的流代码。我们对几个有代表性的参数设置的实时视频跟踪上的代码构建进行了经验评估,并表明构建率约为上限的 90%,比单纯使用现有的流代码高 5%–48%。消息包大小的可变性会影响最佳传输速率。为了解决这个问题,我们引入了算法来计算任何给定消息包大小序列的最佳速率的上限和下限。然后,我们为提出的模型设计一个显式的流代码。我们对几个有代表性的参数设置的实时视频跟踪上的代码构建进行了经验评估,并表明构建率约为上限的 90%,比单纯使用现有的流代码高 5%–48%。消息包大小的可变性会影响最佳传输速率。为了解决这个问题,我们引入了算法来计算任何给定消息包大小序列的最佳速率的上限和下限。然后,我们为提出的模型设计一个显式的流代码。我们对几个有代表性的参数设置的实时视频跟踪上的代码构建进行了经验评估,并表明构建率约为上限的 90%,比单纯使用现有的流代码高 5%–48%。
更新日期:2022-04-28
down
wechat
bug