Offline/realtime traffic classification using semi-supervised learning

Identifying and categorizing network traffic by application type is challenging because of the continued evolution of applications, especially of those with a desire to be undetectable. The diminished effectiveness of port-based identification and the overheads of deep packet inspection approaches motivate us to classify traffic by exploiting distinctive flow characteristics of applications when they communicate on a network. In this paper, we explore this latter approach and propose a semi-supervised classification method that can accommodate both known and unknown applications. To the best of our knowledge, this is the first work to use semi-supervised learning techniques for the traffic classification problem. Our approach allows classifiers to be designed from training data that consists of only a few labeled and many unlabeled flows. We consider pragmatic classification issues such as longevity of classifiers and the need for retraining of classifiers. Our performance evaluation using empirical Internet traffic traces that span a 6-month period shows that: (1) high flow and byte classification accuracy (i.e., greater than 90%) can be achieved using training data that consists of a small number of labeled and a large number of unlabeled flows; (2) presence of “mice” and “elephant” flows in the Internet complicates the design of classifiers, especially of those with high byte accuracy, and necessitates the use of weighted sampling techniques to obtain training flows; and (3) retraining of classifiers is necessary only when there are non-transient changes in the network usage characteristics. As a proof of concept, we implement prototype offline and realtime classification systems to demonstrate the feasibility of our approach.     

Adaptive wormhole routing in k-ary n-cubes

Distributed memory multiprocessor (DMMP) systems have gained much attention because their performance can be easily scaled up by increasing the number of processor-memory modules. The k-ary n-cube is the most popular interconnection network topology currently used in DMMPs. Wormhole routing is one of the most promising switching technology and has been used in many new generation multicomputers. Wormhole routing makes the communication latency insensitive to the network diameter and reduces the size of the channel buffer of each router. The concept of virtual channels and virtual networks are widely invented for deadlock-free design. A fully adaptive wormhole routing method for k-ary n-cubes has been proposed by Linder in 1991 [10]. Unfortunately, the need of 2^{n − 1} virtual networks makes it unreasonable. In this paper, we propose a virtual network system to support an adaptive, minimal and deadlock free routing in k-ary n-cubes. It uses only four virtual networks but can get a higher degree of adaptability and higher traffic capacity. Simulation results are presented to verify the performance.     

基于多重映射的自动短文摘方法

传统自动文摘一般对字数没有明确限制,运用传统技术进行短文摘提取时,受字数限制,难以获取均衡的性能。针对该问题,提出一种多重映射的自动短文摘方法。通过计算关联度映射值、长度映射值、标题映射值和位置映射值,分别形成多个候选文摘句子集;再运用多重映射策略,将多个候选子集映射到文摘句子集中,同时使用提取文本中心句的方法提高召回率。实验表明,多重映射可在短文摘提取上获得稳定的性能。在NLP&CC2015评测中,该方法的ROUGE-1测试F值达到0.49,ROUGE-2测试F值达到0.35,均优于评测的平均水平,表明了该方法的有效性。     

Analytical modeling and performance of dual-bus high-speed networks under the Adaptive Cycle Cell Insertion (ACCI) protocol

Adaptive Cycle Cell Insertion (ACCI) is a MAC protocol which has been introduced by Baiocchi et al. in 1990. It was designed for use in high-speed (broadband) MANs utilizing a dual-bus topology and to be compatible for operation in an ATM environment. The performance evaluation of ACCI has been provided in terms of simulations; in addition, the mean access delay was evaluated only for the case of single cells. We present in this paper an analytical model to estimate the average frame delays in a dual-bus network operating under the ACCI protocol. Moreover, the model incorporates the case where the number of cells in a frame is given by a general, positive integer, random variable. Results for several different traffic patterns are presented and the accuracy of the analytical estimates for frame delays at arbitrary stations is compared with simulations.     

Transient detection with an application to a chemical process

We propose a sequential test procedure for transient detections in a stochastic process which can be expressed as an autoregressive moving average (ARMA) model. Preliminary analysis shows that if an ARMA(p,q) time series exhibits a transient behavior, then its residuals behave as an ARMA(Q,Q) process, where Q ≤ p + q. Based on this fact, we derive a new sequential test to determine when a transient behavior occurs in a given ARMA time series. Simulation experiments conducted in this study show that the proposed test can detect the occurrence of a transient in the ARMA model. We also apply the proposed method to detect transient changes in the pH of an erythromycin salt.     

