IEICE TRANSACTIONS on Communications
A Backlog Evaluation Formula for Admission Control Based on the Stochastic Network Calculus with Many Flows
Summary :
Admission control is a procedure to guarantee a given level of Quality of Service (QoS) by accepting or rejecting arrival connection requests. There are many studies on backlog or loss rate evaluation formulas for admission control at a single node. However, there are few studies on end-to-end evaluation formulas suitable for admission control. In a previous paper, the authors proposed a new stochastic network calculus for many flows using an approach taken from large deviations techniques and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. In this paper, we apply this stochastic network calculus to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtain a simple evaluation formula for the end-to-end backlog. In this formula, the end-to-end backlog can be evaluated by the traffic load at the bottle neck node. This result leads us to a natural extension of the evaluation formula for a single node.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.5 pp.1288-1294
- Publication Date
- 2011/05/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.1288
- Type of Manuscript
- PAPER
- Category
- Fundamental Theories for Communications
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
Kazutomo KOBAYASHI, Yukio TAKAHASHI, Hiroyuki TAKADA, "A Backlog Evaluation Formula for Admission Control Based on the Stochastic Network Calculus with Many Flows" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 5, pp. 1288-1294, May 2011, doi: 10.1587/transcom.E94.B.1288.
Abstract: Admission control is a procedure to guarantee a given level of Quality of Service (QoS) by accepting or rejecting arrival connection requests. There are many studies on backlog or loss rate evaluation formulas for admission control at a single node. However, there are few studies on end-to-end evaluation formulas suitable for admission control. In a previous paper, the authors proposed a new stochastic network calculus for many flows using an approach taken from large deviations techniques and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. In this paper, we apply this stochastic network calculus to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtain a simple evaluation formula for the end-to-end backlog. In this formula, the end-to-end backlog can be evaluated by the traffic load at the bottle neck node. This result leads us to a natural extension of the evaluation formula for a single node.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.1288/_p
Copy
@ARTICLE{e94-b_5_1288,
author={Kazutomo KOBAYASHI, Yukio TAKAHASHI, Hiroyuki TAKADA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Backlog Evaluation Formula for Admission Control Based on the Stochastic Network Calculus with Many Flows},
year={2011},
volume={E94-B},
number={5},
pages={1288-1294},
abstract={Admission control is a procedure to guarantee a given level of Quality of Service (QoS) by accepting or rejecting arrival connection requests. There are many studies on backlog or loss rate evaluation formulas for admission control at a single node. However, there are few studies on end-to-end evaluation formulas suitable for admission control. In a previous paper, the authors proposed a new stochastic network calculus for many flows using an approach taken from large deviations techniques and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. In this paper, we apply this stochastic network calculus to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtain a simple evaluation formula for the end-to-end backlog. In this formula, the end-to-end backlog can be evaluated by the traffic load at the bottle neck node. This result leads us to a natural extension of the evaluation formula for a single node.},
keywords={},
doi={10.1587/transcom.E94.B.1288},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - A Backlog Evaluation Formula for Admission Control Based on the Stochastic Network Calculus with Many Flows
T2 - IEICE TRANSACTIONS on Communications
SP - 1288
EP - 1294
AU - Kazutomo KOBAYASHI
AU - Yukio TAKAHASHI
AU - Hiroyuki TAKADA
PY - 2011
DO - 10.1587/transcom.E94.B.1288
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2011
AB - Admission control is a procedure to guarantee a given level of Quality of Service (QoS) by accepting or rejecting arrival connection requests. There are many studies on backlog or loss rate evaluation formulas for admission control at a single node. However, there are few studies on end-to-end evaluation formulas suitable for admission control. In a previous paper, the authors proposed a new stochastic network calculus for many flows using an approach taken from large deviations techniques and obtained asymptotic end-to-end evaluation formulas for output burstiness and backlog. In this paper, we apply this stochastic network calculus to a heterogeneous tandem network with many forwarding flows and cross traffic flows constrained by leaky buckets, and obtain a simple evaluation formula for the end-to-end backlog. In this formula, the end-to-end backlog can be evaluated by the traffic load at the bottle neck node. This result leads us to a natural extension of the evaluation formula for a single node.
ER -
English
