Carry-over round robin: a simple cell scheduling mechanism for ATM networks

Debanjan Saha; Sarit Mukherjee; Satish K. Tripathi

Carry-over round robin: a simple cell scheduling mechanism for ATM networks

Debanjan Saha
, Sarit Mukherjee
, Satish K. Tripathi

OTP Administrative Operations

IBM

Research output: Contribution to journal › Conference article › peer-review

10 Scopus citations

Abstract

We propose a work-conserving scheduling mechanism for providing deterministic performance guarantees in ATM networks. The most attractive feature of the proposed mechanism, which we call Carry-Over Round Robin (CORR), is its simplicity. It is an extension of weighted round robin scheduling. We have derived closed form bounds for worst case end-to-end delay when CORR is used in conjunction with composite leaky bucket, and moving window regulators. Our results show that albeit its simplicity, CORR is very competitive with some of the more complex scheduling disciplines such as Packet-by-Packet Generalized Processor Sharing and Stop-and-Go queueing.

Original language	English
Pages (from-to)	630-637
Number of pages	8
Journal	Proceedings - IEEE INFOCOM
Volume	2
State	Published - 1996
Event	Proceedings of the 1996 15th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'96. Part 1 (of 3) - San Francisco, CA, USA Duration: Mar 24 1996 → Mar 28 1996

Cite this

@article{5d45e308d5f54ba2b014cde037d614ae,

title = "Carry-over round robin: a simple cell scheduling mechanism for ATM networks",

abstract = "We propose a work-conserving scheduling mechanism for providing deterministic performance guarantees in ATM networks. The most attractive feature of the proposed mechanism, which we call Carry-Over Round Robin (CORR), is its simplicity. It is an extension of weighted round robin scheduling. We have derived closed form bounds for worst case end-to-end delay when CORR is used in conjunction with composite leaky bucket, and moving window regulators. Our results show that albeit its simplicity, CORR is very competitive with some of the more complex scheduling disciplines such as Packet-by-Packet Generalized Processor Sharing and Stop-and-Go queueing.",

author = "Debanjan Saha and Sarit Mukherjee and Tripathi, \{Satish K.\}",

year = "1996",

language = "English",

volume = "2",

pages = "630--637",

journal = "Proceedings - IEEE INFOCOM",

issn = "0743-166X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 1996 15th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'96. Part 1 (of 3) ; Conference date: 24-03-1996 Through 28-03-1996",

}

TY - JOUR

T1 - Carry-over round robin

T2 - Proceedings of the 1996 15th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM'96. Part 1 (of 3)

AU - Saha, Debanjan

AU - Mukherjee, Sarit

AU - Tripathi, Satish K.

PY - 1996

Y1 - 1996

N2 - We propose a work-conserving scheduling mechanism for providing deterministic performance guarantees in ATM networks. The most attractive feature of the proposed mechanism, which we call Carry-Over Round Robin (CORR), is its simplicity. It is an extension of weighted round robin scheduling. We have derived closed form bounds for worst case end-to-end delay when CORR is used in conjunction with composite leaky bucket, and moving window regulators. Our results show that albeit its simplicity, CORR is very competitive with some of the more complex scheduling disciplines such as Packet-by-Packet Generalized Processor Sharing and Stop-and-Go queueing.

AB - We propose a work-conserving scheduling mechanism for providing deterministic performance guarantees in ATM networks. The most attractive feature of the proposed mechanism, which we call Carry-Over Round Robin (CORR), is its simplicity. It is an extension of weighted round robin scheduling. We have derived closed form bounds for worst case end-to-end delay when CORR is used in conjunction with composite leaky bucket, and moving window regulators. Our results show that albeit its simplicity, CORR is very competitive with some of the more complex scheduling disciplines such as Packet-by-Packet Generalized Processor Sharing and Stop-and-Go queueing.

UR - https://www.scopus.com/pages/publications/0029736260

M3 - Conference article

AN - SCOPUS:0029736260

SN - 0743-166X

VL - 2

SP - 630

EP - 637

JO - Proceedings - IEEE INFOCOM

JF - Proceedings - IEEE INFOCOM

Y2 - 24 March 1996 through 28 March 1996

ER -

Carry-over round robin: a simple cell scheduling mechanism for ATM networks

Abstract

Other files and links

Fingerprint

Cite this