This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov mod...
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
— We present the design, implementation, and performance evaluation of AMPS — a flexible, scalable proxy testbed that supports a wide and extensible set of next-generation pro...
Xiaolan (Ellen) Zhang, Michael K. Bradshaw, Yang G...
—We consider packet-by-packet rate adaptation to maximize the throughput over a finite-state Markov channel. To limit the amount of feedback data, we use past packet acknowledge...
Chin Keong Ho, Job Oostveen, Jean-Paul M. G. Linna...