Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system)

Sumiko Miyata, Katsunori Yamaoka, Hirotsugu Kinoshita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We have proposed a method of call admission control (CAC) to maximize total user satisfaction in a heterogeneous traffic network and discussed its effectiveness by using an optimal-threshold from numerical analyses. This CAC method assumed that there would only be selfish users in a network. However, we need to consider the possibility that there will be some cooperative users who agree to reduce their requested bandwidth to improve another user's QoS. Thus, the CAC may not be optimal if there are cooperative users in the network. In this paper, we propose a method of CAC that is designed to take into account cooperative users by using queueing theory. Moreover, we show the characteristics of an optimal threshold when the ratio of cooperative users varies.

Original languageEnglish
Title of host publication2014 International Conference on Computing, Networking and Communications, ICNC 2014
PublisherIEEE Computer Society
Pages105-111
Number of pages7
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event2014 International Conference on Computing, Networking and Communications, ICNC 2014 - Honolulu, HI, United States
Duration: 2014 Feb 32014 Feb 6

Other

Other2014 International Conference on Computing, Networking and Communications, ICNC 2014
CountryUnited States
CityHonolulu, HI
Period14/2/314/2/6

Fingerprint

Congestion control (communication)
Queueing theory
Quality of service
Bandwidth

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Miyata, S., Yamaoka, K., & Kinoshita, H. (2014). Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system). In 2014 International Conference on Computing, Networking and Communications, ICNC 2014 (pp. 105-111). [6785314] IEEE Computer Society. https://doi.org/10.1109/ICCNC.2014.6785314

Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system). / Miyata, Sumiko; Yamaoka, Katsunori; Kinoshita, Hirotsugu.

2014 International Conference on Computing, Networking and Communications, ICNC 2014. IEEE Computer Society, 2014. p. 105-111 6785314.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Miyata, S, Yamaoka, K & Kinoshita, H 2014, Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system). in 2014 International Conference on Computing, Networking and Communications, ICNC 2014., 6785314, IEEE Computer Society, pp. 105-111, 2014 International Conference on Computing, Networking and Communications, ICNC 2014, Honolulu, HI, United States, 14/2/3. https://doi.org/10.1109/ICCNC.2014.6785314
Miyata S, Yamaoka K, Kinoshita H. Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system). In 2014 International Conference on Computing, Networking and Communications, ICNC 2014. IEEE Computer Society. 2014. p. 105-111. 6785314 https://doi.org/10.1109/ICCNC.2014.6785314
Miyata, Sumiko ; Yamaoka, Katsunori ; Kinoshita, Hirotsugu. / Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system). 2014 International Conference on Computing, Networking and Communications, ICNC 2014. IEEE Computer Society, 2014. pp. 105-111
@inproceedings{bc4628af5d6f42418ffa8762e80985c6,
title = "Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system)",
abstract = "We have proposed a method of call admission control (CAC) to maximize total user satisfaction in a heterogeneous traffic network and discussed its effectiveness by using an optimal-threshold from numerical analyses. This CAC method assumed that there would only be selfish users in a network. However, we need to consider the possibility that there will be some cooperative users who agree to reduce their requested bandwidth to improve another user's QoS. Thus, the CAC may not be optimal if there are cooperative users in the network. In this paper, we propose a method of CAC that is designed to take into account cooperative users by using queueing theory. Moreover, we show the characteristics of an optimal threshold when the ratio of cooperative users varies.",
author = "Sumiko Miyata and Katsunori Yamaoka and Hirotsugu Kinoshita",
year = "2014",
doi = "10.1109/ICCNC.2014.6785314",
language = "English",
pages = "105--111",
booktitle = "2014 International Conference on Computing, Networking and Communications, ICNC 2014",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Optimal threshold configuration with equality based call admission control with cooperative users (mixed loss and delay system)

AU - Miyata, Sumiko

AU - Yamaoka, Katsunori

AU - Kinoshita, Hirotsugu

PY - 2014

Y1 - 2014

N2 - We have proposed a method of call admission control (CAC) to maximize total user satisfaction in a heterogeneous traffic network and discussed its effectiveness by using an optimal-threshold from numerical analyses. This CAC method assumed that there would only be selfish users in a network. However, we need to consider the possibility that there will be some cooperative users who agree to reduce their requested bandwidth to improve another user's QoS. Thus, the CAC may not be optimal if there are cooperative users in the network. In this paper, we propose a method of CAC that is designed to take into account cooperative users by using queueing theory. Moreover, we show the characteristics of an optimal threshold when the ratio of cooperative users varies.

AB - We have proposed a method of call admission control (CAC) to maximize total user satisfaction in a heterogeneous traffic network and discussed its effectiveness by using an optimal-threshold from numerical analyses. This CAC method assumed that there would only be selfish users in a network. However, we need to consider the possibility that there will be some cooperative users who agree to reduce their requested bandwidth to improve another user's QoS. Thus, the CAC may not be optimal if there are cooperative users in the network. In this paper, we propose a method of CAC that is designed to take into account cooperative users by using queueing theory. Moreover, we show the characteristics of an optimal threshold when the ratio of cooperative users varies.

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

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

U2 - 10.1109/ICCNC.2014.6785314

DO - 10.1109/ICCNC.2014.6785314

M3 - Conference contribution

SP - 105

EP - 111

BT - 2014 International Conference on Computing, Networking and Communications, ICNC 2014

PB - IEEE Computer Society

ER -