## Dynamic Window-Constrained Scheduling for Multimedia Applications (1998)

Venue: | Georgia Institute of Technology |

Citations: | 49 - 22 self |

### BibTeX

@INPROCEEDINGS{West98dynamicwindow-constrained,

author = {Richard West and Karsten Schwan},

title = {Dynamic Window-Constrained Scheduling for Multimedia Applications},

booktitle = {Georgia Institute of Technology},

year = {1998}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper describes an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), designed to meet the service constraints on packets from multiple, network-bound media streams with different performance objectives. Using only two attributes, a deadline and a loss-tolerance per packet stream, DWCS: (1) can limit the number of late packets over finite numbers of consecutive packets in loss-tolerant or delayconstrained, heterogeneous traffic streams, (2) does not require a-priori knowledge of the worst-case loading from multiple streams to establish the necessary bandwidth allocations to meet per-stream delay and lossconstraints, and (3) can exhibit both fairness and unfairness properties when necessary. In fact, DWCS can perform fair-bandwidth allocation, static priority (SP) and earliest-deadline first (EDF) scheduling. We show the effectiveness of DWCS using a streaming video application, running over ATM. 1 Introduction This paper describes a novel packet scheduling algorith...

### Citations

1080 | Analysis and simulation of a fair queueing algorithm
- Demers, Keshav, et al.
(Show Context)
Citation Context ... amount from its predecessor. DWCS has the ability to share bandwidth among competing clients in strict proportion to their deadlines and loss-tolerances. This is similar to (weighted) fair scheduling=-=[1, 2, 3, 4]-=-, which attempts to allocate bandwidth in proportion to stream weights. Similar proportional share algorithms have been targeted at CPU scheduling[5, 6]. However, the idea of `windowing ' in DWCS is c... |

363 |
A self-clocked fair queueing scheme for broadband applications INFOCOM '94. Networking for Global Communications
- Golestani
(Show Context)
Citation Context ... amount from its predecessor. DWCS has the ability to share bandwidth among competing clients in strict proportion to their deadlines and loss-tolerances. This is similar to (weighted) fair scheduling=-=[1, 2, 3, 4]-=-, which attempts to allocate bandwidth in proportion to stream weights. Similar proportional share algorithms have been targeted at CPU scheduling[5, 6]. However, the idea of `windowing ' in DWCS is c... |

258 | WF2Q: Worst-case Fair Weighted Fair Queuing
- Bennett, Zhang
- 1996
(Show Context)
Citation Context ... amount from its predecessor. DWCS has the ability to share bandwidth among competing clients in strict proportion to their deadlines and loss-tolerances. This is similar to (weighted) fair scheduling=-=[1, 2, 3, 4]-=-, which attempts to allocate bandwidth in proportion to stream weights. Similar proportional share algorithms have been targeted at CPU scheduling[5, 6]. However, the idea of `windowing ' in DWCS is c... |

204 |
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
- GOYAL, VIN, et al.
- 1997
(Show Context)
Citation Context |

195 | A proportional share resource allocation algorithm for real-ti time-shared systems
- Stoica, Abdel-Wahab, et al.
- 1996
(Show Context)
Citation Context ...s is similar to (weighted) fair scheduling[1, 2, 3, 4], which attempts to allocate bandwidth in proportion to stream weights. Similar proportional share algorithms have been targeted at CPU scheduling=-=[5, 6]-=-. However, the idea of `windowing ' in DWCS is closer to the work of Hamdaoui and Ramanathan[7] who have simulated an algorithm that services multiple streams, in an attempt to ensure at least m custo... |

151 | Weihl Stride scheduling: Deterministic proportional-share resource management
- Waldspurger
- 1995
(Show Context)
Citation Context ...s is similar to (weighted) fair scheduling[1, 2, 3, 4], which attempts to allocate bandwidth in proportion to stream weights. Similar proportional share algorithms have been targeted at CPU scheduling=-=[5, 6]-=-. However, the idea of `windowing ' in DWCS is closer to the work of Hamdaoui and Ramanathan[7] who have simulated an algorithm that services multiple streams, in an attempt to ensure at least m custo... |

134 | A dynamic priority assignment technique for streams with (m,k)-firm deadlines
- Hamdaoui, Ramanathan
- 1995
(Show Context)
Citation Context ...oportion to stream weights. Similar proportional share algorithms have been targeted at CPU scheduling[5, 6]. However, the idea of `windowing ' in DWCS is closer to the work of Hamdaoui and Ramanathan=-=[7]-=- who have simulated an algorithm that services multiple streams, in an attempt to ensure at least m customers (packets or threads) in a stream (or process) meet their deadlines for every k consecutive... |

42 |
Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service, JACM
- Panwar, Towsley, et al.
- 1988
(Show Context)
Citation Context ...can be met, EDF guarantees to meet all deadlines. If packets are dropped after missing their deadlines, EDF is optimal with respect to loss-rate in discrete-time G/D/1 and continuous-time M/D/1 queues=-=[8]-=-. Static Priority Scheduling using DWCS If no packets in any streams have deadlines (ie., they effectively have infinite deadlines), DWCS degrades to static priority (SP). Static-priority scheduling i... |

23 |
Dynamic scheduling of a multiclass queue: Discount optimality
- Harrison
- 1975
(Show Context)
Citation Context ... degrades to static priority (SP). Static-priority scheduling is optimal for a weighted mean delay objective, where weighted mean delay is a linear combination of the delays experienced by all packets=-=[9]-=-. In DWCS, the current loss-tolerances associated with each packet in every stream are always equal to their original losstolerances, and each packet's loss-tolerance serves as its static priority. Na... |