Gobi; from Ping Pan Yang (Richard) Yang

Professor of Computer Science
Director of Undergraduate Studies (Fall 2018)
Department of Computer Science
Computer Systems Lab at Yale
Yale University


Google Scholar (maintains a more complete list of papers than this page)

Office: 208A 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 (trailing 12 months)

  • [08/15/2018] Congratulation to the team of Qiao Xiang, Franck Le, Chin Guok, John McAuley, and Harvey Newman: our work, Fine-Grained, Multi-Domain Network Resource Abstraction as a Fundamental Primitive to Enable High-Performance, Collaborative Data Sciences, has been accepted by SC'18 (The International Conference for High Performance Computing, Networking, Storage, and Analysis), the flagship conference of high-performance systems.

  • [07/18/2018] Congratulation to the team of Qiao Xiang, Franck Le, Yeon-sup Lim, Vinod Misihra, and Chris Williams: our work, OpenSDC: A Novel, Generic Datapath for Software Defined Coalitions, has been accepted by MILCOM 2018, the flagship conference of military communications and networking.

  • [06/27/2018] Congratulation to Chris Leet (Yale undergrad!), Yuki de Pourbaix (Yale sophomore!), and Shenshen Chen: their work, Magellan: Toward Automatic Mapping from High-Level SDN Programs to Low-Level, Optimized Datapath Pipelines, is invited to the first phase of the ACM Student Research Competition! The competition has invited only 7 undergraduate students in total for the SRC competition in the undergraduate category. Congratulations!

  • [06/19/2018] Congratulations to our team including Qiao Xiang, Chin Guok, Franck Le, John McAuley, Harvey Newman on the acceptance by SIGCOMM 2018 Posters and Demos of the work SFP: Toward Interdomain Routing for SDN. Good job!

  • [06/19/2018] Congratulations to our team including Qiao Xiang, Jensen Zhang, X. Tony Wang, Y. Jace Liu (undergrad!), Chin Guok, Franck Le, John McAuley, and Harvey Newman on the acceptance by SIGCOMM 2018 Posters and Demos of the work Fine-Grained, Multi-Domain Network Resource Abstraction as a Fundamental Primitive to Enable High-Performance, Collaborative Data Sciences. Good job!

  • [05/08/2018] Congratulations to our team including Kai Gao and Taishi Nojima (Yale undergrad thesis!) on the acceptance by SIGCOMM 2018 of our paper Trident: Toward a Unified SDN Programming Framework with Automatic Updates. Good job!

  • [04/30/2018] Congratulations to Geng's team on the acceptance by IEEE DSC 2018 of their paper titled JMS: Joint Bandwidth Allocation and Flow Assignment for Transfers with Multiple Sources. Good job!

  • [04/19/2018] Congratulations to Geng's team on the acceptance by ICDCS 2018 of their new datapath design. Good job!

  • [11/27/2017] Congratulations to Chris Leet (Yale undergrad thesis!), Tony Wang, and James Aspnes on the acceptance of our paper "Toward the First SDN Programming Capacity Theorem on Realizing High-Level Programs on Low-Level Datapaths" by IEEE INFOCOM 2018.

  • [11/27/2017] Congratulations to Kai and Jensen (first-year PhD student!) on the acceptance of our paper "Prophet: Fast, Accurate Throughput Prediction with Reactive Flows" by IEEE INFOCOM 2018.

  • [10/17/2017] Our project, Programming and Interconnection (East-West) Abstractions and Formalization for Software-Defined Coalitions, in collaboration with ARL, Dstl, IBM Watson, and UCL, is selected for BPP18 (Jan. 1, 2018-Dec. 31, 2019), in the Distributed Analytics and Information Science (DAIS) program sponsored by U.S. ARL and U.K. Dstl. If you are interested in PhD or a Postdoc designing programmable networks in a challenging setting, with a good team of collaborators, please send me a note.

  • [10/13/2017] Key components (FAST Maple and SFP) of our system to design ExaScale Data Sciences are accepted as a paper in INDIS 2017 (part of SC17 program) and a demo of NRE (Network Control and Multi-domain Interconnection Programming for Next-Generation Data-Intensive Sciences).

  • [08/29/2017] We are looking for motivated students/postdocs in the general networking area to join our group. One of our main current research projects is programmable networks, for both general networks and specialized networks including science networks (we are deploying our system on Yale Science Network, working with CalTech to apply SDN to LHC/CMS), tactical coalition networks, and emerging 5G/IoT networks.

    We offer great research opportunities (e.g., my group publishs consistently in SIGCOMM, the top networking conference), systems development opportunities (e.g., my group contributes actively to OpenDaylight, the largest open-source SDN network OS), and standards opportunities (e.g., my research is the foundation of the IETF ALTO Working Group). Please drop me a note if you are interested.

