高话务和高数据流量GPRS优化经验探讨

随着用户对数据业务的需求量越来越大,话音业务和数据业务对现网无线资源的竞争趋向激烈,如何做好在高话务和高数据流量时的GPRS网络优化工作是亟待解决的问题,本文主要讨论了合理分配高话务和高数据流量地区现网无线资源配置,积极试验和应用一系列新技术缓解资源竞争矛盾,摸索出维护和优化高话务和高数据流量地区GPRS网络的经验.     

基于流量工程的软件定义网络控制资源优化机制

针对软件定义网络(SDN)分布式控制平面中由于网络分域管理所引发的控制扩张问题,该文提出了一种基于流量工程的SDN控制资源优化(TERO)机制。首先基于数据流的路径特征对流请求的控制资源消耗进行分析,指出通过调整控制器和交换机的关联关系可以降低控制资源消耗。然后将控制器关联过程分为两个阶段:先设计了最小集合覆盖算法来快速求解大规模网络中控制器关联问题;在此基础上,引入联合博弈策略来优化控制器和交换机的关联关系以减少控制资源消耗和控制流量开销。仿真结果表明,与现有的控制器和交换机就近关联机制相比,该文机制能在保证较低控制流量开销的前提下,节省约28%的控制资源消耗。     

Statistical multiplexing and buffer sharing in multimediahigh-speed networks: a frequency-domain perspective

We study the effectiveness of statistical multiplexing and buffer sharing under the multimedia high-speed networking environment. We focus on the impact of frequency-domain source characteristics on dynamic resource sharing. By applying a novel statistical matching technique, we can, for the first time, investigate the multiplexing performance of a wide-range of realistic traffic sources using sophisticated traffic models. It has been shown that the effectiveness of statistical multiplexing and buffer sharing highly depends on the frequency-domain characteristics of the traffic as well as the corresponding QoS requirements. For practical “low-frequency” sources; e.g., VBR-video streams and LAN-to-LAN traffic, we show that significant savings in bandwidth and buffer-space can be achieved via resource sharing under practical loss and delay constraints. These findings re-illustrate the important role of traffic characteristics in the design/selection of network control strategies. The trade-offs among different design alternatives (e.g., multiplexing versus buffering) and the implications on some control schemes, e.g., traffic shaping/input-rate control, are also discussed     

Source time scale and optimal buffer/bandwidth tradeoff forheterogeneous regulated traffic in a network node

We study the problem of resource allocation and control for a network node with regulated traffic. Both guaranteed lossless service and statistical service with small loss probability are considered. We investigate the relationship between source characteristics and the buffer/bandwidth tradeoff under both services. Our contributions are the following. For guaranteed lossless service, we find that the optimal resource allocation scheme suggests that sources sharing a network node with finite bandwidth and buffer space divide into groups according to time scales defined by their leaky-bucket parameters. This time-scale separation determines the manner by which the buffer and bandwidth resources at the network node are shared among the sources. For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexer using the “extremal” on-off, periodic sources. Under this approach, the optimal resource allocation for statistical service is achieved by maximizing both the benefits of buffering sharing and bandwidth sharing. The optimal buffer/bandwidth tradeoff is again determined by a time-scale separation     

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

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.     

Interdomain traffic engineering with BGP

Traffic engineering is performed by means of a set of techniques that can be used to better control the flow of packets inside an IP network. We discuss the utilization of these techniques across interdomain boundaries in the global Internet. We first analyze the characteristics of interdomain traffic on the basis of measurements from three different Internet service providers and show that a small number of sources are responsible for a large fraction of the traffic. Across interdomain boundaries, traffic engineering relies on a careful tuning of the route advertisements sent via the border gateway protocol. We explain how this tuning can be used to control the flow of incoming and outgoing traffic, and identify its limitations.     

Effective control of traffic flow in ATM networks using fuzzyexplicit rate marking (FERM)

