自适应流量评估方法在IDC网络的应用

为了确保IDC网络的服务质量,往往需要了解IDC网络中各出口、各链路的网络拥塞、大规模网络攻击等流量信息并进行及时全量的数据监测和分析.本文提出了一种自适应流量评估方法,通过测量精度和存储资源两方面的调控,来优化现有的流量测量技术.     

WPANFIS: combine fuzzy neural network with multiresolution for network traffic prediction

A novel methodology for prediction of network traffic,WPANFIS,which relies on wavelet packet transform(WPT)for multi-resolution analysis and adaptive neuro-fuzzy inference system(ANFIS)is proposed in this article.The widespread existence of self-similarity in network traffic has been demonstrated in earlier studies,which exhibits both long range dependence(LRD)and short range dependence(SRD).Also,it has been shown that wavelet decomposition is an effective tool for LRD decorrelation.The new method uses WPT as extension of wavelet transform which can decoorrelate LRD and make more precisely partition in the high-frequency section of the original traffic.Then ANFIS which can extract useful information from the original traffic is implemented in this study for better prediction performance of each decomposed non-stationary wavelet coefficients.Simulation results show that the proposed WPANFIS can achieve high prediction accuracy in real network traffic environment.     

Network services and traffic engineering methods for supporting applications on the VTHD experimental gigabit network

vthd is a high-performanceip experimental network. This network and associated research projects have been partially funded by the French government through the French Research Network for Telecommunications (rnrt) in order to support the development of leading-edge network services on the one hand, and test a wide-scale deployment of advanced Internet applications on the other hand. This paper describes the network services that were deemed necessary to support the deployment of innovative applications, as well as several of the applications that have been experimented on the network. It also presents a selection of the traffic engineering methods and experiments that have been developed in the course of thevthd related research projects. This article describes the collective works of members of the project partners, which are represented by the set of authors for the present paper.     

Cluster processes: a natural language for network traffic

We introduce a new approach to the modeling of network traffic, consisting of a semi-experimental methodology combining models with data and a class of point processes (cluster models) to represent the process of packet arrivals in a physically meaningful way. Wavelets are used to examine second-order statistics, and particular attention is paid to the modeling of long-range dependence and to the question of scale invariance at small scales. We analyze in depth the properties of several large traces of packet data and determine unambiguously the influence of network variables such as arrival patterns, durations, and volumes of transport control protocol (TCP) flows and internal flow structure. We show that session-level modeling is not relevant at the packet level. Our findings naturally suggest the use of cluster models. We define a class where TCP flows are directly modeled, and each model parameter has a direct meaning in network terms, allowing the model to be used to predict traffic properties as networks and traffic evolve. The class has the key advantage of being mathematically tractable, in particular, its spectrum is known and can be readily calculated, its wavelet spectrum deduced, interarrival distributions can be obtained, and it can be simulated in a straightforward way. The model reproduces the main second-order features, and results are compared against a simple black box point process alternative. Discrepancies with the model are discussed and explained, and enhancements are outlined. The elephant and mice view of traffic flows is revisited in the light of our findings.     

Autonomic traffic engineering for network robustness

The continuously increasing complexity of communication networks and the increasing diversity and unpredictability of traffic demand has led to a consensus view that the automation of the management process is inevitable. Currently, network and service management techniques are mostly manual, requiring human intervention, and leading to slow response times, high costs, and customer dissatisfaction. In this paper we present AutoNet, a self-organizing management system for core networks where robustness to environmental changes, namely traffic shifts, topology changes, and community of interest is viewed as critical. A framework to design robust control strategies for autonomic networks is proposed. The requirements of the network are translated to graph-theoretic metrics and the management system attempts to automatically evolve to a stable and robust control point by optimizing these metrics. The management approach is inspired by ideas from evolutionary science where a metric, network criticality, measures the survival value or robustness of a particular network configuration. In our system, network criticality is a measure of the robustness of the network to environmental changes. The control system is designed to direct the evolution of the system state in the direction of increasing robustness. As an application of our framework, we propose a traffic engineering method in which different paths are ranked based on their robustness measure, and the best path is selected to route the flow. The choice of the path is in the direction of preserving the robustness of the network to the unforeseen changes in topology and traffic demands. Furthermore, we develop a method for capacity assignment to optimize the robustness of the network.     

