Applications of sketches in network traffic measurement: A survey

Accurate and timely network traffic measurement is essential for network status monitoring, network fault analysis, network intrusion detection, and network security management. With the rapid development of the network, massive network traffic brings severe challenges to network traffic measurement. However, existing measurement methods suffer from many limitations for effectively recording and accurately analyzing big-volume traffic. Recently, sketches, a family of probabilistic data structures that employ hashing technology for summarizing traffic data, have been widely used to solve these problems. However, current literature still lacks a thorough review on sketch-based traffic measurement methods to offer a comprehensive insight on how to apply sketches for fulfilling various traffic measurement tasks. In this paper, we provide a detailed and comprehensive review on the applications of sketches in network traffic measurement. To this end, we classify the network traffic measurement tasks into four categories based on the target of traffic measurement, namely cardinality estimation, flow size estimation, change anomaly detection, and persistent spreader identification. First, we briefly introduce these four types of traffic measurement tasks and discuss the advantages of applying sketches. Then, we propose a series of requirements with regard to the applications of sketches in network traffic measurement. After that, we perform a fine-grained classification for each sketch-based measurement category according to the technologies applied on sketches. During the review, we evaluate the performance, advantages and disadvantages of current sketch-based traffic measurement methods based on the proposed requirements. Through the thorough review, we gain a number of valuable implications that can guide us to choose and design proper traffic measurement methods based on sketches. We also review a number of general sketches that are highly expected in modern network systems to simultaneously perform multiple traffic measurement tasks and discuss their performance based on the proposed requirements. Finally, through our serious review, we summarize a number of open issues and identify several promising research directions.     

A self-adaptive synthetic over-sampling technique for imbalanced classification

Traditionally, in supervised machine learning, (a significant) part of the available data (usually 50%-80%) is used for training and the rest—for validation. In many problems, however, the data are highly imbalanced in regard to different classes or does not have good coverage of the feasible data space which, in turn, creates problems in validation and usage phase. In this paper, we propose a technique for synthesizing feasible and likely data to help balance the classes as well as to boost the performance in terms of confusion matrix as well as overall. The idea, in a nutshell, is to synthesize data samples in close vicinity to the actual data samples specifically for the less represented (minority) classes. This has also implications to the so-called fairness of machine learning. In this paper, we propose a specific method for synthesizing data in a way to balance the classes and boost the performance, especially of the minority classes. It is generic and can be applied to different base algorithms, for example, support vector machines, k-nearest neighbour classifiers deep neural, rule-based classifiers, decision trees, and so forth. The results demonstrated that (a) a significantly more balanced (and fair) classification results can be achieved and (b) that the overall performance as well as the performance per class measured by confusion matrix can be boosted. In addition, this approach can be very valuable for the cases when the number of actual available labelled data is small which itself is one of the problems of the contemporary machine learning.     

A study on the monitoring model development for quality measurement of internet traffic

The recent trend of integration among new network services such as the long-term evolution (LTE) based on internet protocol (IP) needs reputable analyses and prediction information on the internet traffic. The IP along with increased internet traffics due to expanding new service platforms such as smartphones will reflect policies such as network QoS according to new services. The establishment of monitoring methods and analysis plans is thus required for the development of internet traffics that will analyze their status and predict their future. The paper with the speed of Internet traffic model is developed for monitoring the state of the experiment and verified. The problem is that the proposed service Internet service provider (ISP) to resolve the conflict between the occurrences can be considerably Internet traffic and that the state of data may be helpful in understanding. The paper advancement policy to reflect the network traffic volume of Internet services and users irradiation with increased traffic due to the development and management of the analysis was carried out experimental measurements.     

TCBR-HMM: An HMM-based text classifier with a CBR system

This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency.     

Multiobjective PSO based adaption of neural network topology for pixel classification in satellite imagery

The proposed work involves the multiobjective PSO based adaption of optimal neural network topology for the classification of multispectral satellite images. It is per pixel supervised classification using spectral bands (original feature space). This paper also presents a thorough experimental analysis to investigate the behavior of neural network classifier for given problem. Based on 1050 number of experiments, we conclude that following two critical issues needs to be addressed: (1) selection of most discriminative spectral bands and (2) determination of optimal number of nodes in hidden layer. We propose new methodology based on multiobjective particle swarm optimization (MOPSO) technique to determine discriminative spectral bands and the number of hidden layer node simultaneously. The accuracy with neural network structure thus obtained is compared with that of traditional classifiers like MLC and Euclidean classifier. The performance of proposed classifier is evaluated quantitatively using Xie-Beni and β indexes. The result shows the superiority of the proposed method to the conventional one.     

