On Minimizing Multicast Completion Delay for Instantly Decodable Network Coding

Free registration required

Executive Summary

In this paper, the authors consider the problem of minimizing the mean completion delay in wireless multicast for instantly decodable network coding. They first formulate the problem as a Stochastic Shortest Path (SSP) problem. Although finding the optimal selection policy using SSP is intractable, they use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these properties, they propose a simple online selection algorithm that efficiently minimizes the mean completion delay of a frame of multicast packets with a similar computational complexity as the random and greedy selection algorithms.

  • Format: PDF
  • Size: 173.7 KB