OBS网络中一种基于突发包优先级分割的可控重传方案

在光突发交换(OBS)网络中,突发包会由于竞争OBS核心节点输出端口的有限波长资源而发生冲突。突发包重传能够在一定程度上减少由于突发包在核心节点冲突而导致的数据损失,但重传次数的增加可能会加重网络负荷,反而增加数据丢失率。并且,在多业务存在的OBS网络中,重传方案需要能够实现区分服务以保证网络的服务质量(QoS)。据此,本文提出一种基于突发包优先级分割的可控重传方案,在实施优先级分割的同时,根据网络负荷赋予每次重传不同的概率,并对重传次数加以控制。最后,仿真分析了路径阻塞率和不同优先级业务的字节丢失率(ByLP,byte loss probability)性能。     

A framework of prioritized burst segmentation supporting controlled retransmission in OBS networks

In optical burst switching (OBS) networks, burst contentions in OBS core nodes may cause data loss. To reduce data loss, retransmission scheme has been applied. However, uncontrolled retransmission may increase network load significantly and data loss probability defeating the retransmission purpose. In addition, in a priority traffic existing OBS network, OBS nodes may apply different retransmission mechanisms to priorities bursts for quality-of-service (QoS) support. This study has developed a controlled retransmission scheme for prioritized burst segmentation to support QoS in OBS networks. Unlike previous works in the literature, we have set a different value to retransmission probability at each contention and propose a retransmission analytical model for burst segmentation contention resolution scheme. In addition, we have applied the proposed retransmission scheme to the prioritized burst segmentation for QoS support. We have taken into account the load at each link due to both fresh and retransmitted traffic, and have calculated the path blocking probability and byte loss probability (ByLP) for high-priority and low-priority burst to evaluate network performance. An extensive simulation has been proposed to validate our analytical model.     

Supporting multimedia applications through network redesign

Recent evolutions in high‐performance computing and high speed broadband Internet access have paved a way to enterprise‐wide multimedia applications, which require stern QoS from the underlying networks. In this paper, we have explored threefold studies on existing enterprise network, whereby we proposed an analytical approach to evaluate the performance of the existing network; we have examined the feasibility of existing enterprise networks to accommodate voice over Internet protocol (VoIP) services with acceptable QoS, and we have redesigned the enterprise network to accommodate VoIP services to comply with the user defined QoS. The network performance is evaluated by number of VoIP calls sustained by the network, bandwidth utilization, loss rate and latency through Network Simulation (NS‐2) tool. We have derived a cost model to show the cost‐effectiveness of VoIP services over telephonic network. For a medium‐size enterprise network of 200 clients and 9 servers, our simulation results show that the redesign improves the network performance by increasing the number of VoIP calls by 57% and decreasing bandwidth utilization and packet loss rate by 20% and 7%, respectively. Moreover, the proposed network redesign demonstrates that the network can be scalable and it can handle up to 4% increased voice calls in the future maintaining QoS standards. Copyright © 2012 John Wiley & Sons, Ltd.     

QoS‐based radio network dimensioning for LTE networks with heavy real‐time traffic

Applications of video streaming and real‐time gaming, which generate large amounts of real‐time traffic in the network, are expected to gain considerable popularity in Long Term Evolution networks. Maintaining the QoS such as packet delay, packet loss ratio, median, and cell border throughput requirements in networks dominated by real time traffic, is critical. The existing dimensioning methodology does not consider QoS parameters of real‐time traffic in network dimensioning. Moreover, exhaustive and time‐consuming simulations are normally required to evaluate the performance and QoS of real‐time services. To overcome this problem, we propose an improved radio network dimensioning framework that considers the QoS of real‐time traffic in network dimensioning. In this framework, an analytical model is proposed to evaluate the capacity and performance of real‐time traffic dominant Long Term Evolution networks. The proposed framework provides a fast and accurate means of finding the trade‐off between system load, packet delay, packet loss ratio, required median, and cell border throughput. It also provides network operators with an analytical means for obtaining the minimum number of sites required by jointly considering coverage, capacity and QoS requirements. The accuracy of the proposed model is validated through simulations. Copyright © 2012 John Wiley & Sons, Ltd.     

移动网自适应业务的CAC算法研究

宽带移动网络中的连续媒体流业务能够根据无线链路质量和小区负载情况自适应调整其源速率，因而使网络容量具有一定的弹性。自适应业务的CAC算法既要能保护用户的QoS降级期小于一定上限，从而保护用户的Qos；又要尽量提高接入率以充分利用无线资源。本文提出了一种基于滑动窗口的CAC算法，仿真结果表明该算法获得的接入率明显高于固定门限算法，并且能够有效的保护自适应业务的QoS。     

