IEICE TRANSACTIONS on Communications
Analysis of a Partial Buffer Sharing Scheme for a Finite Buffer with Batch Poisson Inputs
Summary :
A partial buffer sharing scheme is proposed as loss-priority control for a finite buffer with batch inputs. A partial batch acceptance strategy is used for a batch arriving at a finite buffer. Customer loss probabilities for high- and low-priority customers are derived under this batch acceptance strategy, using a supplementary variable method that is a standard tool for queueing analysis. A comparison of the partial buffer sharing scheme and a system without loss-priority control is made in terms of admissible offered load.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.11 pp.2110-2120
- Publication Date
- 1998/11/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Communication Networks and Services
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Shuichi SUMITA, "Analysis of a Partial Buffer Sharing Scheme for a Finite Buffer with Batch Poisson Inputs" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 11, pp. 2110-2120, November 1998, doi: .
Abstract: A partial buffer sharing scheme is proposed as loss-priority control for a finite buffer with batch inputs. A partial batch acceptance strategy is used for a batch arriving at a finite buffer. Customer loss probabilities for high- and low-priority customers are derived under this batch acceptance strategy, using a supplementary variable method that is a standard tool for queueing analysis. A comparison of the partial buffer sharing scheme and a system without loss-priority control is made in terms of admissible offered load.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_11_2110/_p
Copy
@ARTICLE{e81-b_11_2110,
author={Shuichi SUMITA, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of a Partial Buffer Sharing Scheme for a Finite Buffer with Batch Poisson Inputs},
year={1998},
volume={E81-B},
number={11},
pages={2110-2120},
abstract={A partial buffer sharing scheme is proposed as loss-priority control for a finite buffer with batch inputs. A partial batch acceptance strategy is used for a batch arriving at a finite buffer. Customer loss probabilities for high- and low-priority customers are derived under this batch acceptance strategy, using a supplementary variable method that is a standard tool for queueing analysis. A comparison of the partial buffer sharing scheme and a system without loss-priority control is made in terms of admissible offered load.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - Analysis of a Partial Buffer Sharing Scheme for a Finite Buffer with Batch Poisson Inputs
T2 - IEICE TRANSACTIONS on Communications
SP - 2110
EP - 2120
AU - Shuichi SUMITA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 1998
AB - A partial buffer sharing scheme is proposed as loss-priority control for a finite buffer with batch inputs. A partial batch acceptance strategy is used for a batch arriving at a finite buffer. Customer loss probabilities for high- and low-priority customers are derived under this batch acceptance strategy, using a supplementary variable method that is a standard tool for queueing analysis. A comparison of the partial buffer sharing scheme and a system without loss-priority control is made in terms of admissible offered load.
ER -
English
