Comparative Analysis of Scheduling Algorithms For QoS Support in Wide Area Networks.

Scheduling is an important aspect of next generation wide area networks, as it plays a major role in deter mining the quality of service (QoS) a particular appli cation receives. In this paper, we discuss the main de sign issues related to scheduling and provide a frame work for the analysis of different scheduling algorithms to support the QoS requirements of multi media applications. Detailed simulation experiments, using different network parameters, including switch buffer sizes, inter-arrival rates, service rates, and net work 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 ac ceptable level of service guarantees. [ABSTRACT FROM PUBLISHER]

Copyright of Simulation is the property of Sage Publications, Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)