Utility Optimal Coding for Packet Transmission over Wireless Networks - Part II: Networks of Packet Erasure Channels

TL;DR

This paper introduces a proportional fair coding scheme for multi-hop erasure networks that optimizes flow throughput by jointly adjusting coding rates and bit allocation within delay constraints.

Contribution

It presents a novel joint optimization method for coding rates and bit allocation in multi-hop erasure networks to maximize utility under capacity and delay constraints.

Findings

Achieves utility maximization through joint coding and bit allocation.

Provides a proportional fair transmission scheme for multi-hop erasure networks.

Demonstrates improved throughput performance under delay constraints.

Abstract

We define a class of multi--hop erasure networks that approximates a wireless multi--hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow destination within a specified delay deadline. The allocation of coding rates amongst flows/users is constrained by network capacity. We propose a proportional fair transmission scheme that maximises the sum utility of flow throughputs. This is achieved by {\em jointly optimising the packet coding rates and the allocation of bits of coded packets across transmission slots.}