MOBIHOC
2012
ACM
12 years 3 months ago
2012
ACM
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...
EMSOFT
2011
Springer
13 years 14 days ago
2011
Springer
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...
NOSSDAV
2004
Springer
14 years 6 months ago
2004
Springer
— 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...
GLOBECOM
2008
IEEE
14 years 7 months ago
2008
IEEE
—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...