Mesh-Mon: A multi-radio mesh monitoring and management system

Mesh networks are a potential solution for providing communication infrastructure in an emergency. They can be rapidly deployed by first responders in the wake of a major disaster to augment an existing wireless or wired network. We imagine a mesh node with multiple radios embedded in each emergency vehicle arriving at the site to form the backbone of a mobile wireless mesh. The ability of such a mesh network to monitor itself, diagnose faults and anticipate problems are essential features for its sustainable operation. Typical SNMP-based centralized solutions introduce a single point of failure and are unsuitable for managing such a network. Mesh-Mon is a decentralized monitoring and management system designed for such a mobile, rapidly deployed, unplanned mesh network and works independently of the underlying mesh routing protocol. Mesh-Mon nodes are designed to actively cooperate and use localized algorithms to predict, detect, diagnose and resolve network problems in a scalable manner. Mesh-Mon is independent of the underlying routing protocol and can operate even if the mesh routing protocol completely fails. One novel aspect of our approach is that we employ mobile users of the mesh, running software called Mesh-Mon-Ami, to ferry management packets between physically-disconnected partitions in a delay-tolerant-network manner. The main contributions of this paper are the design, implementation and evaluation of a comprehensive monitoring and management architecture that helps a network administrator proactively identify, diagnose and resolve a range of issues that can occur in a dynamic mesh network. In experiments on Dart-Mesh, our 16-node indoor mesh testbed, we found Mesh-Mon to be effective in quickly diagnosing and resolving a variety of problems with high accuracy, without adding significant management overhead.     

Pattern classification of non-sparse data using optimal interpolative nets

In this paper we introduce two pattern classifiers for non-sparse data (i.e. data with overlapping class distributions) which use the optimal interpolative neural network (OI-net), derived by one of the authors based on a generalized Fock (GF) space formulation. We present a statistical pattern classifier operating as a two-stage algorithm. The first stage consists of a pre-processing operation involving a k-N N editing of the original training set T. The operation results in a new training set, T_e, which in the second stage is classified by an OI-net constructed by the recursive least squares algorithm. We also propose a new data specific classifier which has an additional third computational stage, in which samples of the original training set are added to the network piece by piece until satisfactory classification results are obtained. During the computation process the training set is iteratively updated until the number of mis-classified samples is minimized. The performance of these two classifiers has been evaluated in some illustrative examples.     

FISDR:一种新的故障注入无线传感器网络性能评估系统

在无线传感器网络WSN中,可靠性和容错性是评价WSN稳定性的重要指标。在WSN的实际应用中常会发生很多故障(Fault)和干扰,采用故障注入FI技术可以向WSN人为地注入这些故障和干扰,通过观察注入故障后网络的反应来评价网络的可靠性和容错性,从而对网络机制进行改进来提高网络的可靠性和稳定性。本文提出的FISDR是一种采用故障注入的WSN性能评估系统,基于软件故障注入方法,采用一对一的方式通过特殊接口与WSN节点连接,向WSN节点注入故障命令。该系统一是可以有效地向WSN注入各种实际应用时可能遇到的故障和干扰并观察网络运行的状况;二是可以接收包括WSN节点和其它各种设备通过特殊接口发来的数据,并将其存储;三是配有上位机软件对网络拓扑结构进行监控、对传输成功率进行统计并对存储的大量信息进行分析,从而对WSN网络及其可靠性做出评价。本系统在一栋五层办公楼分别用数十个WSN节点和FISDR节点做实验,实验内容包括使用FISDR向WSN注入大规模的故障并统计网络的反应状况,验证FISDR故障注入的效果,从而对FISDR的性能进行测试和分析。实验结果表明,FISDR可以有效地向WSN注入各种故障以评价其可靠性,在测试WSN及其可靠性评价方面有很高的应用价值。     

Asynchronous reservation protocol for variable-sized messages in a WDM-based local network

In this paper, we propose and analyse an asynchronous reservation protocol for a very high-speed optical LAN using a passive star topology. Each node is equipped with a single tunable transmitter and a single tunable receiver, both of which are tunable over a range of wavelengths. A separate channel, called the control channel, is used to coordinate message transmissions on the other channels, called data channels. We consider random and idle selection schemes for the data channel selection strategy. The proposed protocol can efficiently support variable-sized messages. It is operated asynchronously, i.e. data channels are not slotted and the control channel is slotted with the size of a control packet. Also, the protocol is scalable, hence the network can accommodate a variable number of nodes. Any new node can join the network without network reinitialization. Moreover, with the protocol one can avoid destination conflicts. We analyse its performance by using the equilibrium point analysis (EPA) method, and validate the results by simulation. According to the numerical results, the asynchronous protocol achieves higher throughput than the synchronous one.     

