Scalable scheduling support for loss and delay constrained media streams

Real-Time Technology and Applications - Proceedings

Volumn , Issue , 1999, Pages 24-35

  West, Richard ^a   Schwan, Karsten ^a   Poellabuer, Christian ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC WINDOW-CONSTRAINED SCHEDULING; EFFICIENT SCHEDULING; HETEROGENEOUS TRAFFIC; PERFORMANCE OBJECTIVE; QUALITYOF-SERVICE REQUIREMENT (QOS); REAL-TIME PACKETS; SERVICE CONSTRAINTS; SERVICE GUARANTEES;

APPROXIMATION ALGORITHMS; SCHEDULING; ALGORITHMS; APPROXIMATION THEORY; CLIENT SERVER COMPUTER SYSTEMS; CONSTRAINT THEORY; PACKET NETWORKS; RESPONSE TIME (COMPUTER SYSTEMS); TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC;

QUALITY OF SERVICE; REAL TIME SYSTEMS;

DELAY CONSTRAINED TRAFFIC STREAMS; DYNAMIC WINDOW CONSTRAINED SCHEDULING; LOSS TOLERANT TRAFFIC STREAMS; QUALITY OF SERVICE;

EID: 0032593199     PISSN: 10801812     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTTAS.1999.777658     Document Type: Conference Paper

References (18)

1. C. Aurrecoechea, A. Campbell, and L. Hauw. A sur-vey of qos architectures. Multimedia Systems Journal, Special Issue on QoS Architecture, 1997.
2. J. C. Bennett and H. Zhang. WF2Q: Worst-case fair weighted fair queueing. In IEEE INFOCOMM'96, pages 120{128. IEEE, March 1996.
3. W. J. Bolosky, R. P. Fitzgerald, and J. R. Douceur. Distributed schedule management in the tiger video fileserver. In Sixteenth ACM Symposium on Operating System Principles, volume 31, pages 212{223. ACM, December 1997.
4. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair-queueing algorithm. Journal of Internetworking Research and Experience, pages 3{26, October 1990.
5. D. Ferrari. Client requirements for real-time commu-nication services. IEEE Communications Magazine, 28(11):76{90, November 1990.
6. S. Golestani. A self-clocked fair queueing scheme for broadband applications. In INFOCOMM'94, pages 636{646. IEEE, April 1994.
7. M. Hamdaoui and P. Ramanathan. A dynamic prior-ity assignment technique for streams with (m, k)-firm deadlines. IEEE Transactions on Computers, April 1995.
8. M. B. Jones, D. Rosu, and M.-C. Rosu. CPU reser-vations and time constraints: Efficient, predictable scheduling of independent activities. In Sixteenth ACM Symposium on Operating System Principles, vol-ume 31, pages 198{211. ACM, December 1997.
9. H. M. V. Pawan Goyal and H. Cheng. Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks. In IEEE SIG-COMM'96. IEEE, 1996.
10. J. M. Peha and F. A. Tobagi. A cost-based schedul-ing algorithm to support integrated services. In IEEE INFOCOMM'91, pages 741{753. IEEE, 1991.
11. D. Rosu, K. Schwan, S. Yalamanchili, and R. Jha. On Adaptive Resource Allocation for Complex Real-Time Applications. 18th IEEE Real-Time Systems Sympo-sium, Dec., 1997.
12. K. Schwan and H. Zhou. Dynamic scheduling of hard real-time tasks and real-time threads. IEEE Trans. on Software Engineering, 18(8):736{748, August 1992.
13. I. Stoica, H. Abdel-Wahab, K. Jeay, S. K. Baruah, J. E. Gehrke, and C. G. Plaxton. A proportional share resource allocation algorithm for real-time, time-shared systems. In Real-Time Systems Symposium. IEEE, December 1996.
14. I. Stoica, H. Zhang, and T. S. E. Ng. A hierarchical fair service curve algorithm for link-sharing, real-time and priority services. In SIGCOMM'97, pages 249{ 262. ACM, October 1997.
15. C. A. Waldspurger and W. E. Weihl. Stride schedul-ing: Deterministic proportional-share resource man-agement. Technical Report MIT/LCS/TM-528, MIT, June 1995.
16. R. West and K. Schwan. Dynamic window-constrained scheduling for multimedia applications. Technical Re-port GIT-CC-98-18, Georgia Institute of Technology, 1998
17. R. West, K. Schwan, and C. Poellabauer. Scalable scheduling support for loss and delay constrained me-dia streams. Technical Report GIT-CC-98-29, Georgia Institute of Technology, 1998.
18. H. Zhang and S. Keshav. Comparison of rate-based service disciplines. In Proceedings of ACM SIG-COMM, pages 113{121. ACM, August 1991.