Research Article  Open Access
Xiaan Bi, Xiaohui Wang, Luyun Xu, Sheng Chen, Hong Liu, "Multilevel Bloom Filters for P2P Flows Identification Based on Cluster Analysis in Wireless Mesh Network", Discrete Dynamics in Nature and Society, vol. 2015, Article ID 801934, 9 pages, 2015. https://doi.org/10.1155/2015/801934
Multilevel Bloom Filters for P2P Flows Identification Based on Cluster Analysis in Wireless Mesh Network
Abstract
With the development of wireless mesh networks and distributed computing, lots of new P2P services have been deployed and enrich the Internet contents and applications. The rapid growth of P2P flows brings great pressure to the regular network operation. So the effective flow identification and management of P2P applications become increasingly urgent. In this paper, we build a multilevel bloom filters data structure to identify the P2P flows through researches on the locality characteristics of P2P flows. Different level structure stores different numbers of P2P flow rules. According to the characteristics values of the P2P flows, we adjust the parameters of the data structure of bloom filters. The searching steps of the scheme traverse from the first level to the last level. Compared with the traditional algorithms, our method solves the drawbacks of previous schemes. The simulation results demonstrate that our algorithm effectively enhances the performance of P2P flows identification. Then we deploy our flow identification algorithm in the traffic monitoring sensors which belong to the network traffic monitoring system at the export link in the campus network. In the real environment, the experiment results demonstrate that our algorithm has a fast speed and high accuracy to identify the P2P flows; therefore, it is suitable for actual deployment.
1. Introduction
Wireless networks are getting more and more popular nowadays. As users have got used to wired infrastructure networks, it is becoming extremely indispensable for wireless networks to be committed to providing similar service features to them [1]. It is difficult to find the relevant contents and services because the users and the data associated with a variety of applications are distributed over various sites and devices [2]. Many resources in WMNs can be used efficiently, aiming to maximize the total throughput of the whole network. In these networks, the key to maximize aggregate throughput is the flow identification scheme plays [3].
As more and more people are interested in wireless mesh networks, making efforts to supply users with a similar quality of service is important to the ones who are adapted to networks with wired infrastructure [4]. P2P (peertopeer) has grown to be a network transmission technology of high efficiency because of the widespread adoption of broadband residential access. Furthermore, it takes advantage of the modern network technology as well as distributed computing technology. It is a kind of distributed network and its basic idea lies in changing the traditional Client/Server mode [5]. In recent years, P2P (peertopeer) network has gathered broad attentions because of the fact that the peer nodes have no need to be with the help of intermediate servers to achieve the purpose of communicating with each other. Besides, it has become a technology which has a bright future [6]. In the last decade, the number of applications based on P2P technology has been increasing, such as BT, PPLive and eDonkey, Thunder. Up to now, P2P systems have accounted for more than 60% of Internet traffic in China [7].
The purpose of using mesh routers as wireless mesh network’s device (WMN) is to form a wireless backbone rather than such a wired network. It is wireless mess backbone network architecture in Figure 1. Acting as a server to each other, each mess node in the graph gets the services provided by the peertopeer node. Distributed network makes a great difference in the flow distribution of network. Besides, it does reduce the stress on the storage server. What improved by the emergency of P2P network is the user experience along with enriching the Internet. However, the excessive growth in its flow as well as unlimited usage of bandwidth brings network congestion, increasing network packet loss and network delay. In other words, the network performance and quality of service are reduced in a great degree. Moreover, malicious code, reactionary, obscenity information, and piracy resources in the P2P network wantonly spread [8]. As a result, P2P applications can reduce the performance of the network greatly, sometimes making a rather adverse impact on the regular network services. It requires controlling and keeping an eye on the P2P flows continuously. Also, it needs to guarantee the regular operations of network services [9]. These are the motivations of P2P flows identification in wireless mesh network.
How can we manage the network bandwidth of P2P services as well as ensuring the quality of service? To maximize the users’ satisfaction of P2P streaming in WMNs, The key technology is the flow identification scheme. It enables the network administrators to execute different control strategies according to different flow requirements, in order to achieve the effective management of P2P services [10, 11]. Therefore, the accurate identification and classification of P2P flows generally become the focus for network operators and service providers.
Over the past decades, the studies of flow identification of P2P services have been widely concerned [12–16], such as the port identification method [12, 13], the hostbehavior characteristics analysis method [14], and the identification method based on flow statistical properties [15, 16]. But these methods cannot identify the P2P flows accurately and fast. So what we put forward in this paper is a highperformance P2P flow identification algorithm based on multilevel bloom filters.
The primary point of this paper can be divided into the following points:(1)This paper finds that P2P flows have the locality characteristics of the time intervals of packets arrival and the length of packets in P2P flows.(2)An efficient flow identification scheme based on the multilevel bloom filters is proposed for identifying P2P flows.(3)A comprehensive set of experimental results demonstrate that our algorithm effectively enhances the performance of P2P flows identification.
The rest of the paper is organized as follows. Section 2 introduces the related work. In Section 3, we analyze the package lengths and time property features of P2P flows. Section 4 gives an efficient P2P flows identification scheme. Section 5 is the simulation evaluation, and Section 6 is the performance evaluation in real environment. Finally, Section 7 concludes the paper.
2. Related Works
In this section, we provide a brief discussion on the methods of P2P flow identification.
P2P flow identification method mainly has three categories: the port identification method [12, 13], the hostbehavior characteristics analysis [14], and the identification method based on flow statistical properties [15, 16].
The port identification method [12] is the most primitive and simple network flow identification method. It is known that many traditional network applications use a fixed port. For example, HTTP flow uses port 80 and MSN uses ports 1863 and 80 and so forth [17]. Therefore it can quickly and efficiently identify the corresponding flow according to the port numbers, which has a low degree of complexity. However, with the development of new business, a lot of services use dynamic random port in order to prevent filtering. When facing such a network service, the port identification method is almost a failure and the classification accuracy is very low. Due to its simple and fast identification ability, the TCP/UDP port identification method is still used in highspeed network flow identification. A major concern in utilizing diverse strategies to change the port numbers of the new P2P applications aims at avoiding traffic identification. As a consequence, on account of incomplete and inaccurate identification results, there is no use of portbased method [13].
The hostbehavior characteristics analysis [14] is mainly designed for P2P flow. The basic idea of this method is analyzing the data packet, summarizing P2P flow characteristics according to the analysis, and identifying the flow whether belongs to P2P applications [18]. In recent years, researchers have proposed many network measurement methods based on behavioral characteristics, and they have good scalability and high accuracy of identification [19]. Because of the part similarity of the network service model, those methods can only identify coarsegrained network services, and its memory consumption is very large. However, P2P applications and the regular applications cannot be discriminated by similar behaviors which cannot identify the traffic accurately.
The P2P identification method based on flow statistical properties is a solution overcoming the limits of port identification’s and flow behavior characteristics analysis. It uses statistics on arrival time interval, duration and a series of characteristics of packets, and supervised or unsupervised machine learning methods to achieve services identification. Supervised machine learning [15] trains data to model and then classifies data directly on this model, while unsupervised machine learning [16] classifies data directly. The identification method based on machine learning has a better scalability and can identify the encrypted data flow, and its classifier also has a good scalability and flexibility. But they have low performance due to serious consumption of resources caused by signature searching in the payload of every packet.
3. Research on the Locality Characteristics of P2P Flows
3.1. The Locality Characteristics
In this section, we find the locality characteristics of the P2P flows through the research on the package lengths and time property features.
Over the past decade, researchers have revealed some statistical characteristics of the P2P flows through a large number of studies. It is also found that recently referenced file has a greater probability to be referenced again soon [20]. The researchers found that the P2P applications have some features such as synchronous upstream and downstream flow, fast transmission and highcapacity, wide distributed service points, and lack of security mechanisms [21]. These features determine that the P2P network has uncertainty, encryption, and large capacity.
For more comprehensive understanding and analysis of the characteristics of P2P flows, we select the average packet length and packet arrival time interval values to do experiments. Our purpose is to design an appropriate algorithm structure to identify P2P flows through the analysis of these values. We get the P2P packets from Internet and read the fivetuple information of the packets and then classify each packet to its own flow according to classification algorithm. Subsequently we get the corresponding time of the packet belonging to this flow and finally calculate the time attribute and the values of the packet length.
This paper used the P2P flows and did experiment on the time intervals of packet arrival and packet’s average length. The results of the analysis are shown in Figures 2 and 3. As shown in Figure 2, it depicts average time interval of the arriving packet in the P2P flows. Obviously, as the number of flows increases, the attributes of packets gradually reduced and finally become stabilized when the number of flows grows up to 60. At this time the average time interval is about 1.7 seconds. As shown in Figure 3, it depicts the statistical value of the average length of the packet in the P2P flows. It shows that when the number of data flows reaches 130, the average packet length tends to be stable and around 100. We find the time intervals of packet arrival and the length of packet in P2P flows is less than other Internet flows, which is also in line with our analysis of the locality characteristics of P2P flows [22, 23].
3.2. The Mathematical Basis
Definition 1. The Minkowski distance of data and mean iswhere is the time series sample and is the mean of the sample, and denotes the number of the dimensions of the sample [24].
In our study, we assume that the historical time series sample of Internet packets subjects to normal distribution. The package lengths and time property features make up the samples. Let us suppose that denotes the mean and denotes the variance of sample before time . The distance from the newly generated sample data to the mean determines that the sample data and the mean share the same assigned cluster probability. The assigned cluster probability is as follows:where denotes the Minkowski distance of sample data and the mean .
From the equation we learn that the narrower the Minkowski distance between all of the newly produced sample data and the mean is, the bigger the value of will become. In a certain period of time, the probability of the appearance of the data, closer to the mean , is larger than the others in the similar time.
3.3. The Mathematical Model of Traffics Cluster Characteristics
We give a quantitative analysis of the cluster characteristics of the real Internet traffics in this part. The study pays close attention to the package lengths along with the time property features.
The historical clustering sample coming into shape in the time period along with cluster center , cluster radius , and sample variance is assumed to be similar prior information of the similar prior of time series sample in the continuous period of time [25]. It enables us to use a biased method to search the data of time series sample in the history cluster sample . According to the influence that the time series sample in the period of time has on historical cluster sample center , the new history cluster sample can be generated. The similar prior information for subsequent time series sample can be provided by the newly produced cluster [26].
There exist two types of data: , in time series sample produced by machine after time . We give the following definitions for the purpose of reflecting the impact which is produced by the sample on the historical cluster center .
Definition 2. A deviate sample can be made up from the data of in the time series sample . One can judge whether the data in the belongs to the deviate sample using the Pearson correlation function as follows:where and is the clustering center of cluster . Also, is the number of the dimensions of the sample. We assume the value of the function is . If the inequality satisfies, we can know that . If the inequality satisfies, we can know that . According to the real situation, the value of can be adjusted properly.
Definition 3. At first, the Minkowski distance between the data in and the history cluster center should be calculated, respectively. And then the probability of the same assigned cluster of and and Pearson correlation function should be calculated in the meantime. One can regard the product of the three as the deviate cost of for historical cluster samples . The deviate cost function is as follows:
Definition 4. Historical cost function is as follows: The function is the total deviate cost of the data of the sample from the historical cluster samples . When is satisfied, take the of the new time series sample as a new cluster center to form a new cluster sample .
Definition 5. One can evaluate the clustering quality of the new cluster sample by calculating the Pearson correlation degree between new cluster center and historical cluster center . The objective function is shown as follows: For the purpose of better reflecting the changes of new time series samples as well as producing new clusters [27] in a faster and better way, we can adjust the parameter appropriately with the help of the cluster quality function .
A cluster algorithm for packet matching is given out in the next. In the time period of , a historical time series cluster sample should be assumed at first.(1)A packet is produced by the Internet and added to the time series sample at time and the rest can be done following this way. When it comes to time , the historical cost function of sample should be calculated. If , then a new cluster is formed. Besides, we should calculate a new cluster and a new variance .(2)For the purpose of preferably reflecting new time series samples’ changes and producing new clusters in a faster and better way, we should calculate the cluster quality function to update the parameter appropriately.
4. Our Algorithm for Identifying P2P Flows
4.1. The Architecture of Our Algorithm
In this part, we design an efficient multilevel bloom filters algorithm to identify the P2P flows with high performance according to the locality characteristics of P2P flows.
Through the above experiments we get a detailed analysis of the locality characteristics of P2P flows; for example, the average time interval of packet arrival is stable at about 2 seconds as shown in Figure 2. Because of the quick update of the peertopeer flow nodes and the rapid transmission, the algorithm, respectively, stores the 0–30second data flows in the firstlevel bloom filter, the 30–90second data flows in the secondlevel bloom filter, and the remainder of the flows in the lastlevel bloom filter. If there are too many flows stored in the firstlevel bloom filter, in this case, the algorithm will consume more identification time. So we store more flows in the secondlevel bloom filter. The whole multilevel structure is designed as shown in Figure 4.
The algorithm adds a counter, respectively, in the three levels to calculate the amount of packets pertained to the same flow. When the packets of Internet flows enter, the algorithm firstly obtains the details of fivetuple information of the packets, and they are the source IP address (SA), the destination IP address (DA), the source port (SP), the destination port (DP), and protocol (Pro). Then our algorithm identifies which flows the packets belong to. The P2P flow identification step of our algorithm is the packet matching which is from the firstlevel to the lastlevel bloom filter. Firstly, when the incoming packet enters, the algorithm uses the hash functions to search out the flows, stored in the firstlevel bloom filter.
The searching procedure can be described by a pseudocode as shown in Algorithm 1. The specific method can be described as follows. The fivetuple information (SA, DA, SP, DP, and Pro) is substituted into FL_Hash1, FL_Hash2, …, FL_Hashk and the result values are compared with the firstlevel bloom filter. If the algorithm can find the matching flow node, the searching procedure will stop. Otherwise the packet enters the secondlevel bloom filter. Similarly the fivetuple information is substituted into SL_Hash1, SL_Hash2, …, SL_Hashk and compares the values in the secondlevel bloom filter. If the matching flow is found, the searching step will stop. Otherwise the packet enters the thirdlevel bloom filter. And the searching procedure continues to the lastlevel structure until the corresponding flow is found. Due to the locality characteristics of P2P flows, a newly arriving packet has a large probability of being found in the first level of the structure and the corresponding counter of the flow is directly updated.

