Bounded latency scheduling scheme for ATM cells

Shlomi Dolev, Alexander Kesselman

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


Scheduling ATM cell schemes for an (optical) ATM switch can dramatically influence 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.

Original languageEnglish
Pages (from-to)325-331
Number of pages7
JournalComputer Networks
Issue number3
StatePublished - 1 Jan 2000


Dive into the research topics of 'Bounded latency scheduling scheme for ATM cells'. Together they form a unique fingerprint.

Cite this