Abstract
ATM switches have been proposed as the switching fabric cores of many high-performance IP switches. In this paper, we present an efficient algorithm called IP-PIM for scheduling variable-length IP packets on these switches and compare its performance with the original parallel iterative matching (PIM) ATM cell scheduling algorithm. The mean IP packet delays using both the PIM and the IP-PIM scheduling algorithms are analyzed using queueing analysis and extensive simulations. Our results demonstrate that the packet level scheduling such as the IP-PIM could be a potential way to significantly improve the performance of PIM switches, especially in the context of IP networks.
| Original language | English |
|---|---|
| Pages | 1407-1411 |
| Number of pages | 5 |
| Publication status | Published - 1999 |
| Externally published | Yes |
| Event | 1999 IEEE Global Telecommunication Conference - GLOBECOM'99 - Rio de Janeiro, Braz Duration: 5 Dec 1999 → 9 Dec 1999 |
Conference
| Conference | 1999 IEEE Global Telecommunication Conference - GLOBECOM'99 |
|---|---|
| City | Rio de Janeiro, Braz |
| Period | 5/12/99 → 9/12/99 |