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

Rajarshi Roy, Shivendra Panwar

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)162-164
Number of pages3
JournalIEEE Communications Letters
Volume6
Issue number4
DOIs
StatePublished - Apr 2002

Fingerprint

Asynchronous transfer mode
Shared Memory
Buffer
Sharing
Switches
Traffic
Data storage equipment
Buffer Management
Optimal Policy
Numerical Study
Switch
Simulation Study
Heuristics
Optimal design
Policy

Keywords

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

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Efficient buffer sharing in shared memory ATM systems with space priority traffic. / Roy, Rajarshi; Panwar, Shivendra.

In: IEEE Communications Letters, Vol. 6, No. 4, 04.2002, p. 162-164.

Research output: Contribution to journalArticle

@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 Shivendra Panwar",
year = "2002",
month = "4",
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

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

VL - 6

SP - 162

EP - 164

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 4

ER -