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

Anthony Hung, George Kesidis

Research output: Contribution to journalArticlepeer-review

27 Scopus citations


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 languageEnglish (US)
Pages (from-to)49-54
Number of pages6
JournalIEEE/ACM Transactions on Networking
Issue number1
StatePublished - 1996

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Bandwidth scheduling for wide-area ATM networks using virtual finishing times'. Together they form a unique fingerprint.

Cite this