Resource Sharing in Networks

Frank P. Kelly University of Cambridge The Old Schools Trinity Lane Cambridge CB2 1TN United Kingdom
Wednesday, 17 Feb 2010 (all day)
How should flows through a network be organized so that resources are shared fairly, and so that the network operates in a stable and efficient manner? This question arises in a number of application areas, including communication and transportation networks.

This talk will review definitions of fairness, with particular emphasis on some of the attractive features of proportional fairness. Next the talk will describe stochastic models of network routing and resource allocation, when routing and scheduling policies are designed to implement proportional fairness. Particular examples discussed will include Internet congestion control and ramp metering policies for motorway networks.

Bio: Frank Kelly is Professor of the Mathematics of Systems, University of Cambridge, and Master of Christ's College. His main research interests are in random processes, networks and optimization. He is especially interested in applications to the design and control of networks and to the understanding of self-regulation in large-scale systems.

Frank Kelly has received several prizes for his work. In 1979 he won the Davidson Prize of the University of Cambridge. In 1989 he was awarded the Guy Medal in Silver of the Royal Statistical Society, and in the same year he was elected a Fellow of the Royal Society. He was awarded the 1991 Lanchester Prize of the Institute for Operations Research and the Management Sciences, and in 1997 the Naylor Prize of the London Mathematical Society. In 2005 he received the IEEE Koji Kobayashi Computers and Communications Award, in 2008 the John von Neumann Theory Prize, and in 2009 the SIGMETRICS Achievement Award and the Gold Medal of the Association of European Operational Research Societies.