Ph.D. Graduates

• Richard G. Ogier, SRI, Dynamic routing in communication networks with continuous traffic, 1985.
• Rene L. Cruz, UCSD and Mushroom Networks, A calculus for network delay and a note on topologies of in terconnection networks, 1987.
• Galen H. Sasaki, U. Hawaii, Optimization by simulated annealing: a time-complexity analysis, 1987.
• Arvind Krishna, IBM, Communication with few buffers: analysis and design, 1990.
• Timothy Weller, Sample Path Ventures, Scheduling Non-Uniform Traffic in a Multi-Access Communication System, 1993.
• Murat Alanyali, Boston University, Analysis of some simple policies for dynamic resource allocation, 1996.
• Vijay Subramanian, Hamilton Institute, Broadband fading channels: Signal burstiness and capacity, 1999.
• Jennifer Steichen, (in Mathematics, co-advisor, D. Burkholder) Heavy traffic limit theorems for the closed Lu-Kumar network, 2000.
• James Ryan Giles, IBM, An information-theoretic and game-theoretic study of timing channels, 2000.
• Juan Alvarez, U. Toronto, Discrete stochastic modeling of ion channels, 2004.
• Vignesh Sethuraman, Qualcomm, Inc., On communication over correlated fading channels with practical power constraints, 2006.
• Sujay Sanghavi, Purdue, Decentralized network algorithms, 2006.
• Sichao Yang, Qualcomm, Inc., Reduced complexity mechanisms for network resource allocation, 2007.