卫星通信系统多优先级信道预留分配策略

随着通信系统的不断发展,对融合地面系统的天地一体化网络的研究越来越多,而卫星通信系统中,由于卫星高速移动等特性,不可避免需要对呼叫的接入切换进行研究。针对天地一体化信息网络需要支持多场景多业务情况下的通信需求,考虑不同呼叫优先级不同,对多优先级的多种呼叫业务进行考虑。根据信道预留的思想,对不同优先级接入与切换呼叫设定不同的可用信道数,优先级越高的呼叫,为其留更多的可用信道以确保其接入信道成功。同时,由于动态信道预留较固定信道预留能够更好地利用信道资源,最终考虑多优先级下的动态信道预留策略。对多优先级动态信道预留与多优先级固定信道预留策略进行仿真验证,发现动态预留方案得到的系统服务质量更好。对于单一策略,发现优先级越高的用户接入与切换呼叫接入信道失败率更低。     

一种新的CDMA系统多业务接入控制算法

文中提出一种新的CDMA系统中多业务接入控制算法。为了提高系统容量,在传统容量干扰受限的CDMA系统接入控制算法的基础上,考虑各种业务的激活因子,计算出系统接入呼叫用户后各个业务的中断概率,根据其中断概率是否满足QoS要求判断业务是否接入。仿真结果表明：所提算法的各种业务的阻塞概率明显低于传统算法,并且系统获得的性能改善随着桌些业务呼叫强度的增加而下降,从而证明了所提算法在系统容量上的优势。     

多业务蜂窝移动通信系统中发起呼叫排队的理论分析及其对切换 …

分析了切换优先级算法发起呼叫排队的可行性和具体算法流程,并比较了使用发起呼叫以排队前后的切换算法的性能改善。一般的文献里都没有对始发呼叫加以排队。但实际上用户为了接通一个呼叫总是会等待一段时间,这就给了始发呼叫排队的可能。提出了一种符合实际的丢失呼叫限制等待（ＬＣＬＷ）模型,给出了它的流程图并将其应用到混合切换优先级算法中,最后分析了在多业务蜂窝系统中发起呼叫排队对切换指标的性能改善,并加以模拟。     

基于多优先级时延预留的接入控制机制

该文提出一种多优先级时延预留的呼叫接入控制机制,通过对不同的优先级业务采用不同的时延门限来控制业务的接入来保证网络服务质量(QoS)。仿真结果表明,该机制不但较好地提供了对高优先级业务的服务率,也保证了对低优先级业务的服务,同时网络利用率也相应得到了提高。     

CDMA分层小区结构系统中基于干扰门限的呼叫接入控制策略

本文提出了一种分层小区结构系统中的呼叫接入控制策略,系统根据当前本小区和周围小区的干扰情况实时地对呼叫请求作相应控制,考虑了实时语音和非实时数据两种典型业务,为切换呼叫设置了高于新呼叫的优先级,并对暂时得不到资源的切换呼叫(包括语音和数据业务)进行排队处理,有效地降低了系统的切换掉话率.     

CDMA分层小区结构系统中基于干扰门限的呼叫接人控制策略

本文提出了一种分层小区结构系统中的呼叫接入控制策略，系统根据当前本小区和周围小区的干扰情况实时地对呼叫请求作相应控制，考虑了实时语音和非实时数据两种典型业务，为切换呼叫设置了高于新呼叫的优先级，并对暂时得不到资源的切换呼叫（包括语音和数据业务）进行排队处理，有效地降低了系统的切换掉话率。     

一种基于CoMP的随机接入方案

提出了一种新的基于协作多点传输和接收（CoMP）技术的多发随机接入流程,并根据 随机接入的目的和业务类型设计了接入优先级,在此基础上设计了一种新的随机接入方案, 对 不同类型的随机接入请求提供不同的接入机制,以保证边缘用户的接入性能和满足不同业务 的QoS需求。仿真结果表明,与LTE标准随机接入方案相比,该方案对系统整体接入性能略有 提高,且大大提高了边缘高优先级用户的接入性能。     

IEEE 802．11网络分析模型

IEEE 802.11在MAC层采用DCF作为主要的信道接入方式。本文分析了现有的几种802.11网络分析模型,其中B ianch i模型很好的描述了饱和状态下802.11 DCF的性能;X iao模型针对802.11e进行了多优先级的扩展,实现了EDCF的性能分析。最后介绍了一种新的分析模型,新模型同时考虑了业务优先级和内部调度算法,够较准确地描述网络性能。     

避免轻载惩罚支持多业务的EPON动态带宽分配

