Optimal buffer control during congestion in an ATM network node

Leandros Tassiulas, Yao Chung Hung, Shivendra Panwar

Research output: Contribution to journalArticle

Abstract

In this paper we study the problem of optimal buffer space priority control in an ATM network node. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceeds the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriately selecting the classes of cells which are dropped or blocked in case of overflow, we can have the more sensitive classes suffer smaller cell losses. Depending on the control that we have on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.

Original languageEnglish (US)
Pages (from-to)374-386
Number of pages13
JournalIEEE/ACM Transactions on Networking
Volume2
Issue number4
DOIs
StatePublished - Aug 1994

Fingerprint

Asynchronous transfer mode

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Electrical and Electronic Engineering

Cite this

Optimal buffer control during congestion in an ATM network node. / Tassiulas, Leandros; Hung, Yao Chung; Panwar, Shivendra.

In: IEEE/ACM Transactions on Networking, Vol. 2, No. 4, 08.1994, p. 374-386.

Research output: Contribution to journalArticle

Tassiulas, Leandros ; Hung, Yao Chung ; Panwar, Shivendra. / Optimal buffer control during congestion in an ATM network node. In: IEEE/ACM Transactions on Networking. 1994 ; Vol. 2, No. 4. pp. 374-386.
@article{218de5b22cd34c9e9af19990eb039ad5,
title = "Optimal buffer control during congestion in an ATM network node",
abstract = "In this paper we study the problem of optimal buffer space priority control in an ATM network node. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceeds the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriately selecting the classes of cells which are dropped or blocked in case of overflow, we can have the more sensitive classes suffer smaller cell losses. Depending on the control that we have on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.",
author = "Leandros Tassiulas and Hung, {Yao Chung} and Shivendra Panwar",
year = "1994",
month = "8",
doi = "10.1109/90.330418",
language = "English (US)",
volume = "2",
pages = "374--386",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Optimal buffer control during congestion in an ATM network node

AU - Tassiulas, Leandros

AU - Hung, Yao Chung

AU - Panwar, Shivendra

PY - 1994/8

Y1 - 1994/8

N2 - In this paper we study the problem of optimal buffer space priority control in an ATM network node. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceeds the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriately selecting the classes of cells which are dropped or blocked in case of overflow, we can have the more sensitive classes suffer smaller cell losses. Depending on the control that we have on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.

AB - In this paper we study the problem of optimal buffer space priority control in an ATM network node. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceeds the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriately selecting the classes of cells which are dropped or blocked in case of overflow, we can have the more sensitive classes suffer smaller cell losses. Depending on the control that we have on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.

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

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

U2 - 10.1109/90.330418

DO - 10.1109/90.330418

M3 - Article

VL - 2

SP - 374

EP - 386

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

IS - 4

ER -