Comparative Analysis Of Scheduling Algorithms For Qos Support In Wide Area Networks  

Oleh:

Znati, Taieb

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Simulation vol. 77 no. 5-6 (May 2001), page 196-205.
Topik: Networks; microprocessors; algorithms; multiprocessor systems
Fulltext: 196.pdf (1.14MB)

Isi artikel

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.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali