19 search results - page 1 / 4 » On-demand Bounded Broadcast Scheduling with Tight Deadlines |
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper presents a fair scheduling scheme for on-line scheduling on-demand time-critical data broadcast in the context of real-time information dissemination. The design of ...
CATS
2006
13 years 6 months ago
2006
We investigate a scheduling problem motivated by pull-based data delivering systems where there is a server keeping a number of pages; and clients requesting the same page can be ...
BROADNETS
2004
IEEE
13 years 8 months ago
2004
IEEE
In this paper, we present a framework for the design of minimal power schedulers that satisfy average packet delay bounds for multiple users in a Gaussian wireless broadcast chann...
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
We study an on-line broadcast scheduling problem in which requests have deadlines, and the objective is to maximize the weighted throughput, i.e., the weighted total length of the ...