This paper proposes a new scheduling algorithm named TWFQ (Two-phased Weighted Fair Queueing) not only to maintain the fair utilization of available bandwidth but also to improve the performance of CDV and cell loss probability. The TWFQ algorithm makes use of the cell inter-arrival time of each connection for determining the cell service order among connections, which contributes to get a small CDV. To achieve low cell loss probability, the TWFQ allows connections, which suffer from the more bursty input traffic, to send the cell with more opportunities by using two scheduling phases. Through simulations, we show that the proposed algorithm achieves good performance in terms of CDV and cell loss probability, while other performance criteria are preserved in an acceptable level.

Per-Virtual Connection (VC) queueing allows an ATM switch to schedule cells to be transmitted on a link based on their VC. This alternative to the traditional First-In-First-Out(FIFO)queueing, in which cells from different VCs of the same priority are stored in a common queue, is implemented by some switch manufacturers. This paper assesses the merits of per-VC scheduling in regards to capacity, traffic shaping, and interworking with traffic management mechanisms such as connection admission control (CAC) and use of queue thresholds. The paper also discusses the conditions which favor the use of per-VC scheduling.