Personal tools
You are here: Home People George Kesidis
George Kesidis
Document Actions

George Kesidis

  • Professor
338J IST Building
University Park, PA 16802
Phone: (814) 865-9190


  1. Ph.D., University of California at Berkeley


George Kesidis received a B.A.Sc. in EE from the University of Waterloo, Canada, in 1988 and his M.S. and Ph.D. in EECS from U.C. Berkeley in 1990 and 1992, respectively. He was a professor in the E&CE Department of the University of Waterloo, Canada, from 1992 to 2000. Since 2000, he has been a professor in both the Electrical Engineering (EE) and Computer Science and Engineering (CSE) Departments of the Pennsylvania State University. In 1999, he took a sabbatical with Nortel Networks, Ottawa, and has worked with Newbridge (now Alcatel) and Mahi Networks.  He has served on the editorial board of the Computer Networks Journal, ACM TOMACS, and IEEE ComST and has served as technical program committee co-chair of IEEE INFOCOM 2007.  Currently, he is a senior member of the IEEE.

Research Interests:

Modeling and Performance Evaluation of Communication/Computer Networking Mechanisms, Scheduling and Routing, Internet Security, Network Economics and Games

Selected Publications:


  1. Raghuram, J., D.J. Miller, G. Kesidis and C. Collins. July 2012. Improved Generative Semisupervised Learning Based on Fine-Grained Component-Conditional Class Labeling. Neural Computation 24(7).

  2. Kesidis, G. An Introduction to Models of Online Peer-to-Peer Social Networking. Morgan & Claypool Publ., San Francisco, 2010.
  3. Kesidis, G., M. Vojnovic, I. Hamadeh, Y. Jin, S. Jiwasurat. April 2008. A Model of the Spread of Randomly Scanning Internet Worms that Saturate Access Links. ACM Transactions on Modeling and Computer Simulation (TOMACS) 18(2).

  4. Jin, Y., G. Kesidis. October 2005. Dynamics of Usage-priced Communication Networks: The Case of a Single Bottleneck Resource. IEEE Transactions on Networking (ToN) 13(5):1041-1053. 
  5. Kesidis, G., T. Konstantopoulos. September 2000. Extremal Traffic and Worst-Case Performance for Queues with Shaped Arrivals. Proceedings of Field Institute Workshop on Analysis and Simulation of Communication Networks, AMS Publishers.