Gobi; from Ping Pan Yang (Richard) Yang

Associate Professor of Computer Science
and Electrical Engineering (courtesy appointment)
Yale University
Department of Computer Science
LAboratory of Networked Systems
facebook

Office: 308A AK Watson
51 Prospect Street
New Haven, CT 06520
(google map) 		      Phone: (203) 432-6400
FAX: (203) 432-0593
yang.r.yang AT yale.edu
or yry AT cs.yale.edu


News
  • [10/2012] Network Optimization for DHT-based Applications (P4P/ALTO + Streaming) by Sun et al. will appear in JSAC Special Issue (2013).
  • [09/2012] RFC 6708 (on ALTO) published.
  • [09/2012] Argos (paper) by Shepard (Rice U) et al. appeared in Mobicom 2012.
  • [08/2012] Data Lockers (paper) appeared in SIGCOMM ICN 2012.
  • [08/2012] ShadowStream (paper, slides) appeared in SIGCOMM 2012.
  • [08/2012] Content Multihoming Optimization (paper, slides) appeared in SIGCOMM 2012.
  • [07/2012] RFC6646 (on DECADE; note: the DECADE WG has just closed) published.
  • [03/2012] The I2AEX slides at IETF 84.
  • [12/2011] The PACE slides at DIMACS Cloud Worshop.

Research

My general research interests include computer networks, wireless networks, sensor networks, mobile computing, and network security. I lead the Laboratory of Networked Systems (LANS) at Yale University.

Currently, my primary research interest is on designing robust, efficient and fair computer networks, where autonomous, heterogeneous traffic controllers optimize their objectives measured by both traditional performance metrics and non-traditional metrics such as economical metrics and survivability.

Research Highlights:

Research Questions and Objectives:

The central question driving much of my research is the following: What are the guiding principles and practical techniques for achieving robust and efficient computer networks?

Our research methodology is to integrate rigorous analysis with careful system design, practical implementation, and whenever possible large-scale field tests with real users.

  • The objective of rigorous analysis is to reveal and derive the most fundamental guiding principles and to provide provable guarantees. As an example, instead of an ad-hoc system design, our P4P framework derives the interfaces between networks and network applications through rigorous primal-dual optimization decomposition. 
  • The objective of system implementation and large-scale field tests is to ground the principles in the real world. Some of our systems have undergone extremely large-scale field tests (e.g., P4P has been test-deployed with millions of real users at five of the largest Internet service providers in the world); some of our tools have been used by multiple other groups around the world (e.g., TORTE and Network Localization).

Publications
Recent (past two years) publications:

  • ShadowStream, Tian et al. In SIGCOMM 2012, Aug. 2012. (paper, slides)

  • Optimizing Cost and Performance for Content Multihoming, Liu et al. In SIGCOMM 2012, Aug. 2012. (paper, slides)

  • Argos, Shepard et al. In Mobicom 2012, Aug. 2012. (paper)

  • An Open Content Delivery Infrastructure using Data Lockers, Alimi et al. To appear in SIGCOMM ICN 2012, Aug. 2012. (bib, pdf)

  • Network Optimization for DHT-based Applications by Y. Sun, Y. Richard Yang, X. Zhang, Y. Guo, J. Li, and K. Salamatian. In INFOCOM 2012, Apr. 2012. (bib, pdf)

  • ALTO Protocol by R. Alimi, R. Penno, and Y. Richard Yang. Internet Draft. 2012. (txt).

  • Open Content Distribution using Data Lockers by Richard Alimi, Y. Richard Yang, et al. (slides we made for the Nov. 2010 CoxNet Workshop).

  • PEAC: Performance Evaluation as a Capability in Production Live Streaming by Richard Alimi, Chen Tian, Y. Richard Yang and David Zhang. Sept. 2010. (pdf slides from Rich's defense)

  • Remap Decoding: Simple Retransmission Permutation Can Resolve Overlapping Channel Collisions by L. Erran Li, Kun Tan, Harish Viswanathan, Ying Xu, and Y. Richard Yang. In MOBICOM 2010, Sept. 2010. (bib, pdf, slides)

  • R3: Resilient Routing Reconfiguration by Y. Wang, H. Wang, A. Mahimkar, R. Alimi, Y. Zhang, L. Qiu and Y.R. Yang. In SIGCOMM 2010, August 2010. (bib, pdf, Hao Wang's Thesis defense gives pre-R3 background, sigcomm slides)

  • Mosaic: Policy Homomorphic Network Extention to appear in LADIS 2010, Zurich, Switzerland, July 2010. (pdf). An early technical report version is Yale Technical Report/TR1427, by L. Erran Li, M.F. Nowlan, C. Tian, Y.R. Yang, and M. Zhang, Feb. 2010 (pdf).

  • Open Content Distribution using Data Lockers by R. Alimi, H. Liu, Y.R. Yang, and D. Zhang. Yale Technical Report/TR1426, Feb. 2010. (bib, pdf)

  • Guide to Reliable Internet Services and Applications by Charles R. Kalmanek, Sudip Misra, and Y. Richard Yang (ed.) Springer-Verlag 2010. (book cover)

  • Contracts: Practical Contribution Incentives for P2P Live Streaming by M. Piatek, A. Krishnamurthy, A. Venkataramani, R. Yang, D. Zhang, and Alexander Jaffe. In NSDI 2010. (bib, pdf, slides)

  • A General Algorithm for Interference Alignment and Cancellation in Wireless Networks by Li Erran Li, Richard Alimi, Dawei Shen, Harish Viswanathan and Y. Richard Yang. In INFOCOM 2010. (bib,pdf, slides)

  • Conferences:

Funded Projects
  • "MatrixNet: Concurrent Transmission and Reception in Wireless Networks," NSF CNS-1018502, $300,000, 09/01/2010 - 08/31/2012.

  • "NECO: P4P: Provider Portal for (P2P) Network Applications," NSF CNS-0831834, $350,000, 09/01/2008 - 08/31/2011.

  • "Collaborative Research: NeTS-NBD: Traffic Engineering in an Uncertain World," NSF CNS-0626878, $162,748, 09/01/2006-08/31/2010.

  • "CAREER: Networks with Multiple Transport Mechanisms," NSF ANI-0238038, $424,889, 08/15/2003 - 7/31/2008.

  • "NeTS---Design and Evaluation of Multihomed Networks," NSF CNS-0435201, $349,987, 10/01/2004 - 9/30/2008, with James Aspnes and Avi Silberschatz.

  • "Incentive-Compatible Designs for Distributed Systems,'" NSF ANI-0207399, $424,998, 08/15/2002 - 7/31/2005, with Joan Feigenbaum, Arvind Krishnamurthy, and Scott Shenker.

  • My research is also supported by Microsoft Research, Huawei, Amazon and Altera.

Students
This is a web page with links to alumni of my group.

I am fortunate to be able to work closely with a stellar group of students. Current students in my group:

There are many more interesting projects than we can actively pursue; thus, I am currently looking for motivated Ph.D. students. One way for checking if you have a reasonable background and if there is a potential match between my research interests and yours, is that you take a look at my current research papers, say those linked at the beginning of this page. If you feel comfortable understanding, and (potentially) criticizing those papers, please feel free to contact with me.

This link contains much useful information for graduate students.

Here is a link to prospective students, current students and prospective visiting researchers.

I used to maintain a list of papers on computer networks. I suggest to my students that they read the papers, at least the red ones.

Teaching

Other info
  • Short bio: Dr. Y. Richard Yang is an Associate Professor of Computer Science and Electrical Engineering at Yale University. His current research interests include computer networks, mobile computing, wireless networking, sensor networks, and network security. He leads the Laboratory of Networked Systems (LANS) at Yale. He has served as a committee member of many conferences, as a panelist of several funding agencies, as an advisor of several industrial and academic organizations, and is the conference co-chair of IWQoS 2006. His recent awards include a CAREER Award from the National Science Foundation and a Schlumberger Foundation Award. Dr. Yang's research is supported by both government funding agencies such as NSF and industrial companies such as Microsoft. He received his B.E. degree in computer science and technology from Tsinghua University (1993), and his M.S. and Ph.D. degrees in computer science from the University of Texas at Austin (1998 and 2001).
  • IEEE photo.
  • Photos with ruirui (July 2009 at Olympic park)
  • Ph.D. advisor: Simon S. Lam; to trace the whole academic chain, you can see the mathematics genealogy project.

Last updated: 01/21/2010 22:43:53 -0500