Buffer design for wide-area ATM networks using virtual finishing times

Research output: Contribution to conferencePaper

Abstract

This paper is concerned with the design of a class of priority buffering strategies suitable for public, wide-area 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 L. Zhang and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.

Original languageEnglish (US)
Pages1901-1905
Number of pages5
StatePublished - Jan 1 1995
EventProceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) - Seattle, WA, USA
Duration: Jun 18 1995Jun 22 1995

Other

OtherProceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3)
CitySeattle, WA, USA
Period6/18/956/22/95

Fingerprint

Asynchronous transfer mode
Bandwidth
Automatic teller machines

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Hung, A., & Kesidis, G. (1995). Buffer design for wide-area ATM networks using virtual finishing times. 1901-1905. Paper presented at Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3), Seattle, WA, USA, .
Hung, A. ; Kesidis, George. / Buffer design for wide-area ATM networks using virtual finishing times. Paper presented at Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3), Seattle, WA, USA, .5 p.
@conference{0f88b77080d94108a1c280241616373a,
title = "Buffer design for wide-area ATM networks using virtual finishing times",
abstract = "This paper is concerned with the design of a class of priority buffering strategies suitable for public, wide-area 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 L. Zhang and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed.",
author = "A. Hung and George Kesidis",
year = "1995",
month = "1",
day = "1",
language = "English (US)",
pages = "1901--1905",
note = "Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3) ; Conference date: 18-06-1995 Through 22-06-1995",

}

Hung, A & Kesidis, G 1995, 'Buffer design for wide-area ATM networks using virtual finishing times', Paper presented at Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3), Seattle, WA, USA, 6/18/95 - 6/22/95 pp. 1901-1905.

Buffer design for wide-area ATM networks using virtual finishing times. / Hung, A.; Kesidis, George.

1995. 1901-1905 Paper presented at Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3), Seattle, WA, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Buffer design for wide-area ATM networks using virtual finishing times

AU - Hung, A.

AU - Kesidis, George

PY - 1995/1/1

Y1 - 1995/1/1

N2 - This paper is concerned with the design of a class of priority buffering strategies suitable for public, wide-area 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 L. 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 priority buffering strategies suitable for public, wide-area 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 L. 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=0029216142&partnerID=8YFLogxK

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

M3 - Paper

AN - SCOPUS:0029216142

SP - 1901

EP - 1905

ER -

Hung A, Kesidis G. Buffer design for wide-area ATM networks using virtual finishing times. 1995. Paper presented at Proceedings of the 1995 IEEE International Conference on Communications. Part 1 (of 3), Seattle, WA, USA, .