Abstract
To support the exponentially increasing demand with quality of service (QoS) requirements, input queued switches show great promise. Scheduling algorithms for input-queued switches must provide high throughput, individual flow QoS guarantee; and high network utilization. Most existing algorithms cannot satisfy the above three tasks. Based on a well-know scheduler, longest port first (LPF), this paper presents two algorithms: i) worst-case LPF (WLPF) and ii) prioritized LPF (PLPF), that support voice traffic QoS under the bursty and hot-spot traffic stream. Simulation results are presented that show that both of them improve the voice traffic QoS.
Original language | English |
---|---|
Pages | 92-96 |
Number of pages | 5 |
State | Published - 2001 |
Event | IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: 25 Nov 2001 → 29 Nov 2001 |
Conference
Conference | IEEE Global Telecommunicatins Conference GLOBECOM'01 |
---|---|
Country/Territory | United States |
City | San Antonio, TX |
Period | 25/11/01 → 29/11/01 |