Basic info

Professor Y. Richard Yang is a member of the Computer Systems Lab at Yale, where he founded and leads the Laboratory of Networked Systems (LANS). His research spans areas including computer networks, mobile computing, wireless networking, and network security. His work has been implemented/adopted in products/systems of major companies (e.g., AT&T, Alcatel-Lucent, Cisco, Google, Microsoft, Youku), and featured in mainstream media including Economist, Forbes, Guardian, Chronicle of Higher Education, Information Week, MIT Technology Review, Science Daily, USA Today, Washington Post, and Wired, among others.

Current projects and recent publications

  • SDN programming
    • SFP: A Novel, Scalable, SDN Federation Protocol. In Proceedings of the DAIS Workshop. August 2017.
    • ExaO: Toward Programmable Control for ExaScale Science. In Proceedings of the DAIS Workshop. August 2017.
    • Magellan: Generating High-Quality Multi-Table Datapath from Datapath Oblivious Algorithmic SDN Policies. Appeared in Proceedings of ACM SIGCOMM 2016; pages 593-594; August 2016. pdf
    • FAST: A Simple Programming Abstraction for Complex State-Dependent SDN Programming. Appeared in Proceedings of ACM SIGCOMM 2016; pages 579-580; August 2016. pdf
    • SDN Programming: Problems and Progress, 2016 (in Chinese). pdf
    • Tango: Simplifying SDN Programming with Automatic Switch Behavior Inference, Abstraction and Optimization. In Proceedings of CoNEXT 2014, December 2014. pdf
    • Maple: Simplifying SDN Programming Using Algorithmic Policies. In Proceedings of ACM SIGCOMM 2013; pages 87-98; August 2013. pdf
  • Application-network interaction (Resource model)
    • IETF draft: ALTO Incremental Updates Using Server-Sent Events (SSE). July 2017. link
    • IETF draft: ALTO Extension: Path Vector Cost Mode. July 2017. link
    • NOVA: Towards On-Demand Equivalent Network View Abstraction for Network Optimization; In Proceedings of IWQoS 2017; June 2017. pdf
    • ORSAP: Abstracting Routing State on Demand. In Proceedings of IEEE ICNP; pages 1-2; November 2016. pdf
    • RFC7285: The ALTO Protocol. 2015. spec
  • Network function virtuaization
    • My PACE slides at DIMACS Cloud Worshop.
  • Massive MIMO

Teaching calendar

Office hours are at 208A. If you can't make it to my open office hours, please send me email to make an appointment.

Project funding

  • "Distributed Distributed Analytics and Information Science International Technology Alliance," US Army and UK MoD, $2,480,675 (First 5 years, with L. Tassiulas, N. Christakis), 10/01/2016-09/30/2021 (may extend another 5 years).

  • "Dynamically Optimizing Research Data Workflow with a Software Defined Science Network," NSF CC-IIE Integration 1440745, $788,605 (PI; Co-PIs: Andrew Sherman, Robert Bjornson, and David Galassi), 10/1/2014 - 09/30/2017.

  • "NeTS:Small:Collaborative Research: LAWN: Scaling Up Cellular Data Networks using a Large Number of Antennas,'' NSF CNS-1218457, $140,000 (PI), 08/01/2012 - 07/31/2016.

  • "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 funding from Altera, Amazon, Google, Huawei, and Microsoft Research.

Some past 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.

Previously, 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).

Some past publications

Publications up to 2012; will update to 2016 soon:

  • 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:

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. 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

More personal info

  • Short bio: Dr. Y. Richard Yang is a Professor of Computer Science and Electrical Engineering at Yale University, where he founded and leads the Laboratory of Networked Systems (LANS). Dr. Yang's research is supported by both US government funding agencies and leading industrial corporations, and spans areas including computer networks, mobile computing, wireless networking, and network security. His work has been implemented/adopted in products/systems of major companies (e.g., AT&T, Alcatel-Lucent, Cisco, Google, Microsoft, Youku), and featured in mainstream media including Economist, Forbes, Guardian, Chronicle of Higher Education, Information Week, MIT Technology Review, Science Daily, USA Today, Washington Post, and Wired, among others. His awards include a CAREER Award from the National Science Foundation and a Google Faculty Research Award. Dr. Yang's 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: 12/20/2016 22:43:53 -0500