Specific emitter identification for satellite communication using probabilistic neural networks

Electromagnetic signal emitted by satellite communication (satcom) transmitters are used to identify specific individual uplink satcom terminals sharing the common transponder in real environment, which is known as specific emitter identification (SEI) that allows for early indications and warning (I&W) of the targets carrying satcom furnishment and furthermore the real time electromagnetic situation awareness in military operations. In this paper, the authors are the first to propose the identification of specific transmitters of satcom by using probabilistic neural networks (PNN) to reach the goal of target recognition. We have been devoted to the examination by exploring the feasibility of utilizing the Hilbert transform to signal preprocessing, applying the discrete wavelet transform to feature extraction, and employing the PNN to perform the classification of stationary signals. There are a total of 1000 sampling time series with binary phase shift keying (BPSK) modulation originated by five types of satcom transmitters in the test. The established PNNs classifier implements the data testing and finally yields satisfactory accuracy at 8 dB(±1 dB) carrier to noise ratio, which indicates the feasibility of our method, and even the keen insight of its application in military.     

Practical Application of the Probabilistic‐Statistical Model of the Suspension Separation in Hydrocyclones

An effective practical approach that allows not only a significant reduction in the scope of practical experiments in the course of studying suspension separation processes in hydrocyclones, but also makes it possible to assess the intensity of random components of the processes and define the interrelation between such components and hydrodynamics of flows in a hydrocyclone is presented. Within the frames of the developed probabilistic‐statistical model of suspension separation in hydrocyclones on the basis of statistical self‐similarity properties, a relationship was found between determined and random components of the processes. This allowed transitioning from three‐parameter probability density functions for suspension particles in hydrocyclones to two‐parameter functions; thus significantly improving the efficiency of practical application of the developed model.     

Profiling drunk driving recidivists in Denmark

Drunk drivers are a menace to themselves and to other road users, as drunk driving significantly increases the risk of involvement in road accidents and the probability of severe or fatal injuries. Although injuries and fatalities related to road accidents have decreased in recent decades, the prevalence of drunk driving among drivers killed in road accidents has remained stable, at around 25% or more during the past 10 years. Understanding drunk driving, and in particular, recidivism, is essential for designing effective countermeasures, and accordingly, the present study aims at identifying the differences between non-drunk drivers, drunk driving non-recidivists and drunk driving recidivists with respect to their demographic and socio-economic characteristics, road accident involvement and other traffic and non-traffic-related law violations. This study is based on register-data from Statistics Denmark and includes information from 2008 to 2012 for the entire population, aged 18 or older, of Denmark. The results from univariate and multivariate statistical analyses reveal a five year prevalence of 17% for drunk driving recidivism, and a significant relation between recidivism and the drunk drivers’ gender, age, income, education, receipt of an early retirement pension, household type, and residential area. Moreover, recidivists are found to have a higher involvement in alcohol-related road accidents, as well as other traffic and, in particular, non-traffic-related offences. These findings indicate that drunk driving recidivism is more likely to occur among persons who are in situations of socio-economic disadvantage and marginalisation. Thus, to increase their effectiveness, preventive measures aiming to reduce drunk driving should also address issues related to the general life situations of the drunk driving recidivists that contribute to an increased risk of drunk driving recidivism.     

Mining citizen emotions to estimate the urgency of urban issues

Crowdsourcing technology offers exciting possibilities for local governments. Specifically, citizens are increasingly taking part in reporting and discussing issues related to their neighborhood and problems they encounter on a daily basis, such as overflowing trash-bins, broken footpaths and lifts, illegal graffiti, and potholes. Pervasive citizen participation enables local governments to respond more efficiently to these urban issues. This interaction between citizens and municipalities is largely promoted by civic engagement platforms, such as See-Click-Fix, FixMyStreet, CitySourced, and OpenIDEO, which allow citizens to report urban issues by entering free text describing what needs to be done, fixed or changed. In order to develop appropriate action plans and priorities, government officials need to figure out how urgent are the reported issues. In this paper we propose to estimate the urgency of urban issues by mining different emotions that are implicit in the text describing the issue. More specifically, a reported issue is first categorized according to the emotions expressed in it, and then the corresponding emotion scores are combined in order to produce a final urgency level for the reported issue. Our experiments use the SeeClickFix hackathon data and diverse emotion classification algorithms. They indicate that (i) emotions can be categorized efficiently with supervised learning algorithms, and (ii) the use of citizen emotions leads to accurate urgency estimates. Further, using additional features such as the type of issue or its author leads to no further accuracy gains.