Abstract
In this paper, we propose and evaluate a three-phase scheduling algorithm for input-queuing ATM switches, and we term it WRRLA algorithm. The WRRLA algorithm is an improvement over the conventional Weighted Round Robin (WRR) algorithm by simply combining it together with the Look Ahead (LA) technique. In a WRRLA scheduling operation, the WRR algorithm is first applied to schedule the time-sensitive traffics in order to guarantee their quality of service, and then the LA technique is applied to schedule the data traffics in order to increase the throughput of the ATM switches. Simulation results show that the WRRLA algorithm achieves good performances in simple architecture, less scheduling computation, higher efficiency (throughput) and lower delay bounds. Moreover, WRRLA compares favorably with other famous scheduling algorithms, such as PIM and WRR.
| Original language | English |
|---|---|
| Pages | 148-154 |
| Number of pages | 7 |
| Publication status | Published - 1997 |
| Externally published | Yes |
| Event | Proceedings of the 1997 2nd IEEE International Workshop on Broadband Switching Systems, BSS'97 - Taipei, China Duration: 2 Dec 1997 → 4 Dec 1997 |
Conference
| Conference | Proceedings of the 1997 2nd IEEE International Workshop on Broadband Switching Systems, BSS'97 |
|---|---|
| City | Taipei, China |
| Period | 2/12/97 → 4/12/97 |