异构分层无线网络中基于业务QoS保证的切换策略研究

针对异构分层无线网络提出了一种保证业务QoS的切换策略。该策略在层间呼叫双向溢出基础上,为实时业务切换设置了保护信道,为非实时业务切换设置了缓冲队列。为了进一步降低实时业务切换的掉线率,还使用了信道侵占技术,原理是实时业务切换呼叫可以侵占数据业务正在使用的信道资源。仿真结果表明,提出的切换方法能够显著降低各类切换业务的掉线率,同时整个异构分层系统的信道利用率也略有提高。     

基于马尔科夫链的联合呼叫接入控制算法

异构网络的接入策略与网络资源管理效率紧密相关;同时,网络复杂性与网络资源竞争性直接影响到用户服务质量。针对异构网络接入控制存在的切换掉话率和呼叫阻塞率高、资源利用率低等问题,提出了基于马尔科夫链的联合呼叫接入控制算法。接入控制算法为切换呼叫业务、实时业务动态地预留了一定的带宽资源,根据不同业务设置带宽降级因子来决定是否释放带宽;同时,根据用户偏好和不同业务的QoS要求,构建了呼叫接入控制效用函数,利用马尔科夫链进行了建模分析。仿真表明,算法提高了网络资源利用率,降低了系统复杂度,满足了各类业务的QoS要求。     

无线网络一种新的基于实测的呼叫接入控制算法

提出了一种新的应用于无线网络的呼叫接入控制算法.该算法采用自回归滑动平均(ARMA)直接对切换呼叫掉线数建模,预测下一时刻可能的掉线数目,据此反馈更新资源预留门槛(Th).仿真结果表明,无论是在中业务负载,还是高业务负载下,该算法都能在提高系统统计复用增益(任意时刻系统允许接入呼叫连接数)的同时满足目标掉线概率的要求.     

一种支持宽带无线多媒体网络QoS的动态呼叫接纳策略

在无线网络中,小区微型化的趋势使得呼叫切换发生的频率越来越高,迫切需要一种有效的呼叫接纳控制策略,对有限的无线带宽资源进行分配,以保证切换时的QoS,同时使带宽利用率最高。传统的预留带宽策略(GC,guard channel scheme)由于其固有的静态特征而不能适应流量模式的变化。最近,人们发现采用动态的随机控制策略能适应流量模式的变化,而且能使精度和稳定性大大提高。但将这种策略应用于多业务环境依然十分困难,挑战来自于多类呼叫的QoS要求、流量模式、切换率的多样性和宽带条件下的实时可计算性。在文[3]中,我们建立了一个随机控制模型,可以在宽带条件下实时地进行多业务接纳控制,但由于没有考虑复杂的边界条件,控制精度受到影响。本文,我们在考虑边界条件的情况下,求解该随机问题,并采用一种有效的数值方法,使计算复杂度大大降低,保证了计算的实时性。最后得到的多业务动态接纳控制策略具有较高的控制精度和良好的可计算性。仿真结果显示该策略能稳定地满足多业务QoS对呼叫中断概率的严格限制,同时又能保证信道的高利用率。     

无线移动网中的队列降质接纳控制

提出了在无线移动网中基于队列的降质接纳控制算法,它区分了实时业务和非实时业务,同时考虑了切换优先和业务优先两种优先级。在网络带宽资源不足时,通过降低某些可容忍质量下降的呼叫的质量并与队列缓存呼叫相结合的方式,来获得小区中高优先级业务的新呼叫阻塞率和切换呼叫中断率均很低的性能改善。性能分析结果显示该算法简单易实现,具有较低的新呼叫阻塞率、切换呼叫中断率和较高的系统利用率。     

无线局域网下PCF结点切换时的资源预留方案

在无线局域网（WLAN）环境中,对VoIP等实时应用结点在漫游切换时,提前在邻居AP小区进行带宽资源预留是保障其获得持续、一致OoS的主要措施．但是目前的资源预留方法要么计算复杂,不符合WLAN的实际情况;要么效率低下,不能很好地为切换结点提供资源保证．在结合已有的预留算法的基础上,根据WLAN本身的特点,提出了一种PCF结点资源预留方法,使VoIP结点采用PCFAP轮询信道访问方式,通过VoIP结点漫游时发现邻居AP的存在,提前向邻居AP发出资源预留请求,同时邻居AP根据网络状况动态调整预留资源大小．仿真实验结果表明,在不浪费无线带宽资源的条件下,提出的方法相对于其他预留方案能够获得更低的切换连接掉线率．     

WiMAX网络中信噪比与带宽结合的接纳控制算法

