Design and evaluation of cell scheduling algorithms for atm switches

摘要

An ATM switch is a high speed fixed-size packet switching architecture; it is a basic element for the ATM protocol which has been widely accepted as the ultimate solution for the BISDN. In this paper, we first successfully transform the cell scheduling problem of a window-based input queueing ATM switch to the maximum matching problem on a bipartite graph.