Optimal Threshold Configuration Methods for Flow Admission Control with Cooperative Users
Summary :
We have proposed a novel call admission control (CAC) method for maximizing total user satisfaction in a heterogeneous traffic network and showed their effectiveness by using the optimal threshold from numerical analysis [1],[2]. With these CAC methods, it is assumed that only selfish users exist in a network. However, we need to consider the possibility that some cooperative users exist who would agree to reduce their requested bandwidth to improve another user's Quality of Service (QoS). Under this assumption, conventional CAC may not be optimal. If there are cooperative users in the network, we need control methods that encourage such user cooperation. However, such “encourage” control methods have not yet been proposed. Therefore, in this paper, we propose novel CAC methods for cooperative users by using queueing theory. Numerical analyses show their effectiveness. We also analyze the characteristics of the optimal control parameter of the threshold.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E97-B No.12 pp.2706-2719
- Publication Date
- 2014/12/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E97.B.2706
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Sumiko MIYATA
Kanagawa University
Katsunori YAMAOKA
Tokyo Institute of Technology
Hirotsugu KINOSHITA
Kanagawa University
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
Sumiko MIYATA, Katsunori YAMAOKA, Hirotsugu KINOSHITA, "Optimal Threshold Configuration Methods for Flow Admission Control with Cooperative Users" in IEICE TRANSACTIONS on Communications,
vol. E97-B, no. 12, pp. 2706-2719, December 2014, doi: 10.1587/transcom.E97.B.2706.
Abstract: We have proposed a novel call admission control (CAC) method for maximizing total user satisfaction in a heterogeneous traffic network and showed their effectiveness by using the optimal threshold from numerical analysis [1],[2]. With these CAC methods, it is assumed that only selfish users exist in a network. However, we need to consider the possibility that some cooperative users exist who would agree to reduce their requested bandwidth to improve another user's Quality of Service (QoS). Under this assumption, conventional CAC may not be optimal. If there are cooperative users in the network, we need control methods that encourage such user cooperation. However, such “encourage” control methods have not yet been proposed. Therefore, in this paper, we propose novel CAC methods for cooperative users by using queueing theory. Numerical analyses show their effectiveness. We also analyze the characteristics of the optimal control parameter of the threshold.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E97.B.2706/_p
Copy
@ARTICLE{e97-b_12_2706,
author={Sumiko MIYATA, Katsunori YAMAOKA, Hirotsugu KINOSHITA, },
journal={IEICE TRANSACTIONS on Communications},
title={Optimal Threshold Configuration Methods for Flow Admission Control with Cooperative Users},
year={2014},
volume={E97-B},
number={12},
pages={2706-2719},
abstract={We have proposed a novel call admission control (CAC) method for maximizing total user satisfaction in a heterogeneous traffic network and showed their effectiveness by using the optimal threshold from numerical analysis [1],[2]. With these CAC methods, it is assumed that only selfish users exist in a network. However, we need to consider the possibility that some cooperative users exist who would agree to reduce their requested bandwidth to improve another user's Quality of Service (QoS). Under this assumption, conventional CAC may not be optimal. If there are cooperative users in the network, we need control methods that encourage such user cooperation. However, such “encourage” control methods have not yet been proposed. Therefore, in this paper, we propose novel CAC methods for cooperative users by using queueing theory. Numerical analyses show their effectiveness. We also analyze the characteristics of the optimal control parameter of the threshold.},
keywords={},
doi={10.1587/transcom.E97.B.2706},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Optimal Threshold Configuration Methods for Flow Admission Control with Cooperative Users
T2 - IEICE TRANSACTIONS on Communications
SP - 2706
EP - 2719
AU - Sumiko MIYATA
AU - Katsunori YAMAOKA
AU - Hirotsugu KINOSHITA
PY - 2014
DO - 10.1587/transcom.E97.B.2706
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E97-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2014
AB - We have proposed a novel call admission control (CAC) method for maximizing total user satisfaction in a heterogeneous traffic network and showed their effectiveness by using the optimal threshold from numerical analysis [1],[2]. With these CAC methods, it is assumed that only selfish users exist in a network. However, we need to consider the possibility that some cooperative users exist who would agree to reduce their requested bandwidth to improve another user's Quality of Service (QoS). Under this assumption, conventional CAC may not be optimal. If there are cooperative users in the network, we need control methods that encourage such user cooperation. However, such “encourage” control methods have not yet been proposed. Therefore, in this paper, we propose novel CAC methods for cooperative users by using queueing theory. Numerical analyses show their effectiveness. We also analyze the characteristics of the optimal control parameter of the threshold.
ER -
English
