A connection admission control scheme based on game theoretical model in ATM networks

In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among different traffic sources is analyzed based on cooperative game model. A CAC scheme is proposed using the genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share and accuracy of accepting/rejecting the incoming calls. Simulation results show that the proposed scheme ensures fairness of the shared bandwidth to different traffic sources.     

A Novel Probability-Based Handoff Strategy for Multimedia LEO Satellite Communications

A novel bandwidth allocation strategy and a connection admission control technique arc proposed to improve the utilization of network resource and provide the network with better quality of service （QoS） guarantees in multimedia low earth orbit （LEO） satellite networks. Our connection admission control scheme, we call the probability based dynamic channel reservation strategy （PDR）, dynamically reserves bandwidth for real-time services based on their handoff probability. And the reserved bandwidth for real-time handoff connection can also be used by new connections under a certain probability determined by the mobility characteristics and bandwidth usage of the system. Simulation results show that our scheme not only lowers the call dropping probability （CDP） for Class I real-time service but also maintains the call blocking probability （CBP） to certain degree. Consequently, the scheme can offer very low CDP for rcal-time connections while keeping resource utilization high.     

Traffic Characteristics Based Dynamic Radio Resource Management in Heterogeneous Wireless Networks

The traffic with tidal phenomenon in Heterogeneous Wireless Networks （HWNs） has radically increased the complexity of radio resource management and its performance analysis. In this paper, a Simplified Dynamic Hierarchy Resource Management （SDHRM） algorithm exploiting the resources dynami- cally and intelligently is proposed with the consideration of tidal traffic. In network-level resource allocation, the proposed algorithm first adopts wavelet neural network to forecast the traffic of each sub-area and then allocates the resources to those sub-areas to maximise the network utility. In connection-level net- work selection, based on the above resource allocation and the pre-defined QoS require- ment, three typical network selection policies are provided to assign traffic flow to the most appropriate network. Furthermore, based on multidimensional Markov model, we analyse the performance of SDHRM in HWNs with heavy tailed traffic. Numerical results show that our theoretical values coincide with the simulation results and the SDHRM can im- prove the resource utilization.     

OFDMA分布式无线接入网络中基于共享标准的资源分布研究

Distributed radio access network (DRAN) is a novel wireless access architecture and can solve the problem of the available spectrum scarcity in wireless communications. In this paper, we investigate resource allocation for the downlink of OFDMA DRAN. Unlike previous exclusive criterion based algorithms that allocate each subcarrier to only one user in the system, the proposed algorithms are based on shared criterion that allow each subcarrier to be allocated to multiple users through different antennas and to only one user through same antenna. First, an adaptive resource allocation algorithm based on shared criterion is proposed to maximize total system rate under each user’s minimal rate and each antenna’s maximal power constraints. Then we improve the above algorithm by considering the influence of the resource allocation scheme on single user. The simulation results show that the shared criterion based algorithm provide much higher total system rate than that of the exclusive criterion based algorithm at the expense of the outage performance and the fairness, while the improved algorithm based on shared criterion can achieve a good tradeoff performance.     

Fuzzy Logic QoS Dynamic Source Routing for Mobile Ad Hoc Networks

Considering the characters of dynamic topology and the imprecise state information in mobile ad hoc network,we propose a Fuzzy Logic QoS Dynamic Source Routing(FLQDSR)algorithm based on Dynamic Source Routing(DSR)protocol while adopting fuzzy logic to select the appropriate QoS routing in multiple paths which are searched in parallel.This scheme considers not only the bandwidth and end-to-end delay of routing,but also the cost of the path.On the otherhand the merit of using fuzzy logic is that it can be implemented by hardware.This makes the realization of the schemeeasier and faster.However our algorithm is based on DSR,the maximal hop count should be less than 10,i.e.,the scaleof mobile ad hoc network should not be very large.Simulation results show that FLQDSR can tolerate a high degree of in-formation imprecision by adding the fuzzy logic module which integrates the QoS requirements of application and the rout-ing QoS parameters to determine the most qualified one in every node.     

基于动态定价的帧聚合策略(英文)

Frame aggregation is a wireless link optimization mechanism that aims to reduce transmission overheads by sending multiple frames as the payload of a single MAC frame. It is considered as one of the most efficient methods to improve the wireless channel utilization and the throughput of wireless networks.The static assignment of frame aggregation parameters can result in delay penalties due to variations in traffic type. We propose a frame aggregation scheme which is based on dynamic pricing and queue scheduling for a multitraffic scenario. The scheme adopts a dynamic differential pricing scheme for different types of traffic. Meanwhile, it polls buffer queues in accordance with the optimal aggregation weight factors to maximise the network revenue.Simulation results indicate that the proposed frame aggregation scheme can effectively improve the network revenue and the average throughput, while guaranteeing the delay requirements of all types of traffic.     

Dynamic Subcarrier Assignment for OFDM-PON Network Based on RSOA for ACCORDANCE

In this paper, we overview the principle of Orthogonal Frequency Division Multiplexing Passive Optical Network （OFDM-PON） systems, with a particular focus on upstream architectures capable of achieving 10Gbit/s colorless upstream transmission using Reflective Semiconductor Optical Amplifier （RSOA）. We propose an architecture of RSOA based OFDM-PON which can achieve 10Gbit/s upstream transmission over a single wavelength. A novel Dynamic Subcarrier Assignment （DSA） algorithm is also proposed to support my architecture, namely Service based Polling in Pipeline （SPP） dynamic subcarrier algorithm. A simulation was conducted to study the performance of SPP algorithm. Compared with the traditional dynamic bandwidth allocation algorithms, service based polling meets the quality of in pipeline algorithm service requirements excellently, and adapts orthogonal frequency division multiplexing passive optical network better with higher bandwidth efficiency and lower algorithm complexity.     

Dynamic subcarrier and power allocation based on cooperative game theory in symmetric cooperative OFDMA networks

In order to improve the efficiency and fairness of radio resource utilization,a scheme of dynamic cooperative subcarrier and power allocation based on Nash bargaining solution(NBS-DCSPA) is proposed in the uplink of a three-node symmetric cooperative orthogonal frequency division multiple access(OFDMA) system.In the proposed NBS-DCSPA scheme,resource allocation problem is formulated as a two-person subcarrier and power allocation bargaining game(SPABG) to maximize the system utility,under the constraints of each user’s maximal power and minimal rate,while considering the fairness between the two users.Firstly,the equivalent direct channel gain of the relay link is introduced to decide the transmission mode of each subcarrier.Then,all subcarriers can be dynamically allocated to the two users in terms of their selected transmission mode.After that,the adaptive power allocation scheme combined with dynamic subcarrier allocation is optimized according to NBS.Finally,computer simulation is conducted to show the efficiency and fairness performance of the proposed NBS-DCSPA scheme.     

Design of in-network caching scheme in CCN based on grey relational analysis

In-network caching is one of the most important issues in content centric networking （CCN）, which may extremely influence the performance of the caching system. Although much work has been done for in-network caching scheme design in CCN, most of them have not addressed the multiple network attribute parameters jointly during caching algorithm design. Hence, to fill this gap, a new in-network caching based on grey relational analysis （GRA） is proposed. The authors firstly define two newly metric parameters named request influence degree （RID） and cache replacement rate, respectively. The RID indicates the importance of one node along the content delivery path from the view of the interest packets arriving The cache replacement rate is used to denote the caching load of the node. Then combining hops a request traveling from the users and the node traffic, four network attribute parameters are considered during the in-network caching algorithm design. Based on these four network parameters, a GRA based in-network caching algorithm is proposed, which can significantly improve the performance of CCN. Finally, extensive simulation based on ndnSIM is demonstrated that the GRA-based caching scheme can achieve the lower load in the source server and the less average hops than the existing the betweeness （Betw） scheme and the ALWAYS scheme.     

Virtual channel load-balanced routing algorithm for Torus networks

In order to improve the network performance furthermore,a routing algorithm for 2D-Torus is investigated from the standpoint of load balance for virtual channels.The 2D-Torus network is divided into two virtual networks and each physical channel is split into three virtual channels.A novel virtual channel allocation policy and a routing algorithm are proposed,in which traffic load is distributed to those three virtual channels in a more load-balanced manner by introducing a random parameter.Simulations of the proposed algorithm are developed with a SystemC-based test bench.The results show that compared with the negative first for Torus networks(NF-T) algorithm,the proposed algorithm can achieve better performance in terms of network latency and throughput under different traffic patterns.It also shows that a routing algorithm with load balance for virtual channels can significantly improve the network performance furthermore.     

基于多门限预留机制的自适应带宽分配算法

针对异构无线网络融合环境提出了一种基于多门限预留机制的自适应带宽分配算法,从而为多业务提供QoS保证。该算法采用多宿主传输机制,通过预设各个网络中不同业务的带宽分配门限,并基于各个网络中不同业务和用户的带宽分配矩阵,根据业务k支持的传输速率等级需求和网络状态的变化,将自适应带宽分配问题转化为一个动态优化问题并采用迭代方法来求解,在得到各个网络中不同业务和用户优化的带宽分配矩阵的同时,在带宽预留门限和网络容量的约束条件下实现网络实时吞吐量的最大化,以提高整个异构网络带宽的利用效率。数值仿真结果显示,所提算法能够支持满足QoS需求的传输速率等级,减小了新用户接入异构网络的阻塞概率,提高了平均用户接入率并将网络吞吐量最大提高40%。     

Bandwidth Reallocation for Bandwidth Asymmetry Wireless Networks Based on Distributed Multiservice Admission Control

This paper addresses when and how to adjust bandwidth allocation on uplink and downlink in a multi-service mobile wireless network under dynamic traffic load conditions. Our design objective is to improve system bandwidth utilization while satisfying call level QoS requirements of various call classes. We first develop a new threshold-based multi-service admission control scheme (DMS-AC) as the study base for bandwidth re-allocation. When the traffic load brought by some specific classes under dynamic traffic conditions in a system exceeds the control range of DMS-AC, the QoS of some call classes may not be guaranteed. In such a situation, bandwidth re-allocation process is activated and the admission control scheme will try to meet the QoS requirements under the adjusted bandwidth allocation. We explore the relationship between admission thresholds and bandwidth allocation by identifying certain constraints for verifying the feasibility of the adjusted bandwidth allocation. We conduct extensive simulation experiments to validate the effectiveness of the proposed bandwidth re-allocation scheme. Numerical results show that when traffic pattern with certain bandwidth asymmetry between uplink and downlink changes, the system can re-allocate the bandwidth on uplink and downlink adaptively and at the same time improve the system performance significantly.     

Dynamic Bandwidth Allocation in WDM Passive Star Networks with Asymmetric Traffic

When asymmetric traffic is offered to a WDM passive star network, the offered bandwidth must be allocated is such a way that each station takes a portion of the available bandwidth proportional to its needs. When the traffic characteristics are fixed and a priori known, then, the bandwidth allocation scheme can be based on these characteristics. Unfortunately, the traffic characteristics are often unknown and time-variable. In this paper, a dynamic bandwidth allocation scheme is presented, which is based on the network feedback information in order to be capable of adapting to the changing traffic characteristics. According to the proposed scheme, a set of learning automata processes the network feedback information and dynamically allocates the available bandwidth to the stations according to their needs.     

一种基于对策模型的ATM网络连接接纳控制策略

本文先简述了ATM网络进行连接接纳控制(Connection Admission Control:CAC)的主要方法,其中主要综述了基于动态带宽分配的CAC策略,而后从合作对策模型的角度讨论业务间共享链路资源的公平性问题,提出一种基于时延带宽积的业务收益函数形式,并通过遗传算法求解待优化的对策函数,以决定对呼叫请求的接入或拒绝。仿真结果表明此方法能够更好地保证不同带宽和服务质量要求的业务共享网络资源的公平性。     

Class-Based Service Connectivity Using Multi-level Bandwidth Adaptation in Multimedia Wireless Networks

Due to the fact that quality of service requirements are not very strict for all traffic types, more calls of higher priority can be accommodated by reducing some bandwidth allocation for the bandwidth adaptive calls. The bandwidth adaptation to accept a higher priority call is more than that of a lower priority call. Therefore, the multi-level bandwidth adaptation technique improves the overall forced call termination probability as well as provides priority of the traffic classes in terms of call blocking probability without reducing the bandwidth utilization. We propose a novel bandwidth adaptation model that releases multi-level of bandwidth from the existing multimedia traffic calls. The amount of released bandwidth is decided based on the priority of the requesting traffic calls and the number of existing bandwidth adaptive calls. This prioritization of traffic classes does not reduce the bandwidth utilization. Moreover, our scheme reduces the overall forced call termination probability significantly. The proposed scheme is modeled using the Markov Chain. The numerical results show that the proposed scheme is able to provide negligible handover call dropping probability as well as significantly reduced new call blocking probability of higher priority calls without increasing the overall forced call termination probability.     

流媒体在分组传送光网络PTN传输的动态带宽分配算法

根据光网络由SDH向分组化PTN网络演进及新兴流媒体业务的特点,本文采用混合业务流模型,引入门限控制,多级选择丢弃和多级缓存优先级的概念,提出了一种基于业务分类和业务优先级的带宽分配算法-基于门限的动态优先级带宽分配方案（TDPBA）,克服了门限控制分配带宽颗粒过大和优先级算法运算量较大的弊病,在特别定制的试验平台上进行了四优先级系统的网络性能仿真,验证了此方案可以最大限度的保障高优先级业务的传输,可以用于对QoS有较高要求的业务,适合引入处在分组化进程中的光网络,在现有网络上更有效的承载流媒体业务.     

An Efficient and Adaptive Bandwidth Allocation Scheme for Mobile Wireless Networks Using an On-Line Local Estimation Technique

The next generation of mobile wireless networks has to provide the quality-of-service (QoS) for a variety of applications. One of the key generic QoS parameters is the call dropping probability, which has to be maintained at a predefined level independent of the traffic condition. In the presence of bursty data and the emerging multimedia traffic, an adaptive and dynamic bandwidth allocation is essential in ensuring this QoS. The paradox, however, is that all existing dynamic bandwidth allocation schemes require the prior knowledge of all traffic parameters or/and user mobility parameters. In addition, most proposals require extensive status information exchange among cells in order to dynamically readjust the control parameters, thus making them difficult to be used in actual deployment.In this paper, we introduce a novel adaptive bandwidth allocation scheme which estimates dynamically the changing traffic parameters through local on-line estimation. Such estimations are restricted to each individual cell, thus completely eliminating the signaling overhead for information exchange among cells. Furthermore, we propose the use of a probabilistic control policy, which achieves a high channel utilization, and leads to an effective and stable control. Through simulations, we show that our proposed adaptive bandwidth allocation scheme can guarantee the predetermined call dropping probability under changing traffic conditions while at the same time achieving a high channel utilization.     

Radio Resource Allocation for Scalable Video Services Over Wireless Cellular Networks

Good quality video services always require higher bandwidth. Hence, to provide the video services e.g., multicast/broadcast services (MBSs) and unicast services along with the existing voice, internet, and other background traffic services over the wireless cellular networks, it is required to efficiently manage the wireless resources in order to reduce the overall forced call termination probability, to maximize the overall service quality, and to maximize the revenue. Fixed bandwidth allocation for the MBS sessions either reduces the quality of the MBS videos and bandwidth utilization or increases the overall forced call termination probability and of course the handover call dropping probability as well. Scalable video coding (SVC) technique allows the variable bit rate allocation for the video services. In this paper, we propose a bandwidth allocation scheme that efficiently allocates bandwidth among the MBS sessions and the non-MBS traffic calls (e.g., voice, unicast, internet, and other background traffic). The proposed scheme reduces the bandwidth allocation for the MBS sessions during the congested traffic condition only to accommodate more calls in the system. Instead of allocating fixed bandwidths for the MBS sessions and the non-MBS traffic, our scheme allocates variable bandwidths for them. However, the minimum quality of the videos is guaranteed by allocating minimum bandwidth for them. Using the mathematical and numerical analyses, we show that the proposed scheme maximizes the bandwidth utilization and significantly reduces the overall forced call termination probability as well as the handover call dropping probability.     

一个利用模糊预测的ATM广域网流量控制算法

本文提出了一个采用模糊预测的ＡＴＭ广域网流量控制算法，该算法包括二个部分，即非受控业务量的模糊预测和网络带宽的动态分配，在预测部分，提出了一组模糊判决规则和相关的隶属函数，在带宽分配地对ＡＴＭ广域网传输时延长的特点，把模糊预测与本文作者在文献「１」中所提出的ＳＥＲ流量控制机制相结合，保证了带分配的公平性和链路的高利用率，仿真结果表明，带宽分配具有公平性，链路利用率达到设计目标、交换节点处缓冲队列很