QoS Guaranteed Call Admission Control with Opportunistic Scheduling
QoS Guaranteed Call Admission Control with Opportunistic Scheduling
复制标题
DOI：
10.1109/glocom.2011.6133534
复制
发表时间：
2011-12
期刊：
影响因子：
--
通讯作者：
Hao Wang;Lianghui Ding;Zhiwen Pan;Nan Liu;X. You
中科院分区：
文献类型：
--
作者：
Hao Wang;Lianghui Ding;Zhiwen Pan;Nan Liu;X. You
在本文中，我们研究了呼叫接纳控制（CAC）与机会调度，并提出了一种新的CAC算法的用户服务质量（QoS）的要求。我们的主要贡献有三个方面。首先，我们验证了，与其他几种调度方案相比，累积分布式基于功能的调度（CS），使最好的效率和公平性之间的权衡在满载情况下，利用最好的机会主义与绝对公平的资源分配。然后推导并验证了CS的多用户分集增益，它决定了CS的长期平均性能，并在CAC算法设计中用于估计资源占用。在此基础上，利用机会轮循（ORR）方法计算了CS的统计性能下界，提出了基于CS/ORR的CAC（COCAC）算法，该算法保证了新接入用户和现有用户的异构最小速率需求（MRR）。最后，我们通过仿真评估所提出的COCAC算法的性能。结果表明，COCAC能显著降低新呼叫阻塞率，有效利用系统资源，并严格保证所有用户的MRR。
In this paper, we investigate call admission control (CAC) with opportunistic scheduling and propose a novel CAC algorithm for users with quality of service (QoS) requirements. Our main contribution is threefold. First, we verify that, compared with several other scheduling schemes, cumulative distributed function based scheduling (CS) makes the best tradeoff between efficiency and fairness in full-load scenario and exploits the best opportunism with absolutely fair resource allocation. Then we deduce and validate the multi-user diversity gain (MDG) of CS, which determines its long-term average performance and is used for estimation of resource occupation in CAC algorithm design. After that, we use opportunistic round robin (ORR) method to calculate the statistical low performance bound of CS, and propose CS/ORR based CAC (COCAC) algorithm, which guarantees the heterogeneous minimum rate requirement (MRRs) of both new access users and existing ones. Finally, we evaluate the performance of the proposed COCAC algorithm via simulation. Results show that COCAC can significantly reduce new call block probability, effectively make use of system resources, as well as strictly guarantee all users' MRRs.