Conservation Relations for Fully Shared Atm Buffers

G. Kesidis

doi:10.1017/S0269964800003272

Conservation Relations for Fully Shared Atm Buffers

G. Kesidis

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

1 Scopus citations

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 language	English (US)
Pages (from-to)	147-151
Number of pages	5
Journal	Probability in the Engineering and Informational Sciences
Volume	8
Issue number	1
DOIs	https://doi.org/10.1017/S0269964800003272
State	Published - Jan 1994

All Science Journal Classification (ASJC) codes

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

Access to Document

10.1017/S0269964800003272

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 = jan,

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",

}

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

SN - 0269-9648

VL - 8

SP - 147

EP - 151

JO - Probability in the Engineering and Informational Sciences

JF - Probability in the Engineering and Informational Sciences

IS - 1

ER -

Conservation Relations for Fully Shared Atm Buffers

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this