移交
计算机科学
呼叫准入控制
服务质量
计算机网络
马尔可夫链
概率逻辑
期限(时间)
蜂窝网络
连续时间马尔可夫链
马尔可夫模型
电信
无线
无线网络
人工智能
物理
平衡方程
量子力学
机器学习
作者
Sana Younès,Maroua Idi,Riadh Robbana
标识
DOI:10.1080/03081079.2023.2270138
摘要
Two important Quality-of-Service (QoS) measures for cellular networks are the fractions of New Calls (NCs) and Handoff Calls (HCs). These types of calls are usually blocked or dropped for two reasons: radio channels are occupied (performance reason) or failure of radio channels (availability reason). Call Admission Control (CAC) is a technique that accepts or rejects user requests in a network. This paper proposes two new CAC schemes for Long Term Evolution (LTE) networks supporting two classes of services (Real-Time (RT) and Non-Real-Time (NRT)). The proposed CAC schemes are composites, meaning that they consider performance changes associated with the failure and recovery of radio channels. We use the Probabilistic Model Checking (PMC) to perform a comparative analysis between the performability measures (combination of performance and availability measures) of the proposed composite CAC schemes and an existing pure performance model. First, we model the composite CAC schemes with multidimensional Continuous Time Markov Chain (CTMC). Then, we specify QoS requirements through the CTMC using the Continuous-time Stochastic Logic (CSL). Finally, we quantify the performability measures of the composite CAC schemes by checking CSL steady-state, transient, and path formulas using the PRISM model checker.
科研通智能强力驱动
Strongly Powered by AbleSci AI