Bounded latency scheduling scheme for ATM cells

Shlomi Dolev; Alexander Kesselman

doi:10.1016/S1389-1286(00)00002-5

Bounded latency scheduling scheme for ATM cells

Shlomi Dolev, Alexander Kesselman

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

8 Scopus citations

Abstract

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 language	English
Pages (from-to)	325-331
Number of pages	7
Journal	Computer Networks
Volume	32
Issue number	3
DOIs	https://doi.org/10.1016/S1389-1286(00)00002-5
State	Published - 1 Jan 2000

ASJC Scopus subject areas

Computer Networks and Communications

Access to Document

10.1016/S1389-1286(00)00002-5

Cite this

@article{b10518672c69450d90297ba336abf1d9,

title = "Bounded latency scheduling scheme for ATM cells",

abstract = "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.",

author = "Shlomi Dolev and Alexander Kesselman",

year = "2000",

month = jan,

day = "1",

doi = "10.1016/S1389-1286(00)00002-5",

language = "English",

volume = "32",

pages = "325--331",

journal = "Computer Networks",

issn = "1389-1286",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Bounded latency scheduling scheme for ATM cells

AU - Dolev, Shlomi

AU - Kesselman, Alexander

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033691233&partnerID=8YFLogxK

U2 - 10.1016/S1389-1286(00)00002-5

DO - 10.1016/S1389-1286(00)00002-5

M3 - Article

AN - SCOPUS:0033691233

SN - 1389-1286

VL - 32

SP - 325

EP - 331

JO - Computer Networks

JF - Computer Networks

IS - 3

ER -

Bounded latency scheduling scheme for ATM cells

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this