We describe the fuzzy explicit fate marking (FERM) traffic flow control algorithm for a class of best effort service, known as available bit rate (ABR), proposed by the ATM Forum. FERM is an explicit rate marking scheme in which an explicit rate is calculated at the asynchronous transfer mode (ATM) switch and sent back to the ABR traffic sources encapsulated within resource management (RM) cells. The flow rate is calculated by the fuzzy congestion control (FCC) module by monitoring the average ABR queue length and its rate of change, then by using a set of linguistic rules. We use simulation to compare the steady-state and transient performance of FERM with EPRCA (a current favourite by the ATM Forum) in the presence of high priority variable bit rate (VBR) video and constant bit rate (CBR) in both a local-area network (LAN) and a wide-area network (WAN) environment. Our experiments show that FERM exhibits a robust behavior, even under extreme network loading conditions, and ensures fair share of the bandwidth for all virtual channels (VCs) regardless of the number of hops they traverse. Additionally, FERM controls congestion substantially better than EPRCA, offers faster transient response, leads to lower end-to-end delay and better network utilization     

基于BP和RBF神经网络的C-V2X无线资源管理

为了提升蜂窝车联网（Cellular Vehicle-to-Everything,C-V2X）资源复用的有效性和降低终端间的干扰，提出通过神经网络对未来时刻车流量的预测辅助无线资源管理方案。依据车载单元（On Board Unit,OBU）与路侧单元（Road Side Unit,RSU）间的车联网消息，获取RSU覆盖区域内各时刻的车流情况，分别采用BP（Back Propagation）神经网络和RBF（Radial Basis Function）神经网络进行短时交通流预测。RSU根据预测结果进行自适应分簇，簇间复用相同资源，簇内进行资源池的划分，RSU覆盖内的OBU在划分的资源池中选择发送资源，从而减少终端间的干扰，并保证热点区域车辆拥有更多的资源。仿真结果表明，在道路交通拥塞的场景下，所提方案的数据包接收率较标准中的方案提升14%，较典型文献方案提升10%，保证了通信的可靠性。     

Improving QoS Performance in IEEE 802.11e Under Heavy Traffic Loads

IEEE 802.11e standard is a concrete attempt to QoS challenge, but when the volume of traffic flows increases, this approach is not sufficient. Several techniques have been developed to improve WLAN QoS performance, mainly introducing a trade-off between performance and standard compatibility. This work describes the techniques used to enhance EDCA efficiency by suitably regulating standard’s parameters and it introduces an innovative algorithm, named Dynamic TXOP (DTXOP), capable of enhancing fairness between upstream and downstream resource allocation in Wi-Fi networks. Finally, after a brief review of admission control algorithms for QoS support under heavy traffic loads, a suitable admission control scheme is integrated with DTXOP as a possible solution for facing QoS degradation of active sources due to an excessive network load. The benefits obtained by integrating DTXOP and the proposed admission control policy are shown in terms of QoS enhancement and efficiency in resource allocation.     

Traffic Shaping for Resource-Efficient In-Vehicle Communication

In-vehicle communication has become complex and costly due to the growing number of automotive network systems applied for different data types. In this work, our previously proposed in-vehicle network architecture that is based on Internet Protocol (IP) and full-duplex switched Ethernet (IP/Ethernet) is further investigated for real-time audio and video streaming. Quality-of-service (QoS) and resource usage are analyzed for selected IP/Ethernet-based network topologies. Traffic shaping is used to reduce the required network resources and consequently the cost. A novel traffic shaping algorithm is presented that outperforms other traffic shapers in terms of resource usage when applied to variable bit rate video sources in the proposed double star topology. In addition, a new architecture design is introduced for traffic shaper implementation in switches which operates on a per stream basis. Analytical and simulation results confirm that the proposed network architecture with traffic shaping is well-adapted for in-vehicle communication.      

PCC策略控制机制研究及在网络中的部署

PCC (Policy and Charging Control)是3GPP定义的动态策略和计费控制的框架方案,旨在为用户提供差异化的服务,提供用户业务流承载资源保障以及流计费策略.本文介绍了PCC机制的基本架构及相应策略规则,对PCC在现网中的部署进行了探讨,并针对核心网未来的发展趋势给出EPC架构下PCC的部署建议...     

