Comparative analysis of scheduling algorithms for Integrated Service Networks

A. Hashmi, A. Pimplapure, T. Znati

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)


Scheduling is an important aspect of Integrated Service Networks (ISNs) and 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 for ISNs. 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)66-73
Number of pages8
JournalProceedings of the IEEE Annual Simulation Symposium
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the 1998 31st Annual Simulation Symposium - Boston, MA, USA
Duration: Apr 5 1998Apr 9 1998

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation


Dive into the research topics of 'Comparative analysis of scheduling algorithms for Integrated Service Networks'. Together they form a unique fingerprint.

Cite this