基于多种业务流资源共享的在线呼叫接入控制算法

本文针对多种业务类型提出了一种在线呼叫接入控制算法（OCAC）。OCAC算法是基于QoS业务量的服务质量要求和BE业务量的拥塞状态来动态地调整资源的分配,目的是更有效地利用资源并且在QoS业务流调整服务质量的同时,改善BE业务量的吞吐量。针对多跳的情况,本文描述了OCAC算法的两种实现方案,即基于每个节点和基于源节点的OCAC实现方案（ENS和SNS）。最后给出了仿真结果,并对本文提出的算法和静态接入控制算法的仿真结果进行了比较,进一步说明OCAC算法的有效性。     

Optimal bandwidth and buffer allocation method for heterogeneoustraffic with multiple QoS in ATM networks

An optimal bandwidth and buffer allocation scheme is proposed which maximises network utilisation and satisfies both cell loss rate (CLR) and delay requirements for heterogeneous traffic with multiple quality of service. Simulation results show that the proposed scheme satisfies CLR and delay requirements and also utilises network resources efficiently     

TWDM-PON中用户行为感知的动态资源分配策略

TWDM-PON是下一代光接入网的主流方案,具有带宽高、距离长、用户多等特点.针对用户行为差异性增大的问题,为有效降低网络时延及提升资源分配的公平性,提出一种用户行为感知的动态资源分配策略.根据用户行为带来的业务动态变化状况,动态调整ONU的轮询机制以满足用户服务水平变化要求,并划分子周期交替发送不同等级的业务,设计高效的数据块加载方法来实现负载均衡的多波长传输.仿真结果表明,与传统策略相比,所提策略在保证资源利用率高达95%的同时,既使业务平均时延改善50%以上,也使资源分配具有更好的公平性.     

突发业务环境下CBR业务性能的实验分析

CBR业务是一类极为重要的实时业务,能否有效地传递这类业务关系到从现有网络向ATM的过渡,因此CBR业务的服务质量是一个值得研究的重要课题。本文利用计算机仿真的方法,全面地分析了突发业务环境下,影响CBR业务服务质量的各种因素,指出复接器占有率、缓冲区容量、背景强度、背景流的自相关特征对CBR业务的时延及时延抖动有很大的影响,尤其是背景流具有长时相关性时,CBR业务的服务质量将严重恶化,必须设法加以控制。     

宽带ISDN与ATM交换技术 第四讲 B－ISDN中的业务量控制

本文介绍了Ｂ－ＩＳＤＮ中业务量控制的原理和方法，讨论了连接／呼叫接纳控制（ＣＡＣ）和用法／网络参数控制（ＵＰＣ／ＮＰＣ）两个最基本的业务量控制功能，并对网络拥塞控制、业务量成形、优先级控制和快速资源管理等附加的控制功能作了简要的叙述。     

A prioritized resource allocation algorithm for multiple wireless body area networks

This paper presents a prioritized resource allocation algorithm to share the limited communication channel resource among multiple wireless body area networks. The proposed algorithm is designed based on an active superframe interleaving scheme, one of the coexistence mechanisms in the IEEE 802.15.6 standard. It is the first study to consider the resource allocation method among wireless body area networks within a communication range. The traffic source of each wireless body area network is parameterized using the traffic specification, and required service rate for each wireless body area networks can be derived. The prioritized resource allocation algorithm employs this information to allocate the channel resource based on the wireless body area networks’ service priority. The simulation results verified that the traffic specification and the wireless body area network service priority based resource allocation are able to increase quality of service satisfaction, particularly for health and medical services.     

异构无线网络基于业务特性的动态无线资源管理（英文）

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 dynamically 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 network selection,based on the above resource allocation and the pre-defined QoS requirement,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 improve the resource utilization.     

基于深度学习的流量工程算法研究与应用

随着5G网络的发展和应用,网络中的业务数量呈现出爆发式增长,网络中的带宽资源日趋紧张。为了提高网络资源利用率,并满足用户日益提高的业务服务质量要求,基于软件定义网络(SDN)提出了一种基于深度学习的流量工程算法(DL-TEA)。通过仿真证明该算法不仅能够实时地为业务计算一条高效的路径,同时还能够提升业务的QoS、网络资源利用率,降低网络阻塞率。     

Analysis of the WAP protocol over SMS in GSM networks

