|Address:||Institute of Computing Technology, Chinese Academy of Sciences|
|No.6 Kexueyuan South Road Zhongguancun, Haidian District|
|Email:||shiyangguang AT ict DOT ac DOT cn|
|sunshine DOT ict DOT cas AT gmail DOT com|
Ph.D. of Engineering, Computer Science September 2011 – July 2016
University of Chinese Academy of Sciences, Beijing, China
Bachelor of Engineering, Software Engineering September 2007 – July 2011
Shandong University, Shandong, China
My research interests focus on developing randomized algorithms for optimizing the energy efficiency for large-scale distributed networks. Motivated to decrease the carbon footprints and operation expenses associated with energy consumption, researchers and industries are being attracted to the emerging energy efficiency issue of communication networks. In my research, I study the problem of optimizing the energy efficiency in the level of an entire network. This problem becomes challenging when we focus on the large-scale distributed networks. I am interested in analyzing the lower bounds corresponding to this problem in different application scenarios, and experienced in applying randomized techniques to optimization to beat the lower bounds of deterministic algorithms. More specifically, I have investigated the problems of energy-efficient packet-switching network scheduling, oblivious routing for power minimization, and energy conservation in optical networks. My algorithms for these problems can be implemented efficiently in large-scale networks.
Green Network – Theory and Techniques for Reducing Network Energy Consumption, NSFC grant 61020106002.
Project Description: In this project, we are collaborating with Institute IMDEA Networks and Bell Labs to study theories and techniques for globally reducing energy consumption in network level. Our objective is to develop energy efficient algorithms and protocols for network message routing and scheduling.
Datacenter with High Efficiency – Optimizinging Organization and Scheduling of Datacenter Resources, NSFC grant 61520106005.
Project Description: This research investigates algorithms and techniques that improve the resource utilization, quality of service and energy efficiency of datacenters, including the cases of both intra-domain and inter-domain.
Duties: Designing an IP-over-EON (Elastic Optical Network) network to efficiently provide bandwidth resources to intra-/inter-datacenter communication. Developing algorithms and protocols for this IP-over-EON network to optimize the energy efficiency.
Yangguang Shi, Fa Zhang, Jie Wu, Zhiyong Liu, “Randomized Oblivious Integral Routing for Minimizing Power Cost”, Theoretical Computer Science (TCS), Available online 9 July 2015, ISSN 0304-3975, http://dx.doi.org/10.1016/j.tcs.2015.07.007.
Yangguang Shi, Fa Zhang, Zhiyong Liu. “Polylogarithmic Competitive Algorithm for Energy Minimization in Optical WDM Networks”, the 22nd IEEE International Conference on Network Protocols (ICNP), Raleigh, North Carolina, USA, Oct. 21-24, 2014.
Yangguang Shi, Fa Zhang, Zhiyong Liu. “Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost”, Frontiers in Algorithmics - 8th International Workshop (FAW), June 28-30, 2014. Proceedings. Volume 8497 of Lecture Notes in Computer Science, pages 216-228, Springer, 2014.
Yangguang Shi, Fa Zhang, Zhiyong Liu, “A Universally Stable and Energy-Efficient Scheduling Protocol for Packet Switching Network”, the 12th IEEE International Symposium on Network Computing and Applications (NCA), Cambridge, Massachusetts, USA, Aug 22-24, 2013.
Meritorious Winner in COMAP’s Mathematical Contest in Modeling February 2010
Silver Medal in the ACM Asia Programming Contest, Wuhan Site November 2009
Silver Medal in the ACM Asia Programming Contest, Hefei Site October 2009
Silver Medal in the ACM Asia Programming Contest, Beijing Site October 2008
Programming Languages: Experienced in C, C++, C#, and Matlab.
Optimization Software: CPLEX (Interactive Optimizer and Concert for C++), Matlab, Lingo.
Theoretical Utilities: Experienced in using mathematical utilities, including moment inequalities, Chernoff Bound, Constructive Lovász Local Lemma, random walking, etc, to design randomized optimization algorithms.