Alleviating contention-induced spurious timeouts in QoS-aware MANETs

The bandwidth is one of the most precious resources in Mobile Ad Hoc Networks (MANETs); their network protocols should therefore be able to achieve an increase in efficiency of bandwidth utilisation. TCP, which implements flow control to regulate the network traffic, plays a significant role in shaping the workload of the network. However, spurious TCP retransmissions can increase the link utilisation, consequently limiting the amount of spare bandwidth available as extensively reported in the literature. This problem is exacerbated by the presence of high priority traffic and traffic differentiation introduced in IEEE 802.11e. In this paper, we focus on the optimisation of TCP for resource efficiency, by limiting the number of contention-induced retransmissions. Using a cross-layer technique, TCP can be notified of the medium contention state and adjusts its retransmission timer accordingly. Our simulation results demonstrate the effectiveness of our proposal in various scenarios. A 15% gain in resource utilisation is obtained, fewer packets are retransmitted thus reducing the overall power consumption and TCP goodput is improved.     

Importance sampling for the estimation of buffer overflow probabilities via trace-driven simulations

We develop an importance sampling technique that can be used to speed up the simulation of a model of a buffered communication multiplexer fed by a large number of independent sources. The sources generate traffic according to a periodic function with a random phase. This traffic model accommodates a wide range of situations of practical interest, including ON-OFF periodic traffic models and sequences of bit rates generated by actual variable bit rate sources, such as MPEG video compressors. The simulation seeks to obtain estimates for the buffer overflow probability that in most cases of interest is very small. We use a large deviations result to devise the change of measure used in the importance sampling technique and demonstrate through numerical results that this change of measure leads to a dramatic reduction in the required simulation time over direct Monte Carlo simulation. Possible practical applications include short-term network resource planning and even real-time call admission control.     

异步转移模式（ATM）的研究现状与前景

ＡＴＭ是实现宽带综合业务数字网（Ｂ－ＩＳＤＮ）关键技术之一。本文综述了ＡＴＭ近几年来在网路控制、业务模型、资源分配、允许接入控制、流量控制以及选路控制等诸多方面的研究进展与存在问题，并提出了实现ＡＴＭ综合多种业务与有效利用网路资源这一目标的途径。     

ABR流量控制-一种神经网络方法

本文提出ATM网络中ABR业务流量控制的一种基于神经网络方法。利用神经网络对缓冲队列的长度及其变化和相应可能的信元丢失率进行预测,通过自适应地调整业务源端的发送速率,从而更准确地确定RM信元中相应域的显式速率值。同传统静态反馈方法相比,本方法不仅提高了网络资源利用率,而且改善了信元丢失率。另外,对在具有CBR背景业务情况下本方法的性能也进行了讨论,仿真结果证明了神经网络方法的有效性。     

Scalable connection-based flow control scheme for application-specific network-on-chip

In this paper,a scalable connection-based flow control scheme is proposed for application-specific network-on-chip(NoC).The proposed scheme exploits two distinctive characteristics of NoC,namely traffic predictability and abundant wire resource,to achieve significant performance enhancements.First,the burst injection data are regulated into constant data streams and a connection-based method is used to ensure that all links are not overloaded at any time.Consequently,the number of packets in the network is decreased,leading to a reduced congestion probability and improved communication performance.Second,a simple architecture of the central controller is proposed to guarantee that the proposed scheme has small area overhead and is scalable.Simulation results show that compared with traditional switch-to-switch(STS) flow control scheme and pre-allocation based flow control schemes,the proposed scheme greatly increases the throughput and cuts down the average latency with reasonable area and energy overhead.     

Implicit admission control