A Feedback Control Mechanism of QoS Management for IP Telecommunication Network

1IntroductionWith the rapid development of IP technology, thetraditional telecommunication network and the IP net-work are merging gradually.The trendis shown appar-ently in Next Generation Network ( NGN) and 3G( WCDMA/CDMA 2000) systems both of which arebased upon IP technology. The IP-based telecommuni-cation network (namely,IPTN) requires rigorous QoSguarantee. However ,even with decade s efforts , howto provide QoS guarantee for multiple services and cus-tomers over IPTN is …     

多QoS约束条件下的多目标网络优化

多约束、多业务、多目标的网络优化是一个复杂且涉及范围广泛的课题。文中在对该课题进行分析的基础上,提出了一种基于遗传算法的多目标网络优化算法(MOPGA)。该算法使用了多约束条件下的路径集预处理,使得每项业务能够获得所需的QoS服务质量,通过对所有业务的路由号进行编码,将问题的解空间转换到遗传算法的搜索空间,达到对全网业务的综合考虑。改进后的适应度函数刻划了网络的费用、链路利用率方差和最大链路利用率、爆破处理以及个体淘汰机制增加了种群多样性,挣脱了未成熟收敛。以求解精度作为算法终止条件,使得算法运行时间减少。仿真实验表明,所提出的算法能高效、快速解决实际多目标网络优化问题,同时在满足多QoS约束条件下可均衡各子目标函数。     

基于QoS的端到端差异化管控策略研究

在目前热点区域资源受限的情况下,本文基于eNode B侧和PCC侧的主要QoS管控能力开展网络差异化管控策略研究,形成无线侧最大聚合比特速率限速管控策略、基于用户的PCC管控策略以及基于业务的PCC管控策略,并在现场环境下完成验证。差异化管控策略能够在容量不足的区域有效保障特定用户/业务感知不受影响或优于普通用户/业务,妥善解决高流量和高负荷带来的整体用户感知问题,且能实现资源投入和经济效益的平衡。     

An optimal solution to resource allocation among soft QoS traffic in wireless network

Optimization theory and nonlinear programming method have successfully been applied into wire‐lined networks (e.g., the Internet) in developing efficient resource allocation and congestion control schemes. The resource (e.g., bandwidth) allocation in a communication network has been modeled into an optimization problem: the objective is to maximize the source aggregate utility subject to the network resource constraint. However, for wireless networks, how to allocate the resource among the soft quality of service (QoS) traffic remains an important design challenge. Mathematically, the most difficult comes from the non‐concave utility function of soft QoS traffic in the network utility maximization (NUM) problem. Previous result on this problem has only been able to find its sub‐optimal solution. Facing this challenge, this paper establishes some key theorems to find the optimal solution and then present a complete algorithm called utility‐based allocation for soft QoS to obtain the desired optimal solution. The proposed theorems and algorithm act as designing guidelines for resource allocation of soft QoS traffic in a wireless network, which take into account the total available resource of network, the users’ traffic characteristics, and the users’ channel qualities. By numerical examples, we illustrate the explicit solution procedures.Copyright © 2013 John Wiley & Sons, Ltd.     

QoS‐Guaranteed Slot Allocation Algorithm for Efficient Medium Access in HR‐WPAN

It is very important to provide a parameterized quality of service (QoS) using traffic specification (TSPEC), such as mean data rate, maximum burst size, and peak data rate, when packets from the application layer need to be transmitted with guaranteed services in a high‐rate wireless personal area network (HR‐WPAN). As medium resources are limited, the optimal medium time required for each device needs to be estimated to share the resources efficiently among devices. This paper proposes a variable‐service interval‐based resource allocation algorithm to efficiently make a reservation of medium resources based on a parameterized QoS. In other words, the proposed algorithm calculates the number of medium access slots (MASs) based on TSPEC, local resources, and local conditions and determines suitable locations for the MASs within a superframe to accommodate more devices. The simulation results show that the proposed algorithm can accommodate more devices and has greater than 10% resource allocation efficiency in an HR‐WPAN compared to existing schemes.     

A Novel Optical Burst Assembly Technique Based on a Dynamic Threshold Mechanism to Support Scalable QoS

In IP networks, coarse packet classification is a scalable QoS solution. Similarly, it can also be utilized to an OBS network. In order to match IP QoS requirements with the data processing capacity and flexibility of OBS networks, we propose a novel optical burst assembly technique, which is based on mapping rules and a dynamic threshold mechanism called ATQ-DT. How to map the IP QoS to burst priority is resolved by the mapping rules, and how to efficiently allocate the assembly capacity among classes belonging to the same priority is answered by ATQ-DT. This mechanism determines the maximum share for each class, which is proportional to the current unused capacity. Among the three mapping rules we propose, TQ-MAP is the most reasonable one because it considers both the traffic condition and the QoS requirement. As shown by simulation results, the assembly technique ATQ-DT with TQ-MAP can most remarkably improve the packets loss probability (PLP) to support QoS.     

