I've had the pleasure of working with great students.
Most of what I really understand in my field, I learned in working with them.

Bob Carter PhD 1998
Thesis Title: Performance Measurement and Prediction in Packet-Switched Networks: Techniques and Applications

Bob's thesis was focused on how to choose the best server when data is replicated in the Internet, which we called the "server selection problem." To address this, Bob built, validated, and distributed the first robust tools for bottleneck bandwidth measurement. Subsequent to Bob's work, a number of other reseachers picked up the problem and it has become an active area of ongoing investigation.

Bob is currently (2004) Research Assistant Professor, Lane Department of Computer Science and Electrical Engineering, West Virginia University.

Paul Barford PhD 2000
Thesis Title: Modeling, Measurement, and Performance of World Wide Web Transactions

Paul's thesis was motivated by the simple question: "Why is the Web so slow?" - which turned out to have very interesting answers. In the process, Paul developed statistical models of Web workloads, a distributed Web measurement platform, and an innovative method for analyzing Web transactions based on the idea of critical path analysis.

Paul is currently (2011) Professor, Department of Computer Science, University of Wisconsin (Madison).

Jun Liu PhD 2002
Thesis Title: Characterizing Network Elements and Paths Using Packet Loss Behavior

Jun's thesis work concentrated on trying to understand the conditions during packet loss in the Internet. He developed methods for estimating buffer sizes in routers, and for isolating lossses in wireless settings, based on the technique he developed called "loss pairs."

Jun is currently (2011) Associate Professor, Department of Computer Science, University of North Dakota.

Anukool Lakhina PhD 2006
Thesis Title: Network-Wide Traffic Analysis: Methods and Applications

Anukool's thesis research was concerned with a new kind of traffic analysis, namely network-wide. He developed the first methods for characterizing and understanding the ensemble of traffic flows in a network as a whole. He showed that the resulting methods have considerable power for detecting and classifying network anomalies.

Anukool is currently (2011) Founder and CEO, Guavus LLC.

Nahur Fonseca PhD 2008
Thesis Title: Stochastic Modeling Applied to Detection Problems in Network Protocols and Traffic

Nahur's thesis research looked at ways that stochastic models could be used to improve network performance. He used Bayes detectors to improve TCP's packet loss identification algorithm, and he showed the existence of a new kind of long-range memory in network traffic, which has implications for anomaly detection.

Nahur is currently (2011) Performance Engineer at Akamai, Inc.

Vijay Erramilli PhD 2008
Thesis Title: Forwarding in Mobile Opportunistic Networks

Vijay's thesis research looked at a new kind of network: one formed by people as they carry around mobile devices like phones. He characterized these networks' properties, and developed new, efficient forwarding algorithms for use in such networks.

Vijay is currently (2011) Research Scientist at Telefonica I+D.

Gonca Gürsun PhD 2013
Thesis Title: Inferring Hidden Features in the Internet

Gonca's thesis research developed new ways of estimating properties of the Internet that are hard or impossible to directly measure. She showed how to infer both the path that traffic takes and the amount of traffic that flows in situations where those quantities can't be directly observed. To do this she developed new metrics for analyzing routing, and new methods of traffic inference.

Gonca is currently (2013) Assistant Professor, Department of Computer Science, Özyeğin University.

Andrej Cvetkovski PhD 2013
Thesis Title: Graph Embeddings for Low-Stretch Greedy Routing

Andrej's thesis research developed algorithms and heuristics to improve greedy routing -- routing in which a packet is forwarded to the neighbor closest to the destination. Andrej's work made heavy use of hyperbolic geometry, and relied on embedding network nodes in the Poincare disk. He showed how to enable growing graphs, embed weighted graphs with low distortion, and achieve greedy routing with low stretch (short paths).

Andrej is currently (2015) Assistant Professor, School of Informatics, European University, Republic of Macedonia.

If you'd like to read more about any of these projects,
all of the papers I have written with my students are available from my publications page.