Skip to content. | Skip to navigation

Sections
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

Websites:

Education:

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

Biography:

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 an associate professor in both the Electrical Engineering (EE) and Computer Science and Engineering (CSE) Departments of the Pennsylvania State University. He was promoted to a full professor in July 2006. In 1999, he took a sabbatical with Nortel Networks, Ottawa, and has worked with Newbridge (now Alcatel) and Mahi Networks. Currently, he is technical program committee co-chair of the First Workshop on Secure Network Protocols (NPSec 2005) and INFOCOM 2007, and co-editing an IEEE JSAC Special Issue on Internet Economics. He is a senior member of the IEEE.

Research Interests:

Modeling and Performance Evaluation of Communication/Computer Networks, Scheduling and Routing, Internet Security, Internet Economics

Selected Publications:

  1. Kesidis, G. July 2007. An Introduction to Communication Network Analysis. 232 pages. Wiley-IEEE Press.
  2. Kesidis, G., M. Vojnovic, I. Hamadeh, Y. Jin, S. Jiwasurat. 2007. A Model of the Spread of Randomly Scanning Internet Worms that Saturate Access Links. To appear in ACM Transactions on Modeling and Computer Simulation (TOMACS). 18 pages.
  3. Jin, Y., G. Kesidis. May 2006. Charge Sensitive and Incentive Compatible End-to-end Window-based Control for Selfish Users. IEEE Journal on Selected Areas in Communications, Special Issue on Network Economics and Pricing 24(5):952-961.
  4. Jin, Y., G. Kesidis. 2005. Dynamics of Usage-priced Communication Networks: The Case of a Single Bottleneck Resource. To appear in IEEE Transactions on Networking (ToN).
  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.