面向统计QoS保障的多时间尺度接纳控制算法

采用在线测量的方法计算业务流的统计特性估计其突发水平以便选择合适的业务流模型。为了保障业务流的统计QoS,基于选定的业务流模型,通过有效带宽和有效包络的转换定理,获得多分形和自相似业务流的有效包络。然后,采用统计网络演算获得QoS参数进行接纳控制决策,并且通过选择接纳时机减小接纳控制本身对QoS的影响。仿真结果表明该算法能够准确地选择流模型,满足流模型的统计延迟要求,提高带宽利用率。     

LEO multi-service routing algorithm based on multi-objective decision making

In low earth orbit(LEO) satellite networks,in view of the unbalanced link resource,it's difficult to meet differentiated quality of service(QoS) requirements and easily lead to reduce the efficiency of the whole network.A routing algorithm based on multi-objective decision making was proposed which defined LEO satellite network transmission service as the delay sensitive,sensitive bandwidth and reliability sensitive three categories.It used the eigenvector method to calculate service weights,and used the consistency ratio to determine whether it can be accepted.Based on the multi-objective decision making theory,it combined with the actual state of satellite network nodes and links and the specific requirements of the business,calculating the path that meets the QoS requirements of the service,so as to realize the LEO satellite network multi objective dynamic routing optimization.Established simulation platform based on the iridium network system simulated network delay,the uncertain characteristics like the residual bandwidth and packet error rate,route planning for the randomly generated three classes of business.The simulation results show that,the algorithm not only satisfies the QoS constrain while balancing the traffic load of the satellite link effectively,but also improves the performance on the throughput.     

Performance Analysis of an Adaptive Link Status Update Scheme Based on Link‐Usage Statistics for QoS Routing

In the global Internet, a constraint‐based routing algorithm performs the function of selecting a routing path while satisfying some given constraints rather than selecting the shortest path based on physical topology. It is necessary for constraint‐based routing to disseminate and update link state information. The triggering policy of link state updates significantly affects the volume of update traffic and the quality of services (QoS). In this letter, we propose an adaptive triggering policy based on link‐usage statistics in order to reduce the volume of link state update traffic without deterioration of QoS. Also, we evaluate the performance of the proposed policy via simulations.     

Adaptive QoS Management for IEEE 802.11 Future Wireless ISPs

Wireless Internet Service Providers (WISPs) are expected to be the new generation of access providers using the emerging IEEE 802.11 technology. Face to the high competition of providing network services, the WISP have to offer the best service to the users. For this purpose, the WISP networks' managers need to provide Quality of Service (QoS) with a minimum cost in their wireless networks. The current link layer IEEE 802.11b provides fair sharing of the radio resource with no service differentiation mechanism; similarly to the Internet best effort service. However, the ongoing standard IEEE 802.11e should implement a priority mechanism at the link layer to differentiate the users' traffic. In order to overcome the lack of differentiated mechanism in the current link layer IEEE 802.11b, hence controlling the utilization of the scarce radio resource, we propose in this article to deploy Diffserv architecture coupled with an adaptive provisioning of QoS to provide better services to the users with minimum WISP cost and improve the utilization of the radio resource. Compliant with the current and future IEEE 802.11 link layer, the proposed adaptive QoS provisioning mechanism reacts to the radio resource fluctuation and improves the number of accepted clients in the IEEE 802.11 wireless cells based on the WISP business policies. The network layer differentiation provided by the Diffserv architecture intends to control the concurrent access of the traffic to the scarce radio resources at the IP layer of the mobile hosts for the uplink traffic on one hand, and at the IP layer of the base stations for the downlink traffic on the other hand.     

Traffic Aided Uplink Opportunistic Scheduling with QoS Support in Multiservice CDMA Networks

In this letter, we address the problem of resource allocation with efficiency and quality of service (QoS) support in uplink for a wireless CDMA network supporting real‐time (RT) and non‐realtime (NRT) communication services. For RT and NRT users, there are different QoS requirements. We introduce and describe a new scheme, namely, traffic aided uplink opportunistic scheduling (TAUOS). While guaranteeing the different QoS requirements, TAUOS exploits the channel condition to improve system throughput. In TAUOS, the cross‐layer information, file size information, is used to improve fairness for NRT users. Extensive simulation results show that our scheme can achieve high system throughput in uplink wireless CDMA systems, while guaranteeing QoS requirements.     

