Two scheduling algorithms for input-queued switches guaranteeing voice QoS

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 can...

Full description

Saved in:
Bibliographic Details
Published in2001 IEEE Global Telecommunications Conference - Globecom Vol. 1; pp. 92 - 96 vol.1
Main Authors Min Song, Alam, M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2001
Subjects
Bandwidth
Delay
Jitter
Quality of service
Scheduling algorithm
Switches
Telecommunication traffic
Throughput
Traffic control
Web and internet services
Online AccessGet full text
ISBN0780372069
9780780372061
DOI10.1109/GLOCOM.2001.965086

Cover

More Information
Summary: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-known 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.
ISBN:0780372069
9780780372061
DOI:10.1109/GLOCOM.2001.965086