呼叫接纳控制（CAC）是宽带无线接入网络无线资源管理中一个重要的组成部分,其中策略设计的好坏直接影响着网络的性能和资源利用率。针对现有基于WiMAX的接纳控制算法仅考虑了带宽作为接纳控制的标准,提出一种结合带宽和信噪比的接纳控制算法,在考虑小区带宽因素的同时能兼顾考虑接纳后业务的信噪比情况。仿真结果表明,结合带宽和信噪比的接纳控制算法可以有效的降低系统中呼叫的掉线率,提高系统性能。     

基于声望模型的联合呼叫接纳控制算法

为了弥补异构无线网络中呼叫接纳控制研究场景的局限性,降低终端选择接入网时的盲目性,将研究场景从两个接入网延伸为多个接入网,提出一种基于声望模型的联合呼叫接纳控制算法。将声望模型应用于网络选择过程,增加了网络反馈机制。在用户侧,终端根据网络声望值大小选择接入网;在网络侧,采用动态带宽分配和缓冲队列策略来提高接入成功率。仿真结果表明,该算法有效降低了新呼叫阻塞率和切换呼叫掉线率。     

一种基于IEEE 802.16的动态带宽分配准入控制机制

通过对IEEE 802.16的QoS机制的分析,针对在802.16中没有详细规定准入控制算法的情况,并结合协议中行定义的业务类型的QoS特性和对移动性的支持,提出一种基于802.16的动态带宽分配准入控制机制.仿真结果表明提出的准入控制机制同带宽预留的固定带宽分配机制相比,系统的切换连接掉线率(CDP)、新增连接的阻塞率(CBP)和带宽利用率均有了明显的改善.     

异构分层无线网络中基于业务和逗留时间的动态流量均衡算法

在异构分层无线网络中使用有效的流量均衡技术，可以给更多的移动用户提供服务。现有的流量均衡算法主要针对同种无线网络，因而不能直接用于异构无线网络。本文提出了一种适用于异构无线网络的基于业务和逗留时间的动态流量均衡算法，该算法首先根据移动模型计算移动用户在小区内的逗留时间，然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内转移的非实时性呼叫数量，最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中。为降低切换呼叫掉线率，还对异构网间的呼叫切换策略做了改进。仿真实验结果表明．本算法在新呼叫阻寒率和切换呼叫掉线率等性能指标上比传统方法有显著提高．     

Implementation of call admission control scheme in next generation mobile communication networks using particle swarm optimization and fuzzy logic systems

In the present and next generation wireless networks, cellular system remains the major method of telecommunication infrastructure. Since the characteristic of the resource constraint, call admission control is required to address the limited resource problem in wireless network. The call dropping probability and call blocking probability are the major performance metrics for quality of service (QoS) in wireless network. Many call admission control mechanisms have been proposed in the literature to decrease connection dropping probability for handoffs and new call blocking probability in cellular communications. In this paper, we proposed an adaptive call admission control and bandwidth reservation scheme using fuzzy logic control concept to reduce the forced termination probability of multimedia handoffs. Meanwhile, we adopt particle swarm optimization (PSO) technique to adjust the parameters of the membership functions in the proposed fuzzy logic systems. The simulation results show that the proposed scheme can achieve satisfactory performance when performance metrics are measured in terms of the forced termination probability for the handoffs, the call blocking probability for the new connections and bandwidth utilization.     

LEO卫星中模拟实时通信量确保保护信道的分配

由于LEO（Low Earth Orbit）卫星网络中不断变化的点波束小区实时通信量负载无法估计,提出了一种根据系统仿真过程中当前通信量状态优化动态保护信道算法（ODGCS）。该分配策略引入呼叫间隔时间和切换呼叫中断间隔时间来获悉系统的实时性能状态,由仿真中通信量状态预测当前系统切换呼叫的中断概率,根据比较计算的呼叫中断概率和预先设定的QoS（Quality of Service）值,动态调整预留给切换呼叫使用的保护信道数。仿真结果表明,与传统的静态预留保护信道的算法相比,该算法能有效提高LEO卫星系统的性能稳定性。在负载较轻时,ODGCS算法保证切换呼叫QoS的同时,降低了新呼叫阻塞概率。     

On utility-fair bandwidth adaptation for multi-class traffic QoS provisioning in wireless networks

The ability to adjust the allocated bandwidth of ongoing calls to cope with wireless network resource fluctuations is becoming increasingly important. In this paper, we describe a utility-based bandwidth adaptation scheme for multi-class traffic quality-of-service (QoS) provisioning in wireless networks. With the proposed scheme, each call is assigned a utility function according to its adaptive characteristics. Depending on the network load the allocated bandwidth of ongoing calls are upgraded or degraded dynamically such that each call receives fair utility. The quantization of utility function by dividing the utility range into a fixed number of equal intervals is a key feature of our proposed utility-fair algorithm. Appropriate call admission control and bandwidth reservation policies are also integrated into the proposed scheme to provide QoS guarantees to the new and handoff calls. Extensive simulation experiments have been conducted to evaluate the performance of the proposed scheme compared with two other existing ones. Results show that our bandwidth adaptation scheme is effective in achieving utility fairness while keeping the call blocking and handoff dropping probabilities substantially low.     

