Conservation Relations for Fully Shared Atm Buffers

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In asynchronous transfer mode (ATM), networks, buffering is required to reduce cell loss and increase bandwidth utilization by the bursty traffic. Several types of traffic with different performance requirements on delay and loss will share buffer resources. We focus on the fully shared buffer with push-out and a randomized service priority rule. Some conservation relations are obtained which can be used to tune the parameters of the buffering and service disciplines.

Original languageEnglish (US)
Pages (from-to)147-151
Number of pages5
JournalProbability in the Engineering and Informational Sciences
Volume8
Issue number1
DOIs
StatePublished - Jan 1994

Fingerprint

Buffer
Conservation
Traffic
Priority Rules
Asynchronous transfer mode
Telecommunication traffic
Bandwidth
Resources
Requirements
Cell
Priority rules

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{345d175362204b02851a8500599c9440,
title = "Conservation Relations for Fully Shared Atm Buffers",
abstract = "In asynchronous transfer mode (ATM), networks, buffering is required to reduce cell loss and increase bandwidth utilization by the bursty traffic. Several types of traffic with different performance requirements on delay and loss will share buffer resources. We focus on the fully shared buffer with push-out and a randomized service priority rule. Some conservation relations are obtained which can be used to tune the parameters of the buffering and service disciplines.",
author = "G. Kesidis",
year = "1994",
month = "1",
doi = "10.1017/S0269964800003272",
language = "English (US)",
volume = "8",
pages = "147--151",
journal = "Probability in the Engineering and Informational Sciences",
issn = "0269-9648",
publisher = "Cambridge University Press",
number = "1",

}

Conservation Relations for Fully Shared Atm Buffers. / Kesidis, G.

In: Probability in the Engineering and Informational Sciences, Vol. 8, No. 1, 01.1994, p. 147-151.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Conservation Relations for Fully Shared Atm Buffers

AU - Kesidis, G.

PY - 1994/1

Y1 - 1994/1

N2 - In asynchronous transfer mode (ATM), networks, buffering is required to reduce cell loss and increase bandwidth utilization by the bursty traffic. Several types of traffic with different performance requirements on delay and loss will share buffer resources. We focus on the fully shared buffer with push-out and a randomized service priority rule. Some conservation relations are obtained which can be used to tune the parameters of the buffering and service disciplines.

AB - In asynchronous transfer mode (ATM), networks, buffering is required to reduce cell loss and increase bandwidth utilization by the bursty traffic. Several types of traffic with different performance requirements on delay and loss will share buffer resources. We focus on the fully shared buffer with push-out and a randomized service priority rule. Some conservation relations are obtained which can be used to tune the parameters of the buffering and service disciplines.

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

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

U2 - 10.1017/S0269964800003272

DO - 10.1017/S0269964800003272

M3 - Article

AN - SCOPUS:84971922775

VL - 8

SP - 147

EP - 151

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

SN - 0269-9648

IS - 1

ER -