2002Unpublished venueRequires access

A cell scheduling algorithm for VBR traffic in an ATM multiplexer

Chiung-Shien Wu, Gin-Kou Ma, Bowen Lin

Open publisher page 9 citations

Abstract

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 an 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 the weighted round-robin method.

About this research paper

What this paper is about

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 an 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 the weighted round-robin method.

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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 an 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 the weighted round-robin method.

Key concepts: Variable bitrate, Multiplexer, Computer science, Statistical time division multiplexing, Multiplexing, Algorithm, Asynchronous Transfer Mode, Scheduling (production processes)

Related papers

Back to paper searchBrowse research topicsOriginal source
A cell scheduling algorithm for VBR traffic in an ATM multiplexer — Research Paper | ScholarLens