This paper, based on the PALIO Project within the fifth Research Framework of the European Commission, deals with an information tourist service accessible through mobile phones by means of the Wireless Application Protocol (WAP). We have considered a Global System for Mobile communications (GSM) network where the WAP traffic is transported by the Short Message Service (SMS) on a logical channel that also conveys signaling messages. Suitable models have been considered for both WAP browsing traffic and signaling traffic. We have proposed a theoretical approach to evaluate the mean delay to browse a WAP page taking into account the impact of the signaling load. Analytical predictions have been validated through comparisons with simulation results. Moreover, we have also considered a specific Quality of Service (QoS) requirement in terms of the maximum deck transmission delay that is guaranteed in 95 per cent of cases. Consequently, it has been possible to evaluate the number of WAP users that can be supported per cell. The study carried out in this paper permits to prove the feasibility for the envisaged mobile service based on WAP and it also allows dimensioning WAP pages so that each user experiences reasonable browsing delays. Copyright © 2001 John Wiley & Sons, Ltd.     

Efficient Resource Allocation for Policy-Based Wireless/Wireline Interworking

This paper proposes efficient resource allocation techniques for a policy-based wireless/wireline interworking architecture, where quality of service (QoS) provisioning and resource allocation is driven by the service level agreement (SLA). For end-to-end IP QoS delivery, each wireless access domain can independently choose its internal resource management policies to guarantee the customer access SLA (CASLA), while the border-crossing traffic is served by a core network following policy rules to meet the transit domain SLA (TRSLA). Particularly, we propose an engineered priority resource sharing scheme for a voice/data integrated wireless domain, where the policy rules allow cellular-only access or cellular/WLAN interworked access. By such a resource sharing scheme, the CASLA for each service class is met with efficient resource utilization, and the interdomain TRSLA bandwidth requirement can be easily determined. In the transit domain, the traffic load fluctuation from upstream access domains is tackled by an inter-TRSLA resource sharing technique, where the spare capacity from underloaded TRSLAs can be exploited by the overloaded TRSLAs to improve resource utilization. Advantages of the inter-SLA resource sharing technique are that the core network service provider can freely design the policy rules that define underload and overload status, determine the bandwidth reservation, and distribute the spare resources among bandwidth borrowers, while all the policies are supported by a common set of resource allocation techniques.     

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.     

QoS Provisioning with New Effective Bandwidth/Buffer Calculation Scheme in Wireless IP Networks

The huge commercial success of mobile telephony, the phenomenal growth of Internet users, the popularity of IP-based multimedia applications are the major driving forces behind third-generation (3G), ongoing Byond 3G (B3G), and forth-genertion (4G) evolution. 3G brought wired applications, both data and multimedia, into wireless environments. It operates on IP-based infrastructures to provide wider service access capability. To support and satisfy QoS (Quality of Service) of diverse IP-based multimedia applications, traffic management, such as Connection Admission Control (CAC) and resource allocation, becomes essential. CAC and resource allocation are computationally complex when combined with QoS guarantee for traffic with different characteristics. However, CAC and resource allocation are real-time traffic control procedures. Hence, processing load should be minimized to reduce delay. At the same time, network resources should be utilized efficiently to accommodate more users. However, reducing processing load and obtaining high resource utilization efficiency has been considered to be contradictory matter. In addition, CAC and resource allocation schemes which consider multiple QoS criteria – loss and delay – simultaneously have not been adequately studied. Simultaneous QoS consideration is important to satisfy stringent and diverse QoS requirements of multimedia traffic. In this paper, we propose a nobel effective bandwidth/buffer calculation method based on a virtual channel/buffer analysis scheme. We show that our method can achieve high resource utilization efficiency with reduced processing load. Moreover, we show that our scheme allows for simultaneous consideration of multiple QoS criteria, loss and delay.     

Efficient bandwidth allocation and call admission control for VBR service using UPC parameters

