Capacity Allocation in Queuing Networks

Date:  Oct. 26, 2009
Time:  12:45 p.m.
Place:  3210 Shelby Center

Ton Dieker
Assistant Professor
H. Milton Stewart School of Industrial and Systems Engineering
Georgia Institute of Technology

Dieker joined the faculty at Georgia Tech in fall 2008. He came to Atlanta from the IBM T.J. Watson Research Center, where he spent a year as the 2007-2008 IBM Herman Goldstine Memorial Postdoctoral Fellow in Mathematical Sciences. Prior to that, he worked at the University College Cork, Ireland, as a postdoctoral researcher. Dieker earned a master's degree in operations research from the Vrije Universiteit Amsterdam in 2002 and a doctoral degree from the University of Amsterdam in 2006. His thesis was awarded an Applied Probability Trust award, the 2006 Stieltjes prize for mathematics and the 2006-2008 Gijs de Leve prize for mathematics of operations research.

Abstract

Capacity Allocation in Queuing Networks
Dieker will discuss the allocation of service capacity at stations in queuing networks. He will also describe work in progress with IBM on an algorithm that serves as an approximation for the best capacity allocation rule, which can be interpreted as a fixed-point iteration algorithm. Dieker's research includes applied probability and applications to communication networks and business processes, such as workforce management and service systems. He has worked on simulation techniques, random processes with long memory and heavy tails, as well as diffusion approximations. His current research interests include capacity planning problems for stochastic networks and the use of enumerative combinatorics in applied probability.