Chuanxiong Guo, Ph.D.

I am a LEAD RESEARCHER in the Wireless and Networking Group at Microsoft Research Asia . I received a Ph.D. degree in communications and information systems from Nanjing Institute of Communications Engineering, China, in 2000.

My research interests lie in the field of networking, encompassing network algorithm design and analysis, data center networking (DCN), novel network applications, and networking support in operating systems. I am interested in finding simple yet deep and elegant solutions to real-world networking and systems problems. Currently I am working on data center networking (DCN), data centric networking, and distributed computing.

Recent/Selected Publications

  1. Chuanxiong Guo, Haitao Wu, Kun Tan, Lei Shi, Yongguang Zhang, and Songwu Lu, DCell: A Scalable and Fault-Tolerant Network Structure for Data Centers, in ACM SIGCOMM 08. [pdf]

  2. Chuanxiong Guo, Improved Smoothed Round Robin Schedulers for High-Speed Packet Networks, in Proc. IEEE infocom 08.
    This paper together with G-3 and SRR form a full spectrum of O(1) time-complexity packet schedulers.

  3. Chuanxiong Guo, G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay, to appear in Proc. infocom 07. [pdf]
    The only packet scheduling algorithm that provides O(1) time complexity, bounded worst-case and relative fairness, and bounded end-to-end delay.

  4. Helen J. Wang, Chuanxiong Guo, Daniel R. Simon, and Alf Zugenmaier, Shield: Vulnerability-Driven Network Filters for Preventing Known Vulnerability Exploits, in Proc. ACM SIGCOMM 2004, pp. 193-204. [pdf]

  5. Chuanxiong Guo, SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks, IEEE/ACM trans. Networking, vol. 12, no. 6, pp. 1144-1155, Dec. 2004. [pdf]
    Conference version appeared in Proc. SIGCOMM 2001. [pdf]
    It placed the seeds for G-3 and the infocom08 paper.

More detailed publication list can be found here.

I am currently recruiting research interns. Requirements are: (1) ability to solve (and abstract) problems (e.g., good at math); (2) programming ability (to turn things into real); (3) self-motivated. If you are interested, please contact me via email.

Last updated: Aug. 28, 2007