IP network configuration for intradomain traffic engineering

The smooth operation of the Internet depends on the careful configuration of routers in thousands of autonomous systems throughout the world. Configuring routers is extremely complicated because of the diversity of network equipment, the large number of configuration options, and the interaction of configuration parameters across multiple routers. Network operators have limited tools to aid in configuring large backbone networks. Manual configuration of individual routers can introduce errors and inconsistencies with unforeseen consequences for the operational network. In this article we describe how to identify configuration mistakes by parsing and analyzing configuration data extracted from the various routers. We first present an overview of IP networking from the viewpoint of an Internet service provider and describe the kinds of errors that can appear within and across router configuration files. To narrow the scope of the problem, we then focus our attention on the configuration commands that relate to traffic engineering-tuning the intradomain routing protocol to control the flow of traffic through the ISP network. We present a case study of a prototype tool, developed in collaboration with AT&T IP Services, for checking the configuration of the AT&T IP Backbone and providing input to other systems visualization and traffic engineering     

Advanced traffic control methods for network management

The objectives of network management control are outlined, and two categories of control are defined: network traffic controls and network configuration controls. Network traffic controls are further classified into traffic volume controls and routing controls, and advanced techniques for achieving each of them are examined. Two classes of methods for specifying the amount of traffic to be controlled are described. In proportional control, a certain proportion of the traffic offered by each exchange is admitted; in threshold control, there is a maximum rate at which the traffic offered by each exchange is admitted. The TCS-V2 traffic-control system, an advanced automatic code-blocking system that uses area and subscriber congestion control, is considered, and the simulated performance of proportional control and threshold control is compared for this system. For routing control, an advanced state-dependent dynamic routing scheme is examined, and the results of a comparative evaluation of dynamic routing schemes are presented     

FlowAntEater: network traffic automatic signature generator

In the areas of traffic classification, the payload signature-based classification method–deep packet inspection (DPI) shows the highest performance in terms of preciseness, reliability and practicality. The usual way, however, obtaining signatures for DPI is analyzing network traffic payload and find signatures by hand, which means inefficient and a heavy burden for researchers. Therefore, the research on network traffic automatic signatures generation (NTASG), which helps administrators and researcher find network signatures, becomes important. In this paper, a software framework on NTASG is proposed which uses the K-means cluster algorithm to purity the traffic flow and contains a systematic signatures management algorithm, sig-tree. Also, the feasibility of our design choices was proved via experimental evaluation on the campus traffic trace.     

Java for network management applications

Java preserves much of C++, and offers compelling benefits: it is object-oriented, portable and relatively easy to master and maintain. These, and other benefits, can greatly speed the development cycle for Web-based network management applications. This article discusses these issues, and gives an overview of Java's relevance for network managers. © 1998 John Wiley & Sons, Ltd.     

Adaptive algorithms for reducing PCS network authentication traffic

Two authentication schemes (ASs) have been proposed in the Electronic Industry Association/Telecommunications Industry Association's (EIA/TIA) Telecommunications Systems Bulletins (TSBs) 51 for incorporation in the cellular industry Interim Standard IS 41 Revision C. In the first scheme, which we refer to as the WS scheme, a unique secret key [also known as shared secret data (SSD)] is shared only between the authentication center (AC) and handset. In the second scheme, referred to as the S scheme, the SSD is also shared with the visited system. The performance of the two schemes can be compared by using the expected number of call originations/terminations between two consecutive registrations or call-to-mobility ratio (CMR). Based on the message flow (accesses to databases), it is apparent that the S scheme outperforms the WS schemes if the CMR ratio is large. The CMRs of users will likely span a wide range and, even for the same user, will perhaps vary from time to time. It is therefore desirable to switch between the ASs based on the users' CMR to reduce the signaling network traffic. We propose two adaptive algorithms to determine how and when to switch between the ASs for a given user. Our performance study indicates that as the CMR of a user changes, the adaptive algorithms automatically select the best AS in real time     

Ultrascience net: network testbed for large-scale science applications