Internet protocols currently use packet-level mechanisms to detect and react to congestion. Although these controls are essential to ensure fair sharing of the available resource between multiple flows, in some cases they are insufficient to ensure overall network stability. We believe that it is also necessary to take account of higher level concepts, such as connections, flows, and sessions when controlling network congestion. This becomes of increasing importance as more real-time traffic is carried on the Internet, since this traffic is less elastic in nature than traditional Web traffic. We argue that, in order to achieve better utility of the network as a whole, higher level congestion controls are required. By way of example, we present a simple connection admission control (CAC) scheme which can significantly improve the overall performance. This paper discusses our motivation for the use of admission control in the Internet, focusing specifically on control for TCP flows. The technique is not TCP specific, and can be applied to any type of flow in a modern IP infrastructure. Simulation results are used to show that it can drastically improve the performance of TCP over bottleneck links. We go on to describe an implementation of our algorithm for a router running the Linux 2.2.9 operating system. We show that by giving routers at bottlenecks the ability to intelligently deny admission to TCP connections, the goodput of existing connections can be significantly increased. Furthermore, the fairness of the resource allocation achieved by TCP is improved     

一种新的卫星通信网流量预测算法

在通信网络的设计中,使用基于流量预测的网络规划已成为LTE发展的必然趋势。与地面网络不同,卫星网络由于受资源受限和拓扑时变的不利影响,其流量预测算法必须能兼顾精度和效率,这令传统的地面网络预测方法已不再适用。为了解决以上问题,提出了一种新的基于小波回声状态网络的流量预测算法,该算法通过小波多尺度分解的信号处理方法屏蔽了网络流量的噪声,而后结合了无反馈的回声状态网络联合进行预测。仿真证明,新算法相比传统算法能大幅提升网络流量的预测精度和运行效率,为卫星网络的流量规划提供了强有力的决策支持。     

Performance of in-call buffer/window allocation schemes for short intermittent file transfers over broadband packet networks

While static open loop rate controls may be adequate for handling continuous bit rate (CBR) traffic, relatively smooth data traffic, and relatively low speed bursty data traffic over broadband integrated networks, high speed bursty data sources need more dynamic controls. Burst level resource allocation is one such dynamic control. Potential benefits and other issues for burst level resource parameter negotiations for bursty data traffic over high speed wide area packet networks have been discussed earlier.^1–6 A detailed analysis of an adaptive buffer/window negotiation scheme for long file transfers using these concepts is presented in Reference 1. In this paper we discuss two burst level buffer/window negotiation schemes for short intermittent file transfers, focusing on the specific needs of such traffic streams. We develop closed network of queues models to reflect the behaviour of the proposed schemes. These models, while being simple, capture essential details of the control schemes. Under fairly general assumptions, the resulting network of queues is of product form and can be analysed using the mean value analysis. We use such an analysis to compare the proposed schemes and to determine appropriate sizes of trunk buffers to achieve the desired balance between bandwidth utilization and file transfer delay. The effects of other parameters on the performance of these schemes as well as on the buffer sizing rules are also discussed. Burst level (in-call) parameter negotiation may be carried out by the end system with the network elements or by an interface system (access controller) with the broadband network elements. We discuss implications of this location as well as the needed protocol features. Finally, the service discrimination capabilities desired at the trunk controllers in switching nodes are briefly discussed.     

Architecture for dynamic and fair distribution of bandwidth

The problem of fair distribution of available bandwidth among traffic flows or aggregates remains an essential issue in computer networks. This paper introduces a novel approach, called the E x act B andwidth D istribution S cheme (X‐BDS), for dynamic and fair distribution of available bandwidth among individual flows. In this approach, the edge routers keep per‐flow information, while the core routers maintain the aggregate flow requirements. The X‐BDS approach employs a distributed message exchange protocol for providing network feedback and for distributing aggregate flow requirements among the nodes in the network. Based on the obtained feedback, the edge routers employ the X‐BDS resource management unit to dynamically distribute available bandwidth among individual flows. The X‐BDS admission control and resource management units are responsible for fair resource allocation that supports minimum bandwidth guarantees of individual flows. This paper evaluates the Bandwidth Distribution Scheme through simulation and shows that the X‐BDS is capable of supporting per‐flow bandwidth guarantees in a dynamically changing network environment. Copyright © 2006 John Wiley & Sons, Ltd.