Cell scheduling algorithm for VBR traffic in an ATM multiplexer

Chiung Shien Wu*, Gin Kou Ma, Bao-Shuh Lin 

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

8 Scopus citations

Abstract

In this paper, an efficient cell scheduling algorithm is proposed for multiplexing traffic sources with variable bit rate requirement in an ATM multiplexer. Three types of traffic sources are assumed in the multiplexer, namely the Constant bit rate (CBR), Variable bit rate (VBR), and Best-effort traffic. For VBR and CBR sources, a statistical bandwidth requirement should be claimed before they are multiplexed in the ATM outgoing link. The proposed algorithm dynamically schedules the traffic and preserves the claimed throughput in the outgoing link for each CBR or VBR source. When there is no cell arrival at the VBR or CBR sources, the proposed algorithm assigns the bandwidth to the best-effort sources. The performance of the proposed algorithm is evaluated via simulation. The result shows that the proposed method has better performance over other static multiplexing schemes such as weighted round-robin method.

Original languageEnglish
Pages632-637
Number of pages6
StatePublished - 1 Dec 1995
EventProceedings of the 1995 IEEE Global Telecommunications Conference. Part 2 (of 3) - Singapore, Singapore
Duration: 14 Nov 199516 Nov 1995

Conference

ConferenceProceedings of the 1995 IEEE Global Telecommunications Conference. Part 2 (of 3)
CitySingapore, Singapore
Period14/11/9516/11/95

Fingerprint Dive into the research topics of 'Cell scheduling algorithm for VBR traffic in an ATM multiplexer'. Together they form a unique fingerprint.

Cite this