UltraScienceNet is an experimental wide area network testbed to enable the development of networking technologies required for next-generation large-scale scientific applications. It provides on-demand dedicated high-bandwidth channels for large data transfers, and also high-resolution high-precision channels for fine control operations. In the initial deployment its data plane consists of several thousand miles of dual 10 Gb/s lambdas. The channels are provisioned on demand using layer 1 and 2 switches in the backbone and multiple service provisioning platforms at the edges in a flexible configuration using a secure control plane. A centralized scheduler is employed to compute future channel allocations, and a signaling daemon is used to generate the configuration signals to switches at appropriate times. The control plane is implemented using an out-of-band virtual private network, which encrypts the switching signals, and also provides authenticated user and application access. Transport experiments are conducted on a smaller test connection that provides us useful information about the basic properties and issues of utilizing dedicated channels in applications.     

Method of data cleaning for network traffic classification

Network traffic classification aims at identifying the application types of network packets. It is important for Internet service providers （ISPs） to manage bandwidth resources and ensure the quality of service for different network applications However, most classification techniques using machine learning only focus on high flow accuracy and ignore byte accuracy. The classifier would obtain low classification performance for elephant flows as the imbalance between elephant flows and mice flows on Internet. The elephant flows, however, consume much more bandwidth than mice flows. When the classifier is deployed for traffic policing, the network management system cannot penalize elephant flows and avoid network congestion effectively. This article explores the factors related to low byte accuracy, and secondly, it presents a new traffic classification method to improve byte accuracy at the aid of data cleaning. Experiments are carried out on three groups of real-world traffic datasets, and the method is compared with existing work on the performance of improving byte accuracy. Experiment shows that byte accuracy increased by about 22.31% on average. The method outperforms the existing one in most cases.     

高负荷GSM网络的优化技术

文章给出了现有GSM网络高负荷区域的定义,结合高负荷区域的特点和面临的问题,从网络结构调整、频率规划与载频配置、业务均衡分担、网络参数调整4个方面讨论了相应的优化技术,以期解决网络建设运营中的一些实际问题.     

Exploiting efficiency of ultra-dense wavelength switched network for carrying metro network traffic

Photonic Network Communications - In the 5G era, metro optical networks would need to meet more stringent quality of service requirements. They would have to operate with high spectral efficiency...     

Key derivation for network management applications

This article describes a key derivation method that greatly simplifies key distribution issues for network management (NM) applications and may in some cases relieve NM stations from the need to store any keys at all. This method is easily generalized for network protocols and applications where several “masters” need to talk to a large number of “slaves”. It shows a way to cut down on the amount of keys stored with little impact on security. This is especially important when human users are involved     

Multiscale nature of network traffic

The complexity and richness of telecommunications traffic is such that one may despair to find any regularity or explanatory principles. Nonetheless, the discovery of scaling behavior in teletraffic has provided hope that parsimonious models can be found. The statistics of scaling behavior present many challenges, especially in nonstationary environments. In this article, we overview the state of the art in this area, focusing on the capabilities of the wavelet transform as a key tool for unraveling the mysteries of traffic statistics and dynamics     

Pricing network resources for adaptive applications

The Differentiated Services framework (DiffServ) has been proposed to provide multiple Quality of Service (QoS) classes over IP networks. A network supporting multiple classes of service also requires a differentiated pricing structure. In this work, we propose a pricing algorithm in a DiffServ environment based on the cost of providing different levels of services, and on long-term average user resource demand of a service class. We integrate the proposed service-dependent pricing scheme with a dynamic pricing and service negotiation environment by considering a dynamic and congestion-sensitive pricing component. Pricing network services dynamically based on the level of service, usage, and congestion allows a more competitive price to be offered, allows the network to be used more efficiently, and provides a natural and equitable incentive for applications to adapt their service requests according to network conditions. We also develop the demand behavior of adaptive users based on a physically reasonable user utility function. Simulation results show that a congestion-sensitive pricing policy coupled with user rate adaptation is able to control congestion and allows a service class to meet its performance assurances under large or bursty offered loads, even without explicit admission control. Users are able to maintain a stable expenditure, and allowing users to migrate between service classes in response to price increases further stabilizes the individual service prices. When admission control is enforced, congestion-sensitive pricing still provides an advantage in terms of a much lower connection blocking rate at high loads.