IEICE TRANSACTIONS on Communications
A Robust Connection Admission Control Applicable to Long Range Dependence Traffic
Summary :
In this paper an algorithm of Connection Admission Control in ATM is considered. It is shown that it works under many different kinds of dependence among arrivals, including long range dependence. This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence. An upper bound for CLR is given, without assuming any specific cell arrival process. Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered. They show the goodness and the tightness of the considered upper bound.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E81-B No.5 pp.849-857
- Publication Date
- 1998/05/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on ATM Traffic Control and Performance Evaluation)
- Category
- Long Range Dependence Traffic
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
Pier Luigi CONTI, Hiroshi SAITO, Livia DE GIOVANNI, "A Robust Connection Admission Control Applicable to Long Range Dependence Traffic" in IEICE TRANSACTIONS on Communications,
vol. E81-B, no. 5, pp. 849-857, May 1998, doi: .
Abstract: In this paper an algorithm of Connection Admission Control in ATM is considered. It is shown that it works under many different kinds of dependence among arrivals, including long range dependence. This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence. An upper bound for CLR is given, without assuming any specific cell arrival process. Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered. They show the goodness and the tightness of the considered upper bound.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e81-b_5_849/_p
Copy
@ARTICLE{e81-b_5_849,
author={Pier Luigi CONTI, Hiroshi SAITO, Livia DE GIOVANNI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Robust Connection Admission Control Applicable to Long Range Dependence Traffic},
year={1998},
volume={E81-B},
number={5},
pages={849-857},
abstract={In this paper an algorithm of Connection Admission Control in ATM is considered. It is shown that it works under many different kinds of dependence among arrivals, including long range dependence. This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence. An upper bound for CLR is given, without assuming any specific cell arrival process. Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered. They show the goodness and the tightness of the considered upper bound.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - A Robust Connection Admission Control Applicable to Long Range Dependence Traffic
T2 - IEICE TRANSACTIONS on Communications
SP - 849
EP - 857
AU - Pier Luigi CONTI
AU - Hiroshi SAITO
AU - Livia DE GIOVANNI
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 1998
AB - In this paper an algorithm of Connection Admission Control in ATM is considered. It is shown that it works under many different kinds of dependence among arrivals, including long range dependence. This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence. An upper bound for CLR is given, without assuming any specific cell arrival process. Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered. They show the goodness and the tightness of the considered upper bound.
ER -
English
