Optimal threshold configuration methods for flow admission control with cooperative users

Sumiko Miyata, Katsunori Yamaoka, Hirotsugu Kinoshita

Research output: Contribution to journalArticle

2 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)2706-2719
Number of pages14
JournalIEICE Transactions on Communications
VolumeE97B
Issue number12
DOIs
Publication statusPublished - 2014 Dec 1
Externally publishedYes

Fingerprint

Congestion control (communication)
Access control
Queueing theory
Numerical analysis
Quality of service
Bandwidth

Keywords

  • Call admission control
  • Equality
  • QoS
  • Queueing theory
  • Total call-blocking rate
  • Trunk reservation control

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Optimal threshold configuration methods for flow admission control with cooperative users. / Miyata, Sumiko; Yamaoka, Katsunori; Kinoshita, Hirotsugu.

In: IEICE Transactions on Communications, Vol. E97B, No. 12, 01.12.2014, p. 2706-2719.

Research output: Contribution to journalArticle

Miyata, Sumiko ; Yamaoka, Katsunori ; Kinoshita, Hirotsugu. / Optimal threshold configuration methods for flow admission control with cooperative users. In: IEICE Transactions on Communications. 2014 ; Vol. E97B, No. 12. pp. 2706-2719.
@article{4d8e4d916607439390afbbe99749c083,
title = "Optimal threshold configuration methods for flow admission control with cooperative users",
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{\`e}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 = "Call admission control, Equality, QoS, Queueing theory, Total call-blocking rate, Trunk reservation control",
author = "Sumiko Miyata and Katsunori Yamaoka and Hirotsugu Kinoshita",
year = "2014",
month = "12",
day = "1",
doi = "10.1587/transcom.E97.B.2706",
language = "English",
volume = "E97B",
pages = "2706--2719",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Optimal threshold configuration methods for flow admission control with cooperative users

AU - Miyata, Sumiko

AU - Yamaoka, Katsunori

AU - Kinoshita, Hirotsugu

PY - 2014/12/1

Y1 - 2014/12/1

N2 - 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.

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.

KW - Call admission control

KW - Equality

KW - QoS

KW - Queueing theory

KW - Total call-blocking rate

KW - Trunk reservation control

UR - http://www.scopus.com/inward/record.url?scp=84924404981&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84924404981&partnerID=8YFLogxK

U2 - 10.1587/transcom.E97.B.2706

DO - 10.1587/transcom.E97.B.2706

M3 - Article

AN - SCOPUS:84924404981

VL - E97B

SP - 2706

EP - 2719

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 12

ER -