Bandwidth scheduling for wide-area ATM networks using virtual finishing times

Anthony Hung; George Kesidis

doi:10.1109/90.503761

Bandwidth scheduling for wide-area ATM networks using virtual finishing times

Anthony Hung, George Kesidis

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

27 Scopus citations

Abstract

This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum bandwidth result for self-clocked fair queueing is given. We revisit an approach originally proposed by Zhang and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.

Original language	English (US)
Pages (from-to)	49-54
Number of pages	6
Journal	IEEE/ACM Transactions on Networking
Volume	4
Issue number	1
DOIs	https://doi.org/10.1109/90.503761
State	Published - 1996

All Science Journal Classification (ASJC) codes

Software
Computer Science Applications
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/90.503761

Cite this

@article{e7db5f216694479db72acf91e7562d72,

title = "Bandwidth scheduling for wide-area ATM networks using virtual finishing times",

abstract = "This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum bandwidth result for self-clocked fair queueing is given. We revisit an approach originally proposed by Zhang and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.",

author = "Anthony Hung and George Kesidis",

note = "Funding Information: Manuscript received December 12, 1994; revised September K!, 1995; approved by IEEE/ACM TRANSACTION:;N ETWORKINEGd itor D. Towsley. A. Hung was supported by ITRC of Ontario. G. Kesidis is supported by NSERC of Ontario. The authors are with the Electrical and Computer Engineering Department, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1 (e-mail: ahung@odysseus.uwaterloo.ca; g.kesidis@eandce.uwaterloo.ca; http://cheetah.vlsi.uwater.loo.ca). Publisher Item Identifi'er S 1063-6692(96)01369-6.",

year = "1996",

doi = "10.1109/90.503761",

language = "English (US)",

volume = "4",

pages = "49--54",

journal = "IEEE/ACM Transactions on Networking",

issn = "1063-6692",

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

number = "1",

}

TY - JOUR

T1 - Bandwidth scheduling for wide-area ATM networks using virtual finishing times

AU - Hung, Anthony

AU - Kesidis, George

N1 - Funding Information: Manuscript received December 12, 1994; revised September K!, 1995; approved by IEEE/ACM TRANSACTION:;N ETWORKINEGd itor D. Towsley. A. Hung was supported by ITRC of Ontario. G. Kesidis is supported by NSERC of Ontario. The authors are with the Electrical and Computer Engineering Department, University of Waterloo, Waterloo, Ontario, Canada, N2L 3G1 (e-mail: ahung@odysseus.uwaterloo.ca; g.kesidis@eandce.uwaterloo.ca; http://cheetah.vlsi.uwater.loo.ca). Publisher Item Identifi'er S 1063-6692(96)01369-6.

PY - 1996

Y1 - 1996

N2 - This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum bandwidth result for self-clocked fair queueing is given. We revisit an approach originally proposed by Zhang and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.

AB - This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum bandwidth result for self-clocked fair queueing is given. We revisit an approach originally proposed by Zhang and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.

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

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

U2 - 10.1109/90.503761

DO - 10.1109/90.503761

M3 - Article

AN - SCOPUS:0030087197

SN - 1063-6692

VL - 4

SP - 49

EP - 54

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

IS - 1

ER -

Bandwidth scheduling for wide-area ATM networks using virtual finishing times

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this