Performance analysis and comparison of burst transmission schemes in unsaturated 802.11e WLANs

Contention free bursting (CFB) and block acknowledgement (BACK) are two innovative burst transmission schemes specified in the IEEE 802.11e standard for reducing the contention overheads and further improving the channel utilization of wireless local area networks (WLANs). Existing studies on performance analysis of the CFB and BACK schemes have been primarily focused on the system throughput and have not taken into account the realistic factors, such as unsaturated traffic loads and finite buffer capacity. To fill this gap, this paper proposes a new and comprehensive analytical model for evaluating the Quality‐of‐Service (QoS) metrics including throughput, end‐to‐end delay, and frame loss probability of both burst transmission schemes under unsaturated traffic conditions. The proposed model is validated through extensive simulation experiments and then is used to conduct performance analysis and comparison of the burst transmission schemes under various working conditions. The analytical results reveal that (1) both CFB and BACK schemes can substantially improve the QoS performance; (2) BACK scheme outperforms the CFB scheme when the transmission opportunity (TXOP) limit exceeds a threshold; (3) the analytical model can be used to identify the optimal configuration of system parameters for the burst transmission schemes subject to QoS constraints. Copyright © 2010 John Wiley & Sons, Ltd.     

Cross‐layer bandwidth and power allocation for a two‐hop link in wireless mesh network

In this paper, a cross‐layer analytical framework is proposed to analyze the throughput and packet delay of a two‐hop wireless link in wireless mesh network (WMN). It considers the adaptive modulation and coding (AMC) process in physical layer and the traffic queuing process in upper layers, taking into account the traffic distribution changes at the output node of each link due to the AMC process therein. Firstly, we model the wireless fading channel and the corresponding AMC process as a finite state Markov chain (FSMC) serving system. Then, a method is proposed to calculate the steady‐state output traffic of each node. Based on this, we derive a modified queuing FSMC model for the relay to gateway link, which consists of a relayed non‐Poisson traffic and an originated Poisson traffic, thus to evaluate the throughput at the mesh gateway. This analytical framework is verified by numerical simulations, and is easy to extend to multi‐hop links. Furthermore, based on the above proposed cross‐layer framework, we consider the problem of optimal power and bandwidth allocation for QoS‐guaranteed services in a two‐hop wireless link, where the total power and bandwidth resources are both sum‐constrained. Secondly, the practical optimal power allocation algorithm and optimal bandwidth allocation algorithm are presented separately. Then, the problem of joint power and bandwidth allocation is analyzed and an iterative algorithm is proposed to solve the problem in a simple way. Finally, numerical simulations are given to evaluate their performances. Copyright © 2008 John Wiley & Sons, Ltd.     

Resources allocation in an Intserv/Diffserv integrated EPON system

As one of the most promising next-generation access network techniques, the user-oriented Ethemet passive optical network (EPON) should pay more attention to its quality of service (QoS). However, now the EPON adopts mostly differentiated services model (Diffserv) that only provides quality control on traffic aggregation, whereas, the quality of user session cannot be guaranteed when the network is overloaded with substantial connections. This article proposes to apply integrated services model (lntserv) in Diffserv-based EPON, which uses per-flow processing to guarantee QoS. In the simulation, a framework of combined Diffserv and lntserv model is employed in an EPON system, with a dynamic bandwidth allocation algorithm that adapts to it. The simulation results demonstrate that the EPON system with the combined models can provide more flexible, various control for user-oriented service quality.     

Network dimensioning at the call level for the always‐on network

It is becoming common for the network to provide always‐on access services, where subscribers are guaranteed that their call requests will never be blocked. This paper studies the call‐level link dimensioning for the always‐on network with single‐class traffic. The call‐level QoS requirement is expressed in terms of the probability of a poor‐quality call, which is the probability that a call experiences packet‐level QoS violation at any time during its duration, as opposed to the probability of blocking in the network with call admission control (CAC). The system is modelled as the M/M/infinite system with finite population and an analytic expression for the probability of a poor‐quality call is derived based on performability analysis. The effects of the call‐level traffic characteristics on the required link resources are studied. It is also shown that the call‐level link dimensioning for the always‐on network needs more link resources than the network with CAC, and the call‐level link dimensioning based on the analytic expression can be used to conservatively dimension the always‐on network with arbitrarily distributed call holding time and inter‐call time. The paper also studies the problem of estimating the call‐level traffic characteristics when the knowledge of call boundaries is not available. Copyright © 2004 John Wiley & Sons, Ltd.