为了支持语音、视频和数据等多业务接入,以太网无源光网络(EPON)动态带宽分配算法需要保证不同业务的优先级以提供不同的服务质量(QoS)、减小实时业务时间延迟,这会带来轻载惩罚问题.针对该问题,文章提出一种基于多队列带宽分配方案,即光网络单元为不同优先级的业务分别申请带宽并引入预测机制.给出了具体算法并进行了算法仿真.仿真结果表明,该方案不仅能支持语音、视频和数据等多业务接入,还能从根本上避免轻载惩罚,通过预测可以进一步提高高优先级业务的QoS.     

LEO卫星网络中基于门限的切换优先资源管理机制

本文针对低轨道(Low Earth Orbit,LEO)卫星网络提出了一种基于门限的切换优先(Threshold-based Handover Prioritization,TBHP)资源管理算法,通过推迟信道锁定的时间来提高资源预留的精度,在保持高优先级用户强制中断概率极小的条件下改善网络用户的新呼叫阻塞概率,从而获得较高的系统无线资源利用率.建立了该算法的理论分析模型,确定了系统参数、业务条件与协议的工作参数之间的量化关系.仿真结果表明,TBHP算法在保留了经典GH算法保证高优先级用户切换过程的优点的同时,增大了系统允许接入新呼叫的概率,从而进一步提高了系统的资源利用率.     

异构无线网络中基于业务转移和接入控制的混合负载均衡

 针对现有异构无线网络负载均衡方法未能综合考虑重载网络业务转移和新业务接入控制的问题,提出了一种混合负载均衡算法.该算法首先根据各小区负载水平和终端移动性,将重载小区的适量业务向重叠覆盖的轻载小区转移;其次通过资源预留和强占优先的接入控制策略,为不同优先级的新到业务提供有差别的服务.仿真结果表明,本文算法在保证系统资源利用率的同时,保障了实时与非实时业务的QoS,并相对于参考算法有效降低了系统阻塞率和业务切换概率.     

Fairly adjusted multimode dynamic guard bandwidth admission control over CDMA systems

Guard-based call admission control schemes support admission priorities based on resources sharing with differentiated resource capacity limits. To minimize deviation from call blocking/dropping targets due to nonstationary call arrival condition, dynamic guard-based schemes with predictive adaptation control adjust differentiated capacity limits according to predicted future arrival rates based on specified estimation algorithms. Existing dynamic guard admission schemes are developed under the assumption of perfect estimation, which may not be possible in a highly nonstationary environment and, thus resulting in failures to maintain targeted blocking/dropping probabilities. This paper presents the fairly adjusted multimode-dynamic guard bandwidth scheme, which is a dynamic-guard-based scheme over code-division multiple-access systems with predictive adaptation control to adapt interference-based guard loading-limits under nonstationary call arrival condition; and reactive adaptation control to counteract arrival rate estimation errors. When the predictive adaptation control policy mode is not able to maintain long-term call blocking or dropping targets due to estimation error, this will trigger reactive adaptation control policy modes that include temporary blocking (preemption) of one or more lower priority classes subject to fairness constraints to ensure lower priority classes are not preempted at all costs during estimation error recovery. Analytical and simulation results show that proposed scheme is able to provide performance guarantees in terms of dropping probabilities under nonstationary traffic arrival and imperfect arrival rate estimation.     

基于优先级的IEEE 802.16中VoIP弹性接纳控制算法

通过分析IEEE 802.16关于VoIP(voice over IP)的传输规范和服务质量保证机制,指出了区分VoIP的优先级和VoIP要求弹性QoS的性质对VoIP接纳控制有着极其重要的意义,提出了VoIP接纳控制的弹性准则和优先级准则。在运用有效带宽理论确定了VoIP传输所需最小带宽的基础上,提出了基于优先级的弹性接纳控制算法,并以概率强度因子对算法进行了优化。该算法能够根据剩余资源动态地调整接纳强度和策略,对不同优先级的VoIP表现出不同的接纳特性,资源紧张时合理限制低优先级VoIP的接纳。为评价算法性能,通过Markov模型对建议算法的拒绝率进行分析,并在PMP(point-to-multipoint)模式下与新呼叫限制算法进行了对比仿真,结果表明本算法在表现出更高接纳能力的同时具有更低的新连接阻塞率和切换连接掉线率。     

Bandwidth borrowing‐based QoS approach for adaptive call admission control in multiclass traffic wireless cellular networks

This paper proposes a QoS approach for an adaptive call admission control (CAC) scheme for multiclass service wireless cellular networks. The QoS of the proposed CAC scheme is achieved through call bandwidth borrowing and call preemption techniques according to the priorities of the traffic classes, using complete sharing of the available bandwidth. The CAC scheme maintains QoS in each class to avoid performance deterioration through mechanisms for call bandwidth degradation, and call bandwidth upgrading based on min–max and max–min policies for fair resource deallocation and reallocation, respectively. The proposed adaptive CAC scheme utilizes a measurement‐based online monitoring approach of the system performance, and a prediction model to determine the amount of bandwidth to be borrowed from calls, or the amount of bandwidth to be returned to calls. The simulation‐based performance evaluation of the proposed adaptive CAC scheme shows the strength and effectiveness of our proposed scheme. Copyright © 2011 John Wiley & Sons, Ltd.     