QoS guarantee for multimedia traffic in smart homes

With the advent of home networking and widespread deployment of broadband connectivity to homes, a wealth of new services with real-time Quality of Service (QoS) requirements have emerged, e.g., Video on Demand (VoD), IP Telephony, which have to co-exist with traditional non-real-time services such as Web browsing and file downloading over the Transmission Control Protocol (TCP). The co-existence of such real-time and non-real-time services demands the residential gateway (RG) to employ bandwidth management algorithms to control the amount of non-real-time TCP traffic on the broadband access link from the Internet Service Provider (ISP) to the RG so that the bandwidth requirements of the real-time traffic are satisfied. In this paper we propose an algorithm to control the aggregate bandwidth of the incoming non-real-time TCP traffic at the RG so that QoS requirements of the real-time traffic can be guaranteed. The idea is to limit the maximum data rates of active TCP connections by dynamically manipulating their flow control window sizes based on the total available bandwidth for the non-real-time traffic. We show by simulation results that our algorithm limits the aggregate bandwidth of the non-real-time TCP traffic thus granting the real-time traffic the required bandwidth.     

Application of support vector machines to bandwidth reservation in sectored cellular communications

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in sectored cellular networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in the sectored cellular communications, particularly when the handoff traffic is heavy. In this paper, a self-adaptive bandwidth reservation scheme, which adopts support vector machines technique, is proposed to reduce the forced termination probability. Meanwhile, a channel-borrowing technique is used to decrease the new call-blocking probability of real-time traffic. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in sectored cellular networks in the literature when performance metrics are measured in terms of the forced termination probability and the new call- blocking probability.     

一种自适应的扇型微蜂房式带宽预留通信模式

在目前的跨区域连接方式中,扇型微蜂房式的网络系统比传统的微蜂房式系统有更高的传输速度.文中介绍了一种自适应的带宽预留模式,这种模式使用了一种神经模糊带宽预留估计量的技术,经过证实,这种技术能够减少客户连接时被强行终止的概率.在这种带宽预留模式中,使用一种通道借用技术能够在实时通信时,减少新的呼叫受阻现象的发生.通过分析强行终止的客户连接和呼叫受阻的概率事件,仿真结果表明,采用扇型微蜂房式的网络系统比传统的固定带宽预留模式要有更好的性能.     

A fair resource allocation protocol for multimedia wireless networks

Wireless networks are expected to support real-time interactive multimedia traffic and must be able, therefore, to provide their users with quality-of-service (QoS) guarantees. Although the QoS provisioning problem arises in wireline networks as well, mobility of hosts and scarcity of bandwidth makes QoS provisioning a challenging task in wireless networks. It has been noticed that multimedia applications can tolerate and gracefully adapt to transient fluctuations in the QoS that they receive from the network. The additional flexibility afforded by the ability of multimedia applications to tolerate and adapt to transient changes in QoS can be exploited by protocol designers to significantly improve the overall performance of wireless systems. This paper presents a fair resource allocation protocol for multimedia wireless networks that uses a combination of bandwidth reservation and bandwidth borrowing to provide network users with QoS in terms of guaranteed bandwidth, call blocking, and call dropping probabilities. Our view of fairness was inspired by the well-known max-min fairness allocation protocol for wireline networks. Simulation results are presented that compare our protocol to similar schemes.     

Preemption-Aware Instantaneous Request Call Routing for Networks With Book-Ahead Reservation

This paper presents a new preemption-aware quality of service (QoS) routing algorithm for instantaneous request (IR) call connections in a QoS-enabled network where resources are shared between IR and book-ahead (BA) call connections. BA reservation, which confirms the availability of resources in advance, is a highly attractive technique for time sensitive applications that require high amount of bandwidth with guaranteed QoS. One of the major concerns for the implementation of BA reservation is the need for preemption of on-going IR calls to accommodate BA calls when resource scarcity arises. Preemption disrupts service continuity of on-going calls which is considered as severely detrimental from users' perceived QoS definition found in recent studies. Existing QoS routing algorithms focus on resource conservation or load balancing as the key objective to attain in addition to guaranteed QoS. No works have yet focused on the preemption problem of on-going IR calls at routing stage in the presence of BA calls. We present a mathematical formulation to compute the preemption probability of an incoming IR call at routing stage based on the current IR and future BA load information. We propose a routing strategy by formulating a link cost function comprising of the calculated preemption probability of the incoming IR call and hop count. Simulation results confirm that QoS routing based on the proposed link cost function significantly outperforms widely recommended shortest path and widest path routing algorithms in terms of IR call preemption and blocking rate. The proposed approach also yields higher network utilization and IR effective throughput.