Efficient Feedback-Based Scheduling Policies for Chunked Network Codes Over Networks with Loss and Delay
The problem of designing efficient feedback-based scheduling policies for Chunked Codes (CC) over packet networks with delay and loss is considered. For networks with feedback, two scheduling policies, referred to as Random Push (RP) and Local-Rarest-First (LRF), already exist. The authors propose a new scheduling policy, referred to as minimum-Distance-First (MDF), and based on the expected number of innovative successful packet transmissions at each node of the network prior to the "Next" transmission time, given the feedback information from the downstream node about the received packets. Unlike the existing policies, the MDF policy incorporates loss and delay models of the link in the selection process of the chunk to be transmitted.