kang0

Xiaozhu Kang

PhD Candidate, Research Assistant
Comet Lab
Department of Electrical Engineering
Columbia University



Contact Information
 
Cell   :  (347)578-4766

Office: (212)854-2498
Email:  xk2001@columbia.edu

 

 

My office:

801 Morris A. Schapiro Bldg

 

Home Address:

528 Riverside Dr #3C

New York, NY 10027

 

Education

·         Columbia University, Dept. of Electrical Engineering,  Comet Group,  Ph.D. Candidate, Feb. 2009

·         Columbia University, Dept. of Electrical Engineering, M.Ph., May 2008

·         Columbia University, Dept. of Electrical Engineering, M.S., Feb. 2004

·         University of Science & Technology of China,  Electrical Engineering & Information Science Dept., B.S., July, 2002 

Research

 

  • Research Interest:  Algorithm design, mathematical foundations of information networks and systems. My recent research includes the design of nearly optimal caching replacement policies in the presence of self-similar/heavy-tailed access patterns, the design and analysis of scheduling mechanisms, efficient implementation of cryptography algorithms.

 

 

Publications (author list is in alphabetical order)

Journals

[1] Predrag R. Jelenkovic, Xiaozhu Kang, Ana Radovanovic, "Near Optimality of the Discrete Persistent Access Caching Algorithm", Discrete Mathematics and Theoretical Computer Science Proc. AD, pp. 201-222, 2005.

 

[2] Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan, "Heavy-Tailed Limits for Medium Size Jobs and Comparison Scheduling", accepted, to appear in Annals of Operations Research.

 

      [3] Predrag R. Jelenkovic, Xiaozhu Kang, “Induced Subexponential Delays in Processor Sharing Queues”, submitted.

 

      [4] Predrag R. Jelenkovic, Xiaozhu Kang, “Ratio Limit Invariance for Move-To-Front Lists”, in preparation.

 

 

Conferences

[1]  Predrag R. Jelenkovic, Xiaozhu Kang, Ana Radovanovic, "Near Optimality of the Discrete Persistent Access Caching Algorithm", 11th International Conference on the Analysis of Algorithm, Barcelona, Spain, June 6-10, 2005.

 

[2]  Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan, “Heavy-Tailed Limits for Medium-Size Jobs with Popular Schedulers”, Workshop of Stochastic Performance Models for Resource Allocation in Communication Systems, Amsterdam, The Netherlands, November 8-10, 2006.

 

[3]  Predrag R. Jelenkovic, Xiaozhu Kang, “LRU Caching with Moderately Heavy Request Distributions”,  Workshop on Analytic Algorithmics and Combinatorics (ANALCO’07),  New Orleans, Louisiana, January 6, 2007.  Presentation Slides.

 

[4]  Predrag R. Jelenkovic, Xiaozhu Kang, Jian Tan, “Adaptive and Scalable Comparison Scheduling”, ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2007), San Diego, California, June 12-16, 2007. Presentation Slides.

 

      [5] Xiaozhu Kang, Hui Zhang, Guofei Jiang, Haifeng Chen, Xiaoqiao Meng, Kenji Yoshihira, “Understanding Internet Video Sharing Site Workload: A View from Data Center Design”, 17th International Conference on World Wide Web (WWW’08) Poster, Beijing, China, April 21 – 25, 2008.

 

      [6]  Predrag R. Jelenkovic, Xiaozhu Kang, “ Is Fair Resource Sharing Responsible for Spreading Long Delays?”, The 10th Workshop on Mathematical Performance Modeling and Analysis, Annapolis, Maryland, June 2, 2008. Also appear in Performance Evaluation Review. Presentation Slides.

 

[7] Predrag R. Jelenkovic, Xiaozhu Kang, “Characterizing the Miss Sequence of the LRU Cache”, The 10th Workshop on Mathematical Performance Modeling     and Analysis, Annapolis, Maryland, June 2, 2008. Also appear in Performance Evaluation Review. Presentation Slides

 

      [8] Xiaozhu Kang, Hui Zhang, Guofei Jiang, Haifeng Chen, Xiaoqiao Meng, Kenji Yoshihira, “Measurement, Modeling, Analysis of Internet Video Sharing Site Workload: A Case Study”, 2008 IEEE International Conference on Web Services (ICWS 2008), Beijing, China, September 23-26, 2008.

 

 

Teaching

   Last Updated: Sept 6th, 2008