The Dept. of Computer Science presents: Yuting Zhang, Candidate for Assistant Professor in Computer Science

Lecture: Window-Constrained Resource Management for Real-time Communication.

Monday, April 24, 2006, 4:30 pm. Alden Hall, Room 101. Refreshments will be served at 4:00M

Abstract:

Streaming multimedia applications such as live webcasts and interactive distance learning require real-time constraints for the data capture and transmission in keeping with end-user QoS requirements. Meanwhile, they can also tolerate some packets being discarded or serviced late, as long as the consecutive number of such losses is limited. Likewise, other soft real-time applications, such as data generation applications in sensor networks and in embedded systems, also have similar delay and loss constraints.

In this talk, I will present my thesis work on Window-Constrained resource management to guarantee a fraction of service in every finite time window for the above classes of applications. First, I will describe the original and relaxed window-constrained scheduling models and Virtual Deadline Scheduling (VDS) algorithm for the single server case. Compared to previous work on the Dynamic Window-Constrained Scheduling (DWCS) algorithm, VDS provides better window-constrained service guarantees to jobs, especially to those with potentially different request periods. Then, I will present the Multi-hop Virtual Deadline Scheduling (MVDS) algorithm which exploits cooperation between hops to provide end-to-end window-constraint guarantees.