Abstract
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.
Get full access to this article
View all access options for this article.
