Kuai Xu

Kuai Xu

Auto-generated profile, based on publicly available information

Kuai Xu

Arizona State University, Glendale, Arizona, USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2011
Verified
Conference Paper
Open access
YCYingying Chen
Yingying Chen
SJSourabh Jain
Sourabh Jain
VAVijay Kumar Adhikari
Vijay Kumar Adhikari
ZZZhi-Li Zhang
Zhi-Li Zhang
KXKuai Xu
Kuai Xu
Effectively managing multiple data centers and their traffic dynamics pose many challenges to their operators, as little is known about the characteristics of inter-data center (D2D) traffic. In this paper we present a first study of D2D traffic characteristics using the anonymized NetFlow datasets collected at the border routers of five major Yahoo! data centers. Our contributions are mainly two-fold: i) we develop novel heuristics to infer the Yahoo! IP addresses and localize their locations from the anonymized NetFlow datasets, and ii) we study and analyze both D2D and client traffic characteristics and the correlations between these two types of traffic. Our study reveals that Yahoo! uses a hierarchical way of deploying data centers, with several satellite data centers distributed in other countries and backbone data centers distributed in US locations. For Yahoo! US data centers, we separate the client-triggered D2D traffic and background D2D traffic from the aggregate D2D traffic using port based correlation, and study their respective characteristics. Our findings shed light on the interplay of multiple data centers and their traffic dynamics within a large content provider, and provide insights to data center designers and operators as well as researchers.

22 August 2005 in ACM SIGCOMM Computer Communication Review
Verified
Journal Article
Open access
PDF file
KXKuai Xu
Kuai Xu
ZZZhi-Li Zhang
Zhi-Li Zhang
SBSupratik Bhattacharyya
Supratik Bhattacharyya
Recent spates of cyber-attacks and frequent emergence of applications affecting Internet traffic dynamics have made it imperative to develop effective techniques that can extract, and make sense of, significant communication patterns from Internet traffic data for use in network operations and security management. In this paper, we present a general methodology for building comprehensive behavior profiles of Internet backbone traffic in terms of communication patterns of end-hosts and services. Relying on data mining and information-theoretic techniques, the methodology consists of significant cluster extraction, automatic behavior classification and structural modeling for in-depth interpretive analyses. We validate the methodology using data sets from the core of the Internet. The results demonstrate that it indeed can identify common traffic profiles as well as anomalous behavior patterns that are of interest to network operators and security analysts.

1 June 2012
Verified
Conference Paper
Closed access
FWFeng Wang
Feng Wang
HWHaiyan Wang
Haiyan Wang
KXKuai Xu
Kuai Xu
Online social networks have recently become an effective and innovative channel for spreading information and influence among hundreds of millions of end users. Most of prior work either carried out empirical studies or focus on the information diffusion modeling in temporal dimension, little attempt has been given on understanding information diffusion over both temporal and spatial dimensions. In this paper, we propose a Partial Differential Equation (PDE), specifically, a Diffusive Logistic (DL) equation to model the temporal and spatial characteristics of information diffusion. We present the temporal and spatial patterns in a real dataset collected from a social news aggregation site, Digg, and validate the proposed DL equation in terms of predicting the information diffusion process. Our experiment results show that the DL model is able to characterize and predict the process of information propagation in online social networks. For example, for the most popular news with 24,099 votes in Digg, the average prediction accuracy of DL model over all distances during the first 6 hours is 92.08%. To the best of our knowledge, this paper is the first attempt to use PDE-based model to study the information diffusion process in both temporal and spatial dimensions in online social networks.

1 January 2011 in Theoretical Computer Science
Verified
Journal Article
Closed access
FWFeng Wang
Feng Wang
HDHongwei Du
Hongwei Du
ECErika Camacho
Erika Camacho
KXKuai Xu
Kuai Xu
WLWonjun Lee
Wonjun Lee
SSShan Shan
Shan Shan

22 February 2008 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
KXKuai Xu
Kuai Xu
ZZZhi-Li Zhang
Zhi-Li Zhang
SBSupratik Bhattacharyya
Supratik Bhattacharyya
Recent spates of cyber-attacks and frequent emergence of applications affecting Internet traffic dynamics have made it imperative to develop effective techniques that can extract, and make sense of, significant communication patterns from Internet traffic data for use in network operations and security management. In this paper, we present a general methodology for building comprehensive behavior profiles of Internet backbone traffic in terms of communication patterns of end-hosts and services. Relying on data mining and entropy-based techniques, the methodology consists of significant cluster extraction, automatic behavior classification and structural modeling for in-depth interpretive analyses. We validate the methodology using data sets from the core of the Internet.

5 June 2013 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
KXKuai Xu
Kuai Xu
FWFeng Wang
Feng Wang
LGLin Gu
Lin Gu
As Internet traffic continues to grow in size and complexity, it has become an increasingly challenging task to understand behavior patterns of end-hosts and network applications. This paper presents a novel approach based on behavioral graph analysis to study the behavior similarity of Internet end-hosts. Specifically, we use bipartite graphs to model host communications from network traffic and build one-mode projections of bipartite graphs for discovering social-behavior similarity of end-hosts. By applying simple and efficient clustering algorithms on the similarity matrices and clustering coefficient of one-mode projection graphs, we perform network-aware clustering of end-hosts in the same network prefixes into different end-host behavior clusters and discover inherent clustered groups of Internet applications. Our experiment results based on real datasets show that end-host and application behavior clusters exhibit distinct traffic characteristics that provide improved interpretations on Internet traffic. Finally, we demonstrate the practical benefits of exploring behavior similarity in profiling network behaviors, discovering emerging network applications, and detecting anomalous traffic patterns.