Call admission control considering both cooperative users and selfish users

点击翻译按钮获取中文摘要

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