Optimal threshold configuration methods for flow admission control with cooperative users

Sumiko Miyata, Katsunori Yamaoka, Hirotsugu Kinoshita

研究成果: Article査読

6 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)2706-2719
ページ数14
ジャーナルIEICE Transactions on Communications
E97B
12
DOI
出版ステータスPublished - 2014 12 1
外部発表はい

ASJC Scopus subject areas

  • 電子工学および電気工学
  • コンピュータ ネットワークおよび通信
  • ソフトウェア

フィンガープリント

「Optimal threshold configuration methods for flow admission control with cooperative users」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル