Comparative analysis of scheduling algorithms for QoS support in wide area networks

Research output: Contribution to journalArticlepeer-review


Scheduling is an important aspect of next generation wide area networks, as it plays a major role in determining the quality of service (QoS) a particular application receives. In this paper, we discuss the main design issues related to scheduling and provide a framework for the analysis of different scheduling algorithms to support the QoS requirements of multimedia applications. Detailed simulation experiments, using different network parameters, including switch buffer sizes, inter-arrival rates, service rates, and network link capacities, were conducted. Our results show that simple scheduling algorithms such as FCFS are not adequate to support real-time QoS when the network load is heavy. The results also show that more complex algorithms may be required to provide an acceptable level of service guarantees.

Original languageEnglish
Pages (from-to)196-205
Number of pages10
Issue number5-6
Publication statusPublished - 2001
Externally publishedYes


  • Algorithms
  • Microprocessors
  • Multiprocessor systems
  • Networks

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Comparative analysis of scheduling algorithms for QoS support in wide area networks'. Together they form a unique fingerprint.

Cite this