Abstract
Real-time packet schedulers have been studied extensively to support end-to-end bounded delay for multimedia traffic. Even though real-time flows are guaranteed by admission control scheme in the packet scheduler, their schedulability can be violated by arrival of non-real-time traffic. In this paper, we propose a new packet scheduler scheme to provide real-time traffic with predictability. Proposed scheme also provides non-real-time traffic with fast service time. We present the schedulability condition considering two packet schedulers and give the admission control algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
T. Abdelzaher and C. Lu. Schedulability analysis and utilization bounds for highly scalable real-time services. In Real-Time Technology and Applications Symposium, June 2001.
M. Andrews. Probabilistic end-to-end delay bounds for earliest deadline first scheduling. In IEEE INFOCOM, 2000.
R. L. Cruz. A calculus for network delay, part i:network elements in isolation. IEEE Transactions on Information Theory, 37(1):132–141, 1991.
Domenico Ferrari and Dinesh C. Verma. A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 8(3):368–379, 1990.
Victor Firoiu, James F. Kurose, and Donald F. Towsley. Efficient admission control for EDF schedulers. In INFOCOM (1), pages 310–317, 1997.
Leonidas Georgiadis, Roch Guérin, Vinod Peris, and Kumar N. Sivarajan. Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking, 4(4):482–501, 1996.
T. M. Ghazalie and T. P. Baker. Aperiodic servers in a deadline scheduling environment. The Journal of Real-Time Systems, 9:21–36, 1995.
Edward W. Knightly, Dallas E. Wrege, Jorg Liebeherr, and Hui Zhang. Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic. In Measurement and Modeling of Computer Systems, pages 98–107, 1995.
Jörg Liebeherr, Dallas E. Wrege, and Domenico Ferrari. Exact admission control for networks with a bounded delay service. IEEE/ACM Transactions on Networking, 4(6):885–901, 1996.
Yeonseung Ryu. Considering non-real-time traffic in real-time packet scheduler. Technical Report, Hallym University.
B. Sprunt. Aperiodic task scheduling for real-time systems. PhD thesis, Dept. of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburg, PA, August 1990.
K. Zhu, Y. Zhuang, and Y. Viniotis. Achieving end-to-end delay bounds by edf scheduling without traffic shaping. In IEEE INFOCOM, April 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryu, Y. (2002). Providing Multimedia Traffic with Predictability. In: Chen, YC., Chang, LW., Hsu, CT. (eds) Advances in Multimedia Information Processing — PCM 2002. PCM 2002. Lecture Notes in Computer Science, vol 2532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36228-2_112
Download citation
DOI: https://doi.org/10.1007/3-540-36228-2_112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00262-8
Online ISBN: 978-3-540-36228-9
eBook Packages: Springer Book Archive