Abstract
Scheduling ATM cells schemes for an (optical) ATM switch can dramatically in uence the performance of the ATM communication network. In this work we present an efficient scheduling algorithm that is based on perfect bipartite matching. The algorithm ensures fairness, providing a guaranteed latency bound for each arriving cell.