Bounded latency scheduling scheme for ATM cells

Shlomi Dolev, Kesselman Alexander

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages273-277
Number of pages5
StatePublished - 1 Jan 1999
EventProceedings of the 1999 4th IEEE International Symposium on Computers and Communications, ISCC'99 - Red sea, Egypt
Duration: 6 Jul 19998 Jul 1999

Conference

ConferenceProceedings of the 1999 4th IEEE International Symposium on Computers and Communications, ISCC'99
CityRed sea, Egypt
Period6/07/998/07/99

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics (all)
  • Computer Science Applications
  • Computer Networks and Communications

Fingerprint

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

Cite this