I encourage you to consider applying to our graduate program... What kind of areas are you interested in pursuing?

-- Jen

譯文：

陽，

你好，很高興收到來信。我目前主要致力于企業(yè)及數(shù)據(jù)中心網(wǎng)絡(luò)的研究，同時也在從事一些域間路由的項(xiàng)目。我感興趣的方向?yàn)楹喕髽I(yè)及數(shù)據(jù)中心網(wǎng)絡(luò)的管理操作以及通過負(fù)載平衡和構(gòu)建新網(wǎng)絡(luò)來設(shè)計支持地域復(fù)制服務(wù)的網(wǎng)絡(luò)?？傮w來說，我喜歡解決重要的、跟現(xiàn)實(shí)密切相關(guān)的問題，這類問題能夠帶來有趣的理論上的技巧（例如：優(yōu)化理論、博弈論、加密技術(shù)、算法及數(shù)據(jù)結(jié)構(gòu)）或關(guān)系到設(shè)計并構(gòu)建一個真實(shí)系統(tǒng)，抑或二者兼而有之。我的工作與企業(yè)密切相關(guān)（谷歌、因特爾、美國電話電報公司、微軟），從而我更多地了解到他們所面臨的挑戰(zhàn)，獲悉測量數(shù)據(jù)并獲得將理論觀點(diǎn)轉(zhuǎn)化為實(shí)踐的路徑。近期我也一直在我的一些項(xiàng)目中使用OpenFlow交換平臺，目前我們在普林斯頓配置我們的部門網(wǎng)絡(luò)。和我一起工作的教員包括Mung Chiang（普林斯頓大學(xué)電子工程系）、Mike Freedman（普林斯頓大學(xué)計算機(jī)科學(xué)系）、Nick Feamster（佐治亞理工大學(xué)），Nick McKeown（斯坦福大學(xué)）、Scott Shenker（加州大學(xué)伯克利分校）以及Matt Caesar（伊利諾伊大學(xué)香檳分校）。

我建議你考慮申請我們的研究生項(xiàng)目，你對哪些領(lǐng)域比較感興趣？

--珍

UIUC（伊利諾依大學(xué)香檳分校）的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.