Three types of calls admission control methods considering seek‐bar operation
Abstract Many 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 sol...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-07-01
|
| Series: | IET Communications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cmu2.12631 |
| _version_ | 1797290309740134400 |
|---|---|
| author | Sumiko Miyata Keisuke Ode |
| author_facet | Sumiko Miyata Keisuke Ode |
| author_sort | Sumiko Miyata |
| collection | DOAJ |
| description | Abstract Many 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. |
| first_indexed | 2024-03-07T19:20:35Z |
| format | Article |
| id | doaj.art-0144002a7e84474598027f4f00ce5b7c |
| institution | Directory Open Access Journal |
| issn | 1751-8628 1751-8636 |
| language | English |
| last_indexed | 2024-03-07T19:20:35Z |
| publishDate | 2023-07-01 |
| publisher | Wiley |
| record_format | Article |
| series | IET Communications |
| spelling | doaj.art-0144002a7e84474598027f4f00ce5b7c2024-02-29T11:20:44ZengWileyIET Communications1751-86281751-86362023-07-0117121394140810.1049/cmu2.12631Three types of calls admission control methods considering seek‐bar operationSumiko Miyata0Keisuke Ode1Shibaura Institute of Technology Tokyo JapanShibaura Institute of Technology Tokyo JapanAbstract Many 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.https://doi.org/10.1049/cmu2.12631call admission controlseek‐bar operationuser behaviourQoS |
| spellingShingle | Sumiko Miyata Keisuke Ode Three types of calls admission control methods considering seek‐bar operation IET Communications call admission control seek‐bar operation user behaviour QoS |
| title | Three types of calls admission control methods considering seek‐bar operation |
| title_full | Three types of calls admission control methods considering seek‐bar operation |
| title_fullStr | Three types of calls admission control methods considering seek‐bar operation |
| title_full_unstemmed | Three types of calls admission control methods considering seek‐bar operation |
| title_short | Three types of calls admission control methods considering seek‐bar operation |
| title_sort | three types of calls admission control methods considering seek bar operation |
| topic | call admission control seek‐bar operation user behaviour QoS |
| url | https://doi.org/10.1049/cmu2.12631 |
| work_keys_str_mv | AT sumikomiyata threetypesofcallsadmissioncontrolmethodsconsideringseekbaroperation AT keisukeode threetypesofcallsadmissioncontrolmethodsconsideringseekbaroperation |