Communications - Scientific Letters of the University of Zilina 2000, 2(2):30-37 | DOI: 10.26552/com.C.2000.2.30-37

A study of a dynamic scheduling mechanism to guarantee QoS

Rachid Laalaoua1, Tulin Atmaca1
1 Institut National des Télécommunications, Evry Cedex, France

Packet scheduling is one of the key mechanisms that will be used in network elements (switches and routers) for supporting real-time applications in broadband networks. Provision of Quality-of-Service (QoS) guarantees is an important and challenging issue in the design of integrated service packet networks. Scheduling disciplines are an integral part of the problem and are closely related to other aspects of network modeling such as traffic charaterization and QoS specification. In this paper we discuss two priority scheduling mechanisms: Head of Line (HoL) and preemptive discipline; for both, we propose an analytical description and present numerical results obtained by Markov chain. A novel mechanism called Dynamic-Weighted Fair Queuing (Dynamic-WFQ) which depends on the Classes of Service and the queue occupancies is proposed. An example of selection function is solved by Markov Chain and the results are validated by simulation. Finally, we compare the performance evaluation of multimedia communication scheduling algorithms described above.

Keywords: queuing, QoS, dynamic-WFQ, HoL, Markov Chain, simulation, class of service

Published: June 30, 2000  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Laalaoua, R., & Atmaca, T. (2000). A study of a dynamic scheduling mechanism to guarantee QoS. Communications - Scientific Letters of the University of Zilina, 2(2), 30-37. doi: 10.26552/com.C.2000.2.30-37
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. SPOHN, D.L.: second edition 1997. Data Network Design, McGraw-Hill.
    2. KLEINROCK, L. 1975. Queueing Systems, Volume 1 and 2, Wiley-Interscience.
    3. PERROS, H. G.: 1994. Queueing Networks with Blocking, Oxford.
    4. GROSS, D., Harris, C. M.: 1985. Fundamentals of Queueing Theory, John Wiley.
    5. RUEGG, A.: 1980. STOCHASTIC PROCESSES, John Wiley & Sons.
    6. JIM, M. Ng., WOODWARD, M. C.: 1998. "Evaluation of multimedia Communication Scheduling Algorithms for Host-based Multiplexing", In Proceeding of the 1998 ICT Conference (Porto-Carras Greece).
    7. GALLARDO, J. R., MAKRAKIS, D., L'OPEZ, M., OROZCO BARBOSA, L.: 1998 "Performnance Comparison of UT and CT under Realistic Traffic Models", In Proceeding of the 1998 ICT Conference (Porto-Carras Greece).
    8. TANG, H., SIMULA, O.: 1998 "Another Dimension of Flow Control for the intelligent node", In Proceeding of the 1998 ICT Conference (Porto-Carras Greece).
    9. SHAH-HEYDARI, S., LE-NGOC, T.: 1998 "Multiple-state MMPP Models for Multimedia ATM Traffic", In Proceeding of the 1998 ICT Conference (Porto-Carras Greece).
    10. LAALAOUA, R., ATMACA, T.: 1998 "Voice Over Frame Relay", In Proceeding of the 1998 ICT Conference (Porto-Carras Greece).
    11. HAMMA, S., PECKA, P., CZACHRSKI, T., Atmaca, T.: 1997 "Markovian analysis of threshold based priority mechanism for Frame-Relay networks", In Proceeding of Voice, Video, and Data Communications Conference on Performance and Control of Network Systems, Switching and Traffic Management in High Speed Networks, (Dallas,Texas, USA). Go to original source...
    12. PAREKH, A., GALLAGER, R G.: 1993. "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case" IEEE/ACM Transactions on Networking, Vol. 1, No. 3, June 1993. Go to original source...
    13. PAREKH, A., GALLAGER, R G.: 1994. "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case" IEEE/ACM Transactions on Networking, Vol. 2, No. 2, April 1994. Go to original source...
    14. ZHANG, Bennet, H.: 1990. "Why WFQ is not good enough for Integrated Services Networks", In Proceeding of NOSSDAV'96 Conference (April 1996).
    15. DEMERS, A., KESHAV, S., SHENKER, S.: 1996. "Analysis and Simulation of a fair queueing algorithm", Journal of Internetworking Research anf Experiece, pages 3-26, October 1990. Go to original source...
    16. PAREKH, A.: 1992. "A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks" PhD dissertation, Massachusetts Institute of Technology, February 1992. Go to original source...
    17. ROBERTS, J. W.: 1994 "Virtual Spacing For Flexible Traffic Control", International Journal of Communication Systems, VOL. 7, 307-318. Go to original source...
    18. JAISWAL, K. N.: 1968 "Priority Queues", Academic Press, NewYork.
    19. LAVENBERG, S. S.: 1983 "Computer Performance Modelling Handbook", Academic Press, NewYork.

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content