Resumo (PT):
This paper presents fundamental limits and practi- cal schemes for managing data and feedback of coded flows over multiple, half-duplex communication interfaces (routes). We set forth closed-form bounds on the capacity of resource constrained routes. Our work also provides a systematic approach to exploit these bounds in order to solve the allocation of coded packets with a reliability constraint efficiently, specifically providing a simple mechanism to compute the number of coded packets to be sent through each route. Optimal and heuristic schemes to exploit feedback in the presence of asymmetric packet loss probabilities and propagation delay are proposed and numerical results are provided to support our findings.
Abstract (EN):
This paper presents fundamental limits and practi- cal schemes for managing data and feedback of coded flows over multiple, half-duplex communication interfaces (routes). We set forth closed-form bounds on the capacity of resource constrained routes. Our work also provides a systematic approach to exploit these bounds in order to solve the allocation of coded packets with a reliability constraint efficiently, specifically providing a simple mechanism to compute the number of coded packets to be sent through each route. Optimal and heuristic schemes to exploit feedback in the presence of asymmetric packet loss probabilities and propagation delay are proposed and numerical results are provided to support our findings.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica