All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD3-S7-T1.4
Paper Title Small-Sample Inferred Adaptive Recoding for Batched Network Coding
Authors Jie Wang, Zhiyuan Jia, The Chinese University of Hong Kong, Shenzhen, China; Hoover H. F. Yin, The Chinese University of Hong Kong, Hong Kong SAR of China; Shenghao Yang, The Chinese University of Hong Kong, Shenzhen, China
Session D3-S7-T1: Topics in Network Coding II
Chaired Session: Thursday, 15 July, 00:00 - 00:20
Engagement Session: Thursday, 15 July, 00:20 - 00:40
Abstract Batched network coding is a low-complexity network coding solution to feedbackless multi-hop wireless packet network transmission with packet loss. The data to be transmitted is encoded into batches where each of which consists of a few coded packets. Unlike the traditional forwarding strategy, the intermediate network nodes have to perform recoding, which generates recoded packets by network coding operations restricted within the same batch. Adaptive recoding is a technique to adapt the fluctuation of packet loss by optimizing the number of recoded packets per batch to enhance the throughput. The input rank distribution, which is a piece of information regarding the batches arriving at the node, is required to apply adaptive recoding. However, this distribution is not known in advance in practice as the incoming link's channel condition may change from time to time. On the other hand, to fully utilize the potential of adaptive recoding, we need to have a good estimation of this distribution. In other words, we need to guess this distribution from a few samples so that we can apply adaptive recoding as soon as possible. In this paper, we propose a distributionally robust optimization for adaptive recoding with a small-sample inferred prediction of the input rank distribution. We develop an algorithm to efficiently solve this optimization with the support of theoretical guarantees that our optimization's performance would constitute as a confidence lower bound of the optimal throughput with high probability.