|
Computer
Science and Technology FIT 4-106, |
ranusy AT gmail
DOT com +86-10-62772487 |
|
2005.08- present |
Department
of Computer Science and Technology, Master Student in
Computer Science, projected graduation date: July 2007 GPA: 90.1/100 (overall), 92.7/100 (major) |
|
2001.09- 2005.07 |
Academic Talent Program,
Department of Physics, Bachelor of Science
in Physics and Mathematics, 2005 GPA: 83.9/100
(overall), 85.5/100 (major), 90.2/100 (CS related) |
|
GRE Verbal 550 (72%); Quantitative 800 (92%);
Analytical Writing 5.0 (71%) TOEFL 66/ 68/67, total 670 TWE 5.5 |
|
|
My primary research is computer networks and
distributed systems, especially internet architecture and networked systems
targeting enterprise-wide or large-scale deployment. My long term interest
resides in building a robust, flexible inter communication infrastructure. To
achieve these goals, I would like to gain insight into problems with measurement and
analysis, and apply state-of-the-art technologies such as virtualization and
machine learning toward solutions. |
|
1. |
|
|
2. |
|
|
3. |
|
|
4. |
Zhen Chen, Chuang
Lin, Jia Ni, Dong-Hua Ruan, Bo Zheng, Zhang-Xi Tan, Yi-Xin Jiang, Xue-Hai
Peng, An-an Luo, Bing Zhu, |
|
5. |
|
|
6. |
Zhen
Chen, Chuang Lin, Jia Ni, Dong-Hua Ruan, Bo Zheng, Yi-Xin Jiang, Xue-Hai
Peng, Yang Wang, An-an Luo, Bing Zhu, |
|
NPCryptBench ( Motivation: With a growing awareness of communication
security, cryptographic processing soars at routers, servers or other nodes
on fast path. While software-based solutions have an edge in flexibility over
their hardware alternatives, the impact of implementing cryptographic
applications on network processors is not yet well studied. Description: NPCryptBench consists of ten
cryptographic benchmarks chosen on their popularity, representativeness and
availability. It focuses on the inner loops executed by data plane
processors, which present the majority of processing time and consumes considerable
power. Status: The latest releases run on six models of
the Intel IXP 12XX/2XXX Network Processors and introduce three levels of optimized
codes for each platform. Two new versions for more recent models of Intel IXP
network processors are under active development. So far, nine institutes and
universities from four countries have officially requested the package. For more information about NPCryptBench
its users, please visit NPCryptBench
Homepage. Collaborator:
Zhangxi Tan, Donghua Ruan |
|
2006 |
Oral presentation of Analyzing the
Performance and Fairness of BitTorrent-like Networks Using a General Fluid Model, at Globecom’06, |
|
2006.8- present |
Converged
Networks Group, IBM China Research Laboratory, Internship in Performance
Evaluation and Optimization of SIP-based Applications on IBM Java Virtual
Machine (Modeling and Experimentation over Test Bed) Motive:
Despite their security advantage and development convenience, performance of
servers running SIP-based applications on top of Java virtual machine (JVM)
are often questioned, mainly due to the impact of GC. The basic GC policy in
IBM JVM can be summarized as a stop-the-world mark-sweep-and-compact strategy.
Consequently, GC introduces periodical slow response intervals and message
loss. Goal: 1. To
streamline servers specifically for SIP-based applications by tuning a number
of JVM policies, such as generational GC, concurrent marking and JVM parameters.
2. Calculate performance degradation curves of an optimized server
configuration assuming certain user behavior, and point out the inflection
point of performance. Contribution: I
have carried out a series of experiments on test bed with various JVM
settings. With my testing, log parsing and plotting scripts, we are able to
decide optimal policy configurations under different traffic patterns. I have
also developed a deterministic Petri Net model to plot performance
degradation curves and to predict the inflection point. |
|
2006.9- present |
Department
of Computer Science and Technology, Graduate Research Assistant in Enhance unstructured P2P system in Privacy
and Security, a joint program with Microsoft
Research Asia Motive: While
P2P systems have an edge in scalability, they are often quested about their
fairness, privacy and security. On the other hand, efficiency, fairness and
survivability are interwoven in many P2P file sharing systems such as BitTorrent.
It is important to realize the interdependency of performance indices, and
introduce enhancement into one or more aspects of such applications
afterwards. Goal: 1. To
point out the how different aspects, such as fairness, survivability, efficiency
and etc., are related to each other. 2. To put forward an improved design to
enhance efficiency and privacy in BitTorrent like file sharing systems. 3.
Provide measurement tools to collect end-to-end performance metrics at low
communication cost for a global view of P2P systems. Contribution: Our
preliminary research on takes a modeling approach on the dynamic behavior of
BitTorrent like networks. The model reveals how fairness and survivability of
a P2P file sharing system are related to the more traditional issues like
scalability and efficiency. After realizing our first goal, an enhanced
interconnecting mechanism has been designed and implemented to improve
efficiency, security and privacy, and this mechanism could be applied to
general P2P file-sharing systems. Since achieving high security and privacy
can often be contradictory, our scheme supports flexible adaptation when a
compromise is required. In addition, a measurement tool for study E2E
performance and topology is under development to facilitate experiments on
P2P applications. Advisor:
Professor and Department Head Chuang Lin |
|
2005.9- 2006.8 |
Department of Computer Science and Technology, Graduate Research Assistant
in Intel IXA University Program (www.ixaedu.com) Motive: The functionality and
performance of many network security applications rely on an efficient,
flexible implementation of cryptographic algorithms on network processors
(NPs), especially on data plane (fast path). Necessity of benchmarking
cryptographic algorithms on NPs rises in the face of rigid hardware solutions
and unclear performance of software-based solutions. Goal: 1. Implementing
popular, representative cryptographic algorithms on network processors, with
our focus on data-plane. 2.
Benchmarking NPs to locate performance bottlenecks. 3. To alleviate the
bottlenecks with generic or model-specific optimizations. Contribution: A
major developer of NPCryptBench, a cryptographic benchmark suite for network
processors. By applying the benchmarks on several NP models we obtain
first-hand statistics. With these data performance bottlenecks under different
workloads and system configurations are successfully located. Summarized
benchmark methodology and optimization guidelines from both software and architecture
angles. Advisor: Professor and
Department Head Chuang Lin |
|
2003.9- 2004.7 |
State Key Laboratory of Intelligent Technology
and Systems, Department of Computer Science and Technology, Undergraduate research in Decision Theory and Multi-agent Systems This
is a two semester discussion group/seminar whose members study the classical
papers on decision theory and game theory used in multi-agent systems. At the
end of each semester, I concluded the seminar with a survey essay. I also
presented an introductory talk of multi-agent systems to my classmates and a
short course in game theory to my graduate colleagues. Advisor:
Professor Mingsheng Ying and Assistant Professor Sanjiang Li |
|
2006.3- present |
Teaching Assistant for Student
Research Training program
in Department of Computer Science, Tsinghua University, China Prof. Fengyuan Ren. |
|
2006 |
Frontiers on Computer Science in |
|
2006 |
IEEE Journals on Selected Areas in
Communications |
|
2006 |
The IEEE/ACM Transactions on Networking |
|
2005 |
IFIP International Conference on Network
and Parallel Computing 2005 |
|
2006 |
Friends
of Tsinghua - Siemens A&D Scholarship (First Class Scholarship, top 1%) |
|
2006 |
Women
of Color Scholarship to attend Grace
Hopper Celebration of Women in Computing
2006, |
|
2005 |
Scholarship
for the Excellency of Social Services, |
|
2004 |
Excellent
Student Leadership, |
|
2003 |
Scholarship
for the Excellency of Social Services, |
|
2002 |
Meng
Zhaoying Scholarship, |
|
1999-2001 |
Three Times Huaying
Scholoarship, Huaying
Education Foundation, |
|
1999-2001 |
Two Times First
Prize in National Competition in |
|
1999 |
First place in
National Competition in Informatics for Highschool Students ( |
|
1999 |
Bronze Medal in
National Olympiad |
|
Language: Projects in C/C++, Python, Intel IXP network processor C/ASM, Pascal,
Unix/Windows shell script language; familiar with HTML, XML, Perl, Java |
|
Tools: Maple, NS2, Gnuplot, LaTeX,
OpenSSL, TUN, Iptables, SIPp, TimeNET, SPnP |
|
Operating Systems: Linux Administration
(Fedora Core, Debian), Windows XP/2003 |
|
2005 |
Assistant of General Chair (Prof. Chuang
Lin), ACM SIGCOMM |
|
2003-2005 |
Network administrator and head of Information
Group at Student Network Service, |
|
2002-2003 |
Vice President of Physics Department Student
Union, in charge of sports |
|
2002-2005 |
Four year member of Tsinghua Chorus |
|
2002-2006 |
No No Captain of Physics Department Basketball
Team, rank |
Reference Available
upon Request