Abstract
In ubiquitous environment the traffic is expected more diverse than ever – ranging from traditional file transfer to continuous media applications such as audio and video conferencing. In this paper, we present a traffic scheduling scheme and an admission control algorithm for servicing a mix of non-real-time and real-time traffic in ubiquitous environment. Proposed scheduling algorithm assigns a deadline to the non-real-time packet by calculating the slack time on-line and services the non-real-time packet along with the real-time packet using Earliest Deadline First algorithm. The time complexity for calculation of the slack time and deadline assignment to the non-real-time packet is O(1) and thus the scheduling of non-real-time traffic can be performed at a low cost. Since proposed scheme services the non-real-time traffic while the link bandwidth is not used by the real-time traffic, it can guarantee the schedulability of real-time flows. Moreover, by limiting the number of admitted real-time flows in admission control algorithm, proposed method can provide the non-real-time flows with fast response time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andrews, M.: Probabilistic end-to-end delay bounds for earliest deadline first scheduling. In: IEEE INFOCOM (2000)
Chiussi, F., Sivaraman, V.: Achieving high utilization in guaranteed services networks using early deadline first scheduling. In: IEEE/IFIP International Workshop on Quality of Service, IWQoS 1998 (1998)
Cruz, R.L.: A calculus for network delay, part i:network elements in isolation. IEEE Transactions on Information Theory 37(1), 132–141 (1991)
Ferrari, D., Verma, D.C.: A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications 8(3), 368–379 (1990)
Firoiu, V., Kurose, J.F., Towsley, D.F.: Efficient admission control for EDF schedulers. In: INFOCOM, vol. (1), pp. 310–317 (1997)
Georgiadis, L., Guerin, R., Parekh, A.K.: Optimal multiplexing on a single link: Delay and buffer requirements. IEEE/ACM Transactions on Information Theory 43, 1518–1535 (1997)
Georgiadis, L., Guérin, R., Peris, V., Sivarajan, K.N.: Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking 4(4), 482–501 (1996)
Kim, J.H., Chien, A.A.: Rotating combined queueing (RCQ): Bandwidth and latency guarantees in low-cost, high-performance networks. In: ISCA, pp. 226–236 (1996)
Knightly, E.W., Wrege, D.E., Liebeherr, J., Zhang, H.: Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic. In: Measurement and Modeling of Computer Systems, pp. 98–107 (1995)
Liebeherr, J., Wrege, D.E., Ferrari, D.: Exact admission control for networks with a bounded delay service. IEEE/ACM Transactions on Networking 4(6), 885–901 (1996)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM 20(1), 46–61 (1973)
Ryu, Y.: Considering non-real-time traffic in real-time packet scheduler. In: Boavida, F., Monteiro, E., Orvalho, J. (eds.) IDMS 2002 and PROMS 2002. LNCS, vol. 2515, pp. 216–228. Springer, Heidelberg (2002)
Sivaraman, V., Chiussi, F.: Statistical analysis of delay bound violations at an earliest deadline first (edf) scheduler. In: Performance (1999)
Zhang, H., Ferrari, D.: Rate-controlled static-priority queueing. In: INFOCOM, vol. (1), pp. 227–236 (1993)
Zhu, K., Zhuang, Y., Viniotis, Y.: 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
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ryu, Y., Hong, S., Jang, H., Cho, S., Lee, C. (2004). An Admission Control Algorithm for Scheduling Mixed Traffic in Ubiquitous Environment. In: Yang, L.T., Guo, M., Gao, G.R., Jha, N.K. (eds) Embedded and Ubiquitous Computing. EUC 2004. Lecture Notes in Computer Science, vol 3207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30121-9_81
Download citation
DOI: https://doi.org/10.1007/978-3-540-30121-9_81
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22906-3
Online ISBN: 978-3-540-30121-9
eBook Packages: Springer Book Archive