Efficient buffer sharing in shared memory ATM systems with space priority traffic

Rajarshi Roy; Shivendra S. Panwar

doi:10.1109/4234.996047

Efficient buffer sharing in shared memory ATM systems with space priority traffic

Rajarshi Roy, Shivendra S. Panwar

Electrical and Computer Engineering

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

Abstract

In this letter we study the problem of the optimal design of buffer management policies within the class of pushout and expelling policies for a shared memory asynchronous transfer mode (ATM) switch or demultiplexer fed by traffic containing two different space priorities. A numerical study of the optimal policies for small buffer sizes is used to help design heuristics applicable to large buffer sizes. Simulation studies for large buffer systems are then presented.

Original language	English (US)
Pages (from-to)	162-164
Number of pages	3
Journal	IEEE Communications Letters
Volume	6
Issue number	4
DOIs	https://doi.org/10.1109/4234.996047
State	Published - Apr 2002

Keywords

ATM
Buffer management
Markov decision theory
Sample path techniques
Shared memory switch

ASJC Scopus subject areas

Modeling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/4234.996047

Cite this

@article{6d3a6728c9a34894b33d0d26fcde5676,

title = "Efficient buffer sharing in shared memory ATM systems with space priority traffic",

abstract = "In this letter we study the problem of the optimal design of buffer management policies within the class of pushout and expelling policies for a shared memory asynchronous transfer mode (ATM) switch or demultiplexer fed by traffic containing two different space priorities. A numerical study of the optimal policies for small buffer sizes is used to help design heuristics applicable to large buffer sizes. Simulation studies for large buffer systems are then presented.",

keywords = "ATM, Buffer management, Markov decision theory, Sample path techniques, Shared memory switch",

author = "Rajarshi Roy and Panwar, {Shivendra S.}",

note = "Funding Information: Manuscript received May 21, 2000. The associate editor coordinating the review of this letter and approving it for publication was Prof. D. Petr. This work was supported by the New York State Center for Advanced Technology in Telecommunications (CATT), Polytechnic University, Brooklyn, NY. This work was presented at the 33rd Conference on Information Science and Systems, March 1999.",

year = "2002",

month = apr,

doi = "10.1109/4234.996047",

language = "English (US)",

volume = "6",

pages = "162--164",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Efficient buffer sharing in shared memory ATM systems with space priority traffic

AU - Roy, Rajarshi

AU - Panwar, Shivendra S.

N1 - Funding Information: Manuscript received May 21, 2000. The associate editor coordinating the review of this letter and approving it for publication was Prof. D. Petr. This work was supported by the New York State Center for Advanced Technology in Telecommunications (CATT), Polytechnic University, Brooklyn, NY. This work was presented at the 33rd Conference on Information Science and Systems, March 1999.

PY - 2002/4

Y1 - 2002/4

N2 - In this letter we study the problem of the optimal design of buffer management policies within the class of pushout and expelling policies for a shared memory asynchronous transfer mode (ATM) switch or demultiplexer fed by traffic containing two different space priorities. A numerical study of the optimal policies for small buffer sizes is used to help design heuristics applicable to large buffer sizes. Simulation studies for large buffer systems are then presented.

AB - In this letter we study the problem of the optimal design of buffer management policies within the class of pushout and expelling policies for a shared memory asynchronous transfer mode (ATM) switch or demultiplexer fed by traffic containing two different space priorities. A numerical study of the optimal policies for small buffer sizes is used to help design heuristics applicable to large buffer sizes. Simulation studies for large buffer systems are then presented.

KW - ATM

KW - Buffer management

KW - Markov decision theory

KW - Sample path techniques

KW - Shared memory switch

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

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

U2 - 10.1109/4234.996047

DO - 10.1109/4234.996047

M3 - Article

AN - SCOPUS:0036529228

SN - 1089-7798

VL - 6

SP - 162

EP - 164

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 4

ER -

Efficient buffer sharing in shared memory ATM systems with space priority traffic

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this