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

Technical Program

Paper Detail

Paper IDD2-S4-T2.1
Paper Title Streaming Erasure Codes over Multi-Access Relay Networks
Authors Gustavo Kasper Facenda, Elad Domanovitz, Ashish Khisti, University of Toronto, Canada; Wai-Tian Tan, John Apostolopoulos, Cisco Systems, United States
Session D2-S4-T2: Streaming Codes
Chaired Session: Tuesday, 13 July, 23:00 - 23:20
Engagement Session: Tuesday, 13 July, 23:20 - 23:40
Abstract Applications where multiple users communicate with a common server and desire low latency are common and increasing. This paper studies a network with two source nodes, one relay node and a destination node, where each source nodes wishes to transmit a sequence of messages, through the relay, to the destination, who is required to decode the messages with a strict delay constraint T. The network with a single source node has been studied in [1]. We start by introducing two important tools: the delay spectrum, which generalizes delay-constrained point-to-point transmission, and concatenation, which, similar to time sharing, allows combinations of different codes in order to achieve a desired regime of operation. Using these tools, we are able to generalize the two schemes previously presented in [1], and propose a novel scheme which allows us to achieve optimal rates under a set of well-defined conditions. Such novel scheme is further improved in order to achieve higher rates in the scenarios where the conditions for optimality are not met.