Three types of calls admission control methods considering seek‐bar operation

Abstract

AbstractMany network devices, such as a smartphones and tablets, and streaming services, such as YouTube and Netflix, have become widespread. This causes network‐bandwidth congestion, so users require stable and consistent communication quality. Call admission control (CAC) has been proposed to solve these bandwidth resource problems. Some CACs have been proposed in order to maintain QoS. However, these CAC does not assume user behaviour. If CAC assumes some user behaviour, optimal control parameter derived conventional CAC may change because traffic load change by considering user behaviour. This article assumes that arriving types of flows are of three types: narrowband flows, broadband flow without seek‐bar operation, and broadband flows with seek‐bar operation. Under this assumpution, two CAC methods with single threshold or two thresholds are proposed. With these methods, it is assumed that all arriving flows result in the same user satisfaction when accommodated in a network. Under this assumption, the maximum of each user satisfaction is the same as the maximum number of accommodated flows. Using the call loss probability characteristics of Method 1, the objective function in Method 2 is modified. By using the modified objective function, CAC can be realised while properly accommodating broadband users who have been excessively rejected.