Date Added: Mar 2011
Over the past two years there has emerged a new approach to solve the problem of delivering required throughputs of packets that meet hard deadlines over heterogeneous unreliable channels. These recent results provide a contract for flows with throughput as well as delay constraints. These contracts have two desirable properties: the contracts can be supported by the wireless network, and, further, the contracts are appropriate enough that applications can define their requirements through them. The theory provides admission control algorithms for deciding when flows with throughput-cum-deadlines can be satisfied, as well as simple scheduling algorithms for doing so. The theory also extends well to various arrival patterns for packets, fading models, and rate adaptation schemes, as well as broadcast.