A cell scheduling algorithm for VBR traffic in an ATM multiplexer

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.

[1]  Ioannis Lambadaris,et al.  A comparative study of some leaky bucket network access schemes , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[2]  Tzung-Pao Lin,et al.  An improved scheduling algorithm for weighted round-robin cell multiplexing in an ATM switch , 1994, Proceedings of ICC/SUPERCOMM'94 - 1994 International Conference on Communications.

[3]  Catherine Rosenberg,et al.  A heuristic framework for source policing in ATM networks , 1994, TNET.

[4]  Lixia Zhang VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks , 1991, ACM Trans. Comput. Syst..

[5]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[6]  David L. Tennenhouse,et al.  The VuNet Desk Area Network: Architecture, Implementaion, and Experience , 1995, IEEE J. Sel. Areas Commun..