Two scheduling algorithms for input-queued switches guaranteeing voice QoS

Min Song, Mansoor Alam

Research output: Contribution to conferencePaperpeer-review

10 Scopus citations

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 languageEnglish
Pages92-96
Number of pages5
StatePublished - 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: 25 Nov 200129 Nov 2001

Conference

ConferenceIEEE Global Telecommunicatins Conference GLOBECOM'01
Country/TerritoryUnited States
CitySan Antonio, TX
Period25/11/0129/11/01

Fingerprint

Dive into the research topics of 'Two scheduling algorithms for input-queued switches guaranteeing voice QoS'. Together they form a unique fingerprint.

Cite this