I encourage you to consider applying to our graduate program... What kind of areas are you interested in pursuing?
-- Jen
译文：
阳，
你好，很高兴收到来信。我目前主要致力于企业及数据中心网络的研究，同时也在从事一些域间路由的项目。我感兴趣的方向为简化企业及数据中心网络的管理操作以及通过负载平衡和构建新网络来设计支持地域复制服务的网络。总体来说，我喜欢解决重要的、跟现实密切相关的问题，这类问题能够带来有趣的理论上的技巧（例如：优化理论、博弈论、加密技术、算法及数据结构）或关系到设计并构建一个真实系统，抑或二者兼而有之。我的工作与企业密切相关（谷歌、因特尔、美国电话电报公司、微软），从而我更多地了解到他们所面临的挑战，获悉测量数据并获得将理论观点转化为实践的路径。近期我也一直在我的一些项目中使用OpenFlow交换平台，目前我们在普林斯顿配置我们的部门网络。和我一起工作的教员包括Mung Chiang（普林斯顿大学电子工程系）、Mike Freedman（普林斯顿大学计算机科学系）、Nick Feamster（佐治亚理工大学），Nick McKeown（斯坦福大学）、Scott Shenker（加州大学伯克利分校）以及Matt Caesar（伊利诺伊大学香槟分校）。
我建议你考虑申请我们的研究生项目，你对哪些领域比较感兴趣？
--珍
UIUC（伊利诺依大学香槟分校）的Brighten Godfrey教授在给简阳的回信中写道：
Hello Yang,
Thanks for your interest. I agree with you that research that theoretical and algorithmic techniques can be quite powerful when applied to networking and systems design, and my group does a lot of this kind of research. For example, one of my students is using game theory to quantify how much damage denial-of-service attacks can do to a network under certain protection mechanisms. Another project in my group (just funded by the NSF) is developing protocols to route directly on flat names, rather than hierarchical IP addresses, while guaranteeing near-optimal latency and scalability. This project builds on work in compact routing theory but has to address some difficult practical challenges like developing a decentralized, dynamic protocol. I also think practical systems work can lead to interesting theoretical questions. For example, in this scalable routing project, it turns out that we can perform provably better on sparse graphs (which is the realistic case); quantifying the optimal algorithms for sparse graphs seems like a very interesting and difficult theoretical problem.
If you are interested in hearing more about these or other areas my group is working in, I'd be happy to discuss more.
I have found UIUC to be a great place to work on networked systems, algorithms, and theory. My students and I are collaborating with two of the algorithms professors, Sariel Har-Peled and Chandra Chekuri. We have a number of faculty interested in theoretical aspects of networks, including Nikita Borisov, R. Srikant, Tamer Basar, and Indy Gupta, plus more generally a large and exciting systems group doing interesting work in large-scale cloud computing, parallel computing, web security and more. But most importantly there are really top-notch students here.