The indirect k-ary n-cube for a vector processing environment

In an earlier paper we introduced an indirect binary n-cube memory server network which has adaptive properties making it useful in a parallel vector processing environment. The memory server network, due to a special choice in the design of the basic switch node, has the property that N vector processors issuing vector fetches with similar strides are forced into lock step after an initial startup investment.

In this paper we extend this work to the case of the indirect k-any n-cube. As this network has a more favorable memory latency scaling of log_kN, one expects that the short vector performance will be improved as k is increased for a given N. We find this to be the case. We also find that the cost of the memory server system scales in a manner which prefers modest values of k above 2.     

Class-specific quality of service guarantees in multimedia communication networks

We consider the problem of quality-of-service (QoS) provisioning in modern high-speed, multimedia, communication networks. We quantify QoS by the probabilities of loss and excessive delay of an arbitrary packet, and introduce the model of a multiclass node (switch) which provides network access to users that may belong to multiple service classes. We treat such a node as a stochastic system which we analyze and control. In particular, we develop an analytical approach to estimate both the delay and the buffer overflow probability per service class, based on ideas from large deviations and optimal control. We exploit these performance analysis results by devising a call admission control algorithm which can provide per class QoS guarantees. We compare the proposed approach to alternative worst-case and effective bandwidth-based schemes and argue that it leads to increased efficiency. Finally, we discuss extensions to the network case in order to provide end-to-end QoS guarantees.     

A M/D/1 vacation queue model for a signalized intersection

We consider a queueing system that arises in the modeling of isolated signalized intersections in a urban transportation network. In this system, the server alternates in two states, attended or removed, in respect to the queue, while in each state, the server will spend a constant time period with different value. It is assumed that the server is able to disperse up to r(r≥1) customers during a constant service cycle. The evolution of this queueing system can be characterized by a Markov chain embedded at equally spaced time epochs along the time axis. Transition matrix of this Markov chain is of the M/G/1 type introduced by Neuts so that matrix analytical method can be applied to obtain the necessary and sufficient criterion for ergodicity of this Markov chain as well as to compute its stationary distribution. Furthermore, the queue length and waiting time distributions with other performance measures are also given in this paper.     

Performance evaluation of multicast communication in packet-switched networks

In this paper we describe the theoretical background and practical application of QNA-MC (queueing network analyser supporting multicast), a tool for the analytical evaluation of multicast protocols. QNA-MC is based on the QNA method, which (approximately) analyses open networks of GI|G|m queues. In contrast to standard QNA, QNA-MC allows for the specification and evaluation of multicast routes. As in real multicast communication, packets leaving a particular node can be copied and deterministically routed to several other nodes. In order to analyse such queueing networks, QNA-MC converts the multicast routes to a suitable input for standard QNA. From the results delivered by QNA, QNA-MC then derives several performance measures for multicast streams in the network. A validation of QNA-MC, via a comparison to simulation results, shows that QNA-MC yields very good results. Finally, we give a detailed application example by evaluating different multicast routing algorithms for a realistic video conferencing scenario in the European MBONE.     

Modeling buffer utilization in cell-based networks

Variable bit rate traffic is characteristically bursty and the arrivals are highly correlated. New network technology carries such traffic in cell-based networks where the service is a discrete time, deterministic process with the service rate determined by bandwidth negotiated by the user. Managing such networks is hard, and predicting cell loss at a station with limited buffer capacity K is essential to enable the user to negotiate his quality of service requirements. We present an analysis to determine the queue length distribution and the loss probability in such circumstances. For our analysis, we use an m-phase Markov Modulated Bernoulli Process with binomial distributed batch arrivals and deterministic service and limited capacity K, i.e. a MMBP^[X]_(m)/D/1 − K queuing system. We show that the system can be analyzed using the so-called unfinished work approach. The validity of our evaluation technique is illustrated by comparing our analytical results against those obtained from an event-driven siimulation of the same system.     

ANTS: Agents on Networks, Trees, and Subgraphs

