Two scheduling algorithms for input-queued switches guaranteeing voice QoS

Author

Song, Min ; Alam, Mansoor

Author_Institution

Dept. of Comput. Sci., Eastern Kentucky Univ., Richmond, KY, USA

Volume

1

fYear

2001

fDate

2001

Firstpage

92

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

Keywords

Internet telephony; protocols; quality of service; queueing theory; scheduling; telecommunication traffic; PLPF; QoS guarantee; WLPF; bursty traffic; hot-spot traffic stream; input queued switches; longest port first scheduler; network utilization; prioritized LPF; protocols; quality of service; scheduling algorithms; throughput; voice traffic; worst-case LPF; Bandwidth; Delay; Jitter; Quality of service; Scheduling algorithm; Switches; Telecommunication traffic; Throughput; Traffic control; Web and internet services;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE

Conference_Location

San Antonio, TX

Print_ISBN

0-7803-7206-9

Type

conf

DOI

10.1109/GLOCOM.2001.965086

Filename

965086