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.
|出版ステータス||Published - 2014 1 1|
|イベント||2014 International Conference on Computing, Networking and Communications, ICNC 2014 - Honolulu, HI, United States|
継続期間: 2014 2 3 → 2014 2 6
|Other||2014 International Conference on Computing, Networking and Communications, ICNC 2014|
|Period||14/2/3 → 14/2/6|
ASJC Scopus subject areas
- コンピュータ ネットワークおよび通信