Efficient exploration of large networks is a central issue in data mining and network maintenance applications. In most existing work there is a distinction between the active ‘searcher’ which both executes the algorithm and holds the memory and the passive ‘searched graph’ over which the searcher has no control at all. Large dynamic networks like the Internet, where the nodes are powerful computers and the links have narrow bandwidth and are heavily-loaded, call for a different paradigm, in which a noncentralized group of one or more lightweight autonomous agents traverse the network in a completely distributed and parallelizable way. Potential advantages of such a paradigm would be fault tolerance against network and agent failures, and reduced load on the busy nodes due to the small amount of memory and computing resources required by the agent in each node. Algorithms for network covering based on this paradigm could be used in today’s Internet as a support for data mining and network control algorithms. Recently, a vertex ant walk ( ) method has been suggested [I.A. Wagner, M. Lindenbaum, A.M. Bruckstein, Ann. Math. Artificial Intelligence 24 (1998) 211–223] for searching an undirected, connected graph by an a(ge)nt that walks along the edges of the graph, occasionally leaving ‘pheromone’ traces at nodes, and using those traces to guide its exploration. It was shown there that the ant can cover a static graph within time nd, where n is the number of vertices and d the diameter of the graph. In this work we further investigate the performance of the method on dynamic graphs, where edges may appear or disappear during the search process. In particular we prove that (a) if a certain spanning subgraph S is stable during the period of covering, then the method is guaranteed to cover the graph within time nd_s, where d_s is the diameter of S, and (b) if a failure occurs on each edge with probability p, then the expected cover time is bounded from above by nd((logΔ/log(1/p))+((1+p)/(1−p))), where Δ is the maximum vertex degree in the graph. We also show that (c) if G is a static tree then it is covered within time 2n.     

CTES中基于规则的网络业务流测量新方法

业务流设计是网络工程的一个重要方面 ,用于网络的性能评价和性能优化 .中国高速信息示范网 (CAIN-ONET)业务流设计系统 (CTES)的目的是对 CAINONET网络的性能进行评价 ,为其优化提供决策依据 .而为达到优化网络性能目标 ,首先要对 CAINONET网络业务进行实时测量 .在综合分析已有各种网络测量方法的基础上 ,我们提出了一种新的基于规则的业务流测量方法 - CTES规则测量方法 ,并在 CTES中进行了应用 ,解决了已有测量方法的一些不足     

基于FAHP的网络性能综合评价的研究*

针对工业现场对有线/无线异构网络的性能要求,提出了一种基于模糊层次分析法( FAHP)的网络性能综合评价方法,着重分析了网络的综合性能指标参数的获取和利用FAHP算法确定各指标权重的过程。通过对不同业务和参数的多媒体仿真网络的性能评价验证算法的准确性,最后针对一个具体的有线/无线异构仿真网络进行评价,比较了不同用户要求下得到的网络性能综合评价值。实验结果表明,采用基于FAHP的网络性能评价算法对于工业异构网络的性能评价是准确有效的。     

基于排队网络的网络服务器性能分析与优化

针对网络服务器在用户数量和状态相对复杂情况下无法对服务器性能进行有效分析的问题,提出了一种基于排队网络的服务器性能分析方法。该方法可以有效降低时间复杂度和空间复杂度,使服务器性能分析更加精确,效率更高。实验结果表明,利用该方法对服务器性能进行建模和分析,并根据分析结果对服务器程序进行优化,可以达到合理利用系统资源、提高服务器性能的要求。     

Cost–Performance Optimization of Application- and Context-Aware Distributed Infrastructures

Application- and context-aware infrastructures involve the network in the execution of distributed applications through special devices, namely, the application cards, placed in network nodes. The sharp separation of applications and network is smoothed, and by performing part of the distributed application inside the network, it is possible to reduce costs and improve performance with a better optimization of the whole distributed information and communication technology (ICT) infrastructure. This optimization is allowed by the additional degrees of freedom of placing cards in nodes and of assigning applications to such cards. In this paper, we provide an optimization algorithm that minimizes the total cost of the entire distributed ICT infrastructure, given a target performance objective defined as the end-to-end delay for the completion of the distributed application tasks. We focus on two sample applications that are well suited for application- and context-aware infrastructures: caching and protocol translation. The joint optimization of computing and communication resources is an innovative contribution of this paper, as, in the literature, hardware and network components are typically optimized separately. Results show that the total infrastructural cost savings are in the range of 15%-20%. However, savings can be obtained only if cards satisfy a cost-performance curve that is also analyzed.