Our algorithm is designed by bloom filters. Bloom filter has false positive, so we need to discuss the false positive probability of our approach. Assuming the length of each bloom filter is bits, the number of rules of each virtual router is . Based on existing research results in the paper [28], we calculate the number of hash functions through to reduce the probability of false positive.
4.2. Dynamic Flow Aging and Update of the Multilevel Structure
With time elapsing, some flows have been out of use and the corresponding records should be eliminated in our bloom filter data structure. The memory space which is released can be used for the following flows. According to the locality characteristics of the P2P flows, we use sample data packet to update the timestamp of the flows, instead of using timestamp of every packet to update the information. Therefore, the algorithm reduces lots of writing operations on the memory. With the calculation and analysis of the flow’s timestamp we can get the inactive P2P flows. By experimental analyzing packets in the previous section, we define the flow whose reaching time exceeds 10 seconds as an inactive flow and will move these flow nodes from the firstlevel to the second or the thirdlevel bloom filter. And the algorithm alternately updates the flows whose reaching time is within 5 seconds from the last two levels to the first level. Through the dynamic update of the data structure, the algorithm greatly improves the flow matching speed and the utilization coefficient of storage resource.
5. Simulation Evaluation
In this section, we come up with the emulation experiments to compare the performances of our algorithm with the flow statistical properties (FSP) algorithm [14] in P2P flow identification. In the experiments, the metrics of performance include the memory access evaluating the searching performance.
5.1. Experimental Environment
This paper tests the performance of algorithms by employing PALAC (packet lookup and classification simulator) in the Linux operating system (Kernel Version 3.16). PALAC provides the performance evaluation with a discrete event simulation environment. It consists of the following modules: flow generation module, classifier description language module, event queue manager module, classification or lookup algorithms repository module, classifier update module, and statistics collection and query module.
5.2. The Evaluation with Two Types of Data Sets
Below this paper uses two group experiments to test and analyze the performance of the algorithms. We select data sets from National Laboratory for Application Network Research (NLANR) and the Chinese Academy of Sciences Institute (CASI). NLANR team has exploited data collection permitting identifying a wide range of issues, which ranges from network connectivity and commodity issues to highperformance network hardware and router problem. This data of NLANR is useful for longitudinal study of the Internet flows, and it can be available from the NLANR website. Through the study of the two kind data sets, we find that the distribution of packet in the data sets of Chinese Academy of Sciences Institute is relatively scattered, and NLANR is relatively concentrated. We use the flow generation module of PALAC to generate the P2P flows with the generating packet rate of 1 G bit/sec and the generating packet time of 30 minutes.
Figures 5 and 6 are the experimental results of FSP algorithm and our algorithm on packets scattered distribution (CASI data sets) and concentration (NLANR data sets) in P2P flows. Figure 5 shows the memory access performance of our algorithm has an average increase of 33.54% compared with the FSP algorithm when packets are in the relatively scattered case. Figure 6 shows our algorithm’s memory access performance has an average increase of 35.17% compared with FSP algorithm when packets are in the relative concentration case. This is because the packets of the P2P flows are relatively smaller than the packets of other Internet flows, but their transmission speed is greater than the other packets, which makes the P2P flows identification more difficult for the FSP algorithm. However, it becomes much easier to identity P2P flows for our algorithm.
6. Performance Evaluation in Real Environment
In this section, we present the experiments to compare the performances of our algorithm with the portbased and hostbehaviorbased algorithms in real environment. In the experiments, the metrics of performance include the memory access, evaluating the searching performance, and the identification precision, evaluating the accuracy of the algorithms.
6.1. Experimental Environment
In order to fully verify the practical performance of the packet classification algorithm, the algorithm and the rule sets should be written on the network traffic monitoring system to test the effect of the algorithms for the actual network traffic monitoring results and then improve our algorithm.
Figure 7 shows the deployment of the network traffic monitoring system at the export link in the campus network. The system is divided into the traffic monitoring sensors, the traffic data collector, the data storage center, the data analysis center, and the remote browser. The traffic monitor probe is deployed in the vicinity of the routers and the network servers and other kinds of network equipment, which is responsible for the data packets mirroring and identifying the data packets as the service traffic of the application layer, the experimental data as the real network traffic in campus network according to the packet classification algorithms. We use SmartBits 2000 network test platform to test the performance of the algorithms, to further improve our algorithm and the efficiency of the algorithm in practical application.
Below we use two group experiments to test and analyze the performance of the algorithms.
6.2. The Evaluation on Speed and Accuracy
Firstly, this group experiment is utilized to evaluate the speed of the three algorithms with the same experimental configuration. As shown in Figure 8, compared with the portbased algorithm and the hostbehaviorbased algorithm, the average memory access of our algorithm separately drops by 66% and 47%. This experiment demonstrates that our algorithm has a fast speed to identify the P2P flows.
Secondly, this group experiment is utilized to evaluate the accuracy of the three algorithms with the same experimental configuration. As shown in Figure 9, compared with the accuracy 26.92% of portbased algorithm and accuracy 53.25% of hostbehaviorbased algorithm, our algorithm has a high accuracy 87.25%. This experiment demonstrates that our algorithm is suitable for actual deployment.
7. Conclusions
As the Internet brings efficiency and convenience to people’s life, study, and work, the Internet becomes more and more important as well as its influence; besides a large number of network applications came into being. Not only abundant traditional applications such as Web, FTP, Email, and Telnet but also a mass of new services exist in the network, for example, P2P, streaming media, virtual reality, and interactive online applications. A wide variety of network applications and a large number of Internet users have made the constitution of the Internet flows increasingly complex. Followed by this, the Internet flow identification technology has developed rapidly in the meanwhile.
In this paper, an efficient P2P flows identification scheme based on multilevel bloom filters is proposed. Through the study on the package lengths and time property features of P2P flows, the scheme is designed as a multilevel structure containing bloom filters. Different level structures store different numbers of flow rules, and the searching steps of the scheme traverse from first level to the last level. The simulation results demonstrate that our algorithm effectively enhances the performance of P2P flows identification.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Acknowledgments
This work is supported by the National Basic Research Program of China (973 Program, no. 2012CB315801); the National Science Foundation of China (nos. 61173167 and 61173168); the Scientific Research Foundation for Ph.D. Hunan Normal University (no. Math 120641); Youth Scientific Research Fund of Hunan Normal University (no. 11301); Scientific Research Fund of Hunan Provincial Education Department (no. 10C0941).
References
 Z. R. Zaidi, S. Hakami, B. Landfeldt, and T. Moors, “Realtime detection of traffic anomalies in wireless mesh networks,” Wireless Networks, vol. 16, no. 6, pp. 1675–1689, 2010. View at: Publisher Site  Google Scholar
 N. Kumar, N. Chilamkurti, and J.H. Lee, “Distributed context aware collaborative filtering approach for P2P service selection and recovery in wireless mesh networks,” PeertoPeer Networking and Applications, vol. 5, no. 4, pp. 350–362, 2012. View at: Publisher Site  Google Scholar
 N. Kumar, N. Chilamkurti, and J.H. Lee, “A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks,” Computers & Mathematics with Applications, vol. 63, no. 2, pp. 481–491, 2012. View at: Publisher Site  Google Scholar
 Z. R. Zaidi, S. Hakami, T. Moors, and B. Landfeldt, “Detection and identification of anomalies in wireless mesh networks using principal component analysis (PCA),” Journal of Interconnection Networks, vol. 10, no. 4, pp. 517–534, 2009. View at: Publisher Site  Google Scholar
 L. Li, G. Zhang, and A. Yao, “The model design of MP2P content distribution networks based on sphere clusters,” Journal of Computational Information Systems, vol. 8, no. 4, pp. 1732–1743, 2012. View at: Google Scholar
 J. Zhang, H. Duan, W. Liu, and J. Wu, “Anonymity analysis of P2P anonymous communication systems,” Computer Communications, vol. 34, no. 3, pp. 358–366, 2011. View at: Publisher Site  Google Scholar
 J. Dong, X. Ren, D. Zuo, and H. Liu, “An adaptive failure detector based on quality of service in peertopeer networks,” Sensors, vol. 14, no. 9, pp. 16617–16629, 2014. View at: Publisher Site  Google Scholar
 J. Ju, F. Fan, and J. Wu, “Analysis of model and key technology for P2P network route security evaluation with 2tuple linguistic information,” Journal of Computational Information Systems, vol. 9, no. 14, pp. 5529–5534, 2013. View at: Publisher Site  Google Scholar
 X.A. Bi, D.F. Zhang, X.B. Yang, and S. Chen, “An efficient P2P traffic identification scheme,” International Journal of Digital Content Technology and Its Applications, vol. 5, no. 12, pp. 459–467, 2011. View at: Publisher Site  Google Scholar
 L. Feng, X. Liao, Q. Han, and L. Song, “Modeling and analysis of peertopeer botnets,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 865075, 18 pages, 2012. View at: Publisher Site  Google Scholar  MathSciNet
 S. Zeng, L. Li, and D. Liao, “Path selection and bandwidth allocation for fixed and mobile peers in P2P streaming system,” Journal of Computational Information Systems, vol. 8, no. 17, pp. 7163–7170, 2012. View at: Google Scholar
 T. Karagiannis, K. Papagiannaki, and M. Faloutsos, “BLINC: multilevel flow classification in the dark,” in Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, New York, NY, USA, 2005. View at: Google Scholar
 F. Constantinou and P. Mavrommantis, “Identifying known and unknown peertopeer flow,” in Proceedings of the IEENCA, Washington, DC, USA, 2006. View at: Google Scholar
 Y. Sawaya, A. Kubota, and Y. Miyake, “Detection of attackers in services using anomalous host behavior based on traffic flow statistics,” in Proceedings of the 11th IEEE/IPSJ International Symposium on Applications and the Internet (SAINT '11), pp. 353–359, Munich, Germany, July 2011. View at: Publisher Site  Google Scholar
 T. Nguyen and G. Armitage, “A survey of techniques for internet flow classification using machine learning,” IEEE Communications Surveys and Tutorials, vol. 11, no. 3, pp. 37–52, 2008. View at: Google Scholar
 N. Williams, S. Zander, and G. Armitage, “A preliminary performance comparison of five machine learning algorithms for practical IP traffic flow classification,” ACM SIGCOMM Computer Communication Review, vol. 30, no. 5, pp. 5–16, 2006. View at: Publisher Site  Google Scholar
 T. Karagiannis, A. Broido, M. Faloutsos, and K. Claffy, “Transport layer identification of P2P traffic,” in Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement (IMC '04), pp. 121–134, Taormina, Italy, October 2004. View at: Google Scholar
 T. Liu and X. Chen, “A novel approach to detect P2P traffic based on program behavior analysis,” in Proceedings of the IEEE 2nd Annual Conference on Electrical and Control Engineering (ICECE '11), pp. 5677–5680, Yichang, China, September 2011. View at: Publisher Site  Google Scholar
 J. Zhang, R. Perdisci, W. Lee, U. Sarfraz, and X. Luo, “Detecting stealthy P2P botnets using statistical traffic fingerprints,” in Proceedings of the IEEE/IFIP 41st International Conference on Dependable Systems and Networks (DSN '11), pp. 121–132, Hong Kong, China, June 2011. View at: Publisher Site  Google Scholar
 H. Kang, M. Kim, and J. Hong, “A method on multimedia service flow monitoring and analysis,” in Proceedings of the 14th IEEE international workshop on DSOM, Heidelberg, Germany, 2003. View at: Google Scholar
 S. Sen and J. Wang, “Analyzing peertopeer traffic across large networks,” IEEE/ACM Transactions on Networking, vol. 12, no. 2, pp. 219–232, 2004. View at: Publisher Site  Google Scholar
 V. CarelaEspanol, P. BarletRos, M. SoléSimó, A. Dainotti, W. de Donato, and A. Pescapé, “Kdimensional trees for continuous traffic classification,” in Traffic Monitoring and Analysis, vol. 6003 of Lecture Notes in Computer Science, pp. 141–154, Springer, Berlin, Germany, 2010. View at: Publisher Site  Google Scholar
 A. Dainotti, F. Gargiulo, L. I. Kuncheva, A. Pescapè, and C. Sansone, “Identification of traffic flows hiding behind TCP port 80,” in Proceedings of the IEEE International Conference on Communications (ICC '10), pp. 1–6, Cape Town, South Africa, May 2010. View at: Publisher Site  Google Scholar
 M. Polczynski and M. Polczynski, “Using the kmeans clustering algorithm to classify features for choropleth maps,” Cartographica, vol. 49, no. 1, pp. 69–75, 2014. View at: Publisher Site  Google Scholar
 R. Martino, P. Mazzotta, H. Bourdin et al., “LoCuSS: hydrostatic mass measurements of the highLX cluster sample—crosscalibration of Chandra and XMMNewton,” Monthly Notices of the Royal Astronomical Society, vol. 443, no. 3, pp. 2342–2360, 2014. View at: Publisher Site  Google Scholar
 A. Hassan and R. Kouhy, “Timeseries crosssectional environmental performance and disclosure relationship: specific evidence from a lessdeveloped country,” International Journal of Accounting and Economics Studies, vol. 2, no. 2, pp. 60–73, 2014. View at: Publisher Site  Google Scholar
 J. B. MacQueen, “Some methods for classification and analysis of multivariate observation,” in Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281–297, Berkeley, Calif, USA, January 1967. View at: Google Scholar
 B. H. Bloom, “Space/time tradeoffs in hash coding with allowable errors,” Communications of the ACM, vol. 13, no. 7, pp. 422–426, 1970. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2015 Xiaan Bi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.