Probabilistic call admission control in wireless multiservice networks

A new probabilistic call admission control scheme is proposed for multiservice wireless networks. The new scheme gradually suppresses the admission rate of the new calls and of the calls of each service class (SC) supported considering their priorities independently. The scheme is examined both for a single SC and for multiple SCs under general conditions. The analysis employs Markov chain theory and yields analytical expressions for the call blocking probabilities. The proposed analytical method was validated via simulations employing different distributions for the channel holding time; the simulations demonstrated the accuracy of the proposed framework.     

Efficient call admission control for heterogeneous services inwireless mobile ATM networks

An efficient call admission control scheme for handling heterogeneous services in wireless ATM networks is proposed. Quality-of-service provisioning of jitter bounds for constant bit rate traffic and delay bounds for variable bit rate traffic is used in the CAC scheme to guarantee predefined QoS levels for all traffic classes. To reduce the forced handoff call dropping rate, the CAC scheme gives handoff calls a higher priority than new calls by reserving an appropriate amount of resources for potential handoff calls. Resource reservation in the CAC scheme makes use of user mobility information to ensure efficient resource utilization. Simulation results show that the proposed CAC scheme can achieve both low handoff call dropping rate and high resource utilization     

基于价格区分策略的队列资源分配算法

以实现收益最大化为目标,提出了一种易于在DiffServ中实现的队列调度算法,设计了一种离散区分的平坦定价(Flat-Rate Pricing)方式,给出了保证用户严格QoS的接纳控制条件,分析了算法复杂度。新算法通过动态调整队列分配权重,实现了自适应队列资源的分配。仿真结果验证了算法的有效性和公平性。     

HSDPA中的一种新自适应准入控制方案

HSDPA(高速下行链路数据包接入)为WCDMA的增强演化版本犤1犦。提出了基于HSDPA系统中的一种自适应准入控制方案。这里给出的两个性能指标是新呼叫拒绝率(newcallblockingratio)和切换拒绝率(handoffcallblockingratio)。仿真性能的比较对象是固定预留资源分配比例的准入控制方案。仿真结果显示,自适应准入控制方案保证了一定的切换拒绝率,同时降低了新呼叫拒绝率。     

Predictive QoS-based admission control for multiclass traffic incellular wireless networks

We develop the notion of quality of service (QoS) for multimedia traffic in terms of maximum call dropping probabilities independent of system load and a predefined call blocking probability profile for the different traffic classes for wireless networks of arbitrary shape and dimension. We describe two distributed predictive admission control algorithms, independent multiclass one-step prediction (IMOSP-CS and IMOSP-RES), which provide each traffic class with a given call dropping probability and a desired call blocking probability profile. Both algorithms may be seen as extensions of the multimedia one-step prediction (MMOSPRED) algorithm previously reported, which uses prediction of the overload probability in the home and neighbor cells in deciding whether to admit new users into a multiclass cellular system. The two algorithms differ in their approach to handoff call admission. The first algorithm completely shares the bandwidth among the entering handoff users while the second implements a partition-based reservation scheme. In this paper, we additionally impose a call blocking criterion that ensures a system-imposed call priority independent of the traffic in the system and which adapts to changes in the offered load. In comparing these algorithms to each other, we focus on system throughput and class independence. Both algorithms provide appropriate throughput under both homogeneous and heterogeneous traffic loading conditions while maintaining steady call dropping probabilities for each traffic class     

Adaptive resource allocation for prioritized call admission over anATM-based wireless PCN

In future personal communications networks (PCNs) supporting network-wide handoffs, new and handoff requests will compete for connection resources in both the mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The previously proposed guard channel scheme for radio channel allocation in cellular networks reduces handoff call blocking probability substantially at the expense of slight increases in new call blocking probability by giving resource access priority to handoff calls over new calls in call admission control. While the effectiveness of a fixed number of guard channels has been demonstrated under stationary traffic conditions, with nonstationary call arrival rates in a practical system, the achieved handoff call blocking probability may deviate significantly from the desired objective. We propose a novel dynamic guard channel scheme which adapts the number of guard channels in each cell according to the current estimate of the handoff call arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoff call blocking probability close to the targeted objective while constraining the new call blocking probability to be below a given level. The proposed scheme is applicable to channel allocation over cellular mobile networks, and is extended to bandwidth allocation over the backbone network to enable a unified approach to prioritized call admission control over the ATM-based PCN