Abstract
Scheduling ATM cells 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 language | English |
|---|---|
| Pages | 273-277 |
| Number of pages | 5 |
| State | Published - 1 Jan 1999 |
| Event | Proceedings of the 1999 4th IEEE International Symposium on Computers and Communications, ISCC'99 - Red sea, Egypt Duration: 6 Jul 1999 → 8 Jul 1999 |
Conference
| Conference | Proceedings of the 1999 4th IEEE International Symposium on Computers and Communications, ISCC'99 |
|---|---|
| City | Red sea, Egypt |
| Period | 6/07/99 → 8/07/99 |
ASJC Scopus subject areas
- Software
- Signal Processing
- General Mathematics
- Computer Science Applications
- Computer Networks and Communications