Provision of Quality‐of‐Service (QoS) guarantees is an important and challenging issue in the design of Asynchronous Transfer Mode (ATM) networks. Call Admission Control (CAC) is an integral part of the challenge and is closely related to other aspects of network designs such as traffic characterization and QoS specification. Since the Usage Parameter Control (UPC) parameters are the only standardized traffic characterizations, developing efficient CAC schemes based on UPC parameters is significant for the implementation of CAC on ATM switches. In this paper, we develop a CAC algorithm called TAP (derived from TAgged Probability) as well as two other CAC algorithms using the UPC parameters. These CAC algorithms are based on our observation that the loss‐probability‐to‐overflow‐probability ratio tends to decrease as the number of sources increases. By introducing the loss‐probability‐to‐overflow‐probability ratio K, we find that this ratio sheds light on increasing resource utilization while still guaranteeing QoS. Analysis, simulation, and numerical results have shown that the proposed TAP algorithm is simple and efficient. Copyright © 2000 John Wiley & Sons, Ltd.     

Comparison of admission control schemes in ATM networks

Asynchronous transfer mode (ATM) offers an efficient means of carrying a wide spectrum of BISDN traffic provided that network congestion is prevented. Unfortunately, efficient congestion control is difficult to achieve in integrated broadband networks, owing to the wide range of traffic characteristics and quality of service (QOS) requirements. We have implemented a network simulator that allows us to evaluate many proposed admission control schemes using many different traffic models. We present the results of several simulation studies, including one study of the performance of the admission control schemes in the presence of traffic sources that exhibit long-term dependence.     

Estimation of the cell loss ratio in ATM networks with a fuzzysystem and application to measurement-based call admission control

An important parameter in asynchronous transfer model (ATM)-based network design and management is the cell loss ratio (CLR) in ATM multiplexers. It is a key parameter to many vital functions in the network such as call admission control (CAC), bandwidth allocation, etc. However, the CLR depends usually on many unknown and unpredictable traffic parameters such as input traffic correlations. In this paper, we propose a simple and robust fuzzy-based algorithm to predict the CLR in large-sized systems based on both a small amount of information from small-sized systems, and the asymptotic behavior for very large systems. Unlike the model-based approaches, our approximation avoids the problem of assuming any traffic parameters or arrival process. This algorithm is used with real-time traffic measurement to propose an effective measurement-based call admission control framework for ATM networks     

多业务DS-CDMA系统的资源分配算法研究

针对提出的业务模型，分析了多业务DS-CDMA系统中各类业务的QoS性能如平均延时、吞吐量及比特差错率等与各类业务的处理增益和功率分配的关系，提出了一种适用于两类业务（一类实时、一类可靠）的优化处理增益和功率分配算法，数据结果表明优化算法可以在保证两类业务QOS的同时提高系统容量及可靠业务的吞吐量。     

On the effects of traffic mixtures in direct broadcast satellite networks

In this paper we present a multi‐criterion control simulation in a realistically complex environment of a satellite network, involving non‐symmetric up and downlinks. Direct broadcast satellite (DBS) networks carrying heterogeneous traffic is characterized with challenges, such as high traffic burstiness, wireless channel dynamics, and large, but limited capacity. On the other hand, there are system characteristics that can be leveraged to address these challenges such as in centralized topology, different levels in quality of service (QoS) and priorities, availability of side information about channel conditions, flexibility in delivery of delay insensitive traffic, etc. We have developed an adaptive resource allocation and management (ARAM) system that takes the advantage of such characteristics to maximize the utilization of the available capacity on the forward DBS link, while maintaining QoS in the presence of channel effects and congestion in the network. Since variable‐bit‐rate (VBR) video traffic is given priority over available‐bit‐rate (ABR) data traffic in the ARAM concept, in this paper we investigate the impact of the fraction of VBR load in overall load. Copyright © 2002 John Wiley & Sons, Ltd.     

车联网中网络切片资源分配方案

为了满足车联网中不同应用的服务质量(Quality of Service, QoS)要求,提出了一种基于网络切片技术的车联网频谱资源分配方案。该方案考虑数据接入控制,通过联合优化频谱资源块(Resource Block, RB)分配和车辆信号发射功率控制,在安全服务切片低时延高可靠性的约束下,最大化信息娱乐服务切片的平均和吞吐量。将车联网资源管理建模为一个混合整数随机优化问题,利用李雅普诺夫(Lyapunov)优化理论将该优化问题分解为接入控制和RB分配与功率控制两个子问题,并分别对其进行求解,得到每个时隙的接入控制和资源分配方案。仿真结果表明,所提出的资源分配方案能够有效提高信息娱乐服务切片的平均和吞吐量,并且可以通过调整引入的控制参数值来实现吞吐量和时延的动态平衡。同时,与已有方案相比,该方案具有更好的时延性能。