Onno J. Boxma | |
---|---|
Born | 1952 (age 70–71) The Hague, the Netherlands |
Scientific career | |
Fields | Mathematician |
Institutions | Technische Universiteit Eindhoven |
Thesis | Analysis of Models for Tandem Queues [1] (1977) |
Doctoral advisor | Wim Cohen |
Onno Johan Boxma (born 1952) is a Dutch mathematician, and Professor at the Eindhoven University of Technology, known for several contributions to queueing theory and applied probability theory.
Born in The Hague, Boxma earned his B.Sc. in Mathematics at Delft University of Technology in 1974, and his Ph.D. cum laude in Mathematic from Utrecht University in 1977 on the dissertation entitled "Analysis of Models for Tandem Queues", advised by Wim Cohen. [1] [2] [3]
Boxma continued at Utrecht as faculty from 1974 to 1985, and was IBM Research postdoctoral fellow in 1978–79, before joining the faculty of Centrum Wiskunde & Informatica in Amsterdam. There he chaired the performance analysis group until 1998. He was full professor at University of Tilburg from 1987 to 1988. and since 1998 he is as full professor holding the chair of Stochastic Operations Research in the Department of Mathematics and Computer Science at Technische Universiteit Eindhoven, becoming vice dean of the department in 2009.
He was the editor-in-chief of Queueing Systems from 2004 to 2009, and scientific director of EURANDOM [4] from 2005-2010. In 2009 he was awarded an honorary degree by the University of Haifa (Israel), [5] and received the 2011 ACM SIGMETRICS Achievement Award in June 2011. [6] Also, he is honorary professor in Heriot-Watt University, Edinburgh, UK (2008-2010 and 2011-2013).
Boxma's research focuses on the field of applied probability and stochastic operations, particularly of queueing theory and its application to the performance analysis of computer, communication and production systems.
Books, a selection:
Articles, a selection:
Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted. Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service.
Francis Patrick Kelly, CBE, FRS is Professor of the Mathematics of Systems at the Statistical Laboratory, University of Cambridge. He served as Master of Christ's College, Cambridge from 2006 to 2016.
Lajos Takács was a Hungarian mathematician, known for his contributions to probability theory and in particular, queueing theory. He wrote over two hundred scientific papers and six books.
Jacob Willem "Wim" Cohen was a Dutch mathematician, well known for over hundred scientific publications and several books in queueing theory.
U. Narayan Bhat is an Indian-born Mathematician, known for his contributions to queueing theory and reliability theory.
Michael Robertus Hendrikus "Michel" Mandjes is a Dutch mathematician, known for several contributions to queueing theory and applied probability theory. His research interests include queueing models for telecommunications,traffic management and analysis, and network economics.
In probability theory, a product-form solution is a particularly efficient form of solution for determining some metric of a system with distinct sub-components, where the metric for the collection of components can be written as a product of the metric across the different components. Using capital Pi notation a product-form solution has algebraic form
The International Teletraffic Congress (ITC) is the first international conference in networking science and practice. It was created in 1955 by Arne Jensen to initially cater to the emerging need to understand and model traffic in telephone networks using stochastic methodologies, and to bring together researchers with these considerations as a common theme. Up through World War II, teletraffic research was done mainly by engineers and mathematicians working in telephone companies. Most of their work was published in local or company journals. In 1955, however, the field acquired a formal, international, institutional structure, with the organization of the first International Teletraffic Congress (ITC).
In queueing theory, a discipline within the mathematical theory of probability, a fork–join queue is a queue where incoming jobs are split on arrival for service by numerous servers and joined before departure. The model is often used for parallel computations or systems where products need to be obtained simultaneously from different suppliers. The key quantity of interest in this model is usually the time taken to service a complete job. The model has been described as a "key model for the performance analysis of parallel and distributed systems." Few analytical results exist for fork–join queues, but various approximations are known.
In queueing theory, a discipline within the mathematical theory of probability, a fluid queue is a mathematical model used to describe the fluid level in a reservoir subject to randomly determined periods of filling and emptying. The term dam theory was used in earlier literature for these models. The model has been used to approximate discrete models, model the spread of wildfires, in ruin theory and to model high speed data networks. The model applies the leaky bucket algorithm to a stochastic source.
In queueing theory, a discipline within the mathematical theory of probability, an M/G/k queue is a queue model where arrivals are Markovian, service times have a General distribution and there are k servers. The model name is written in Kendall's notation, and is an extension of the M/M/c queue, where service times must be exponentially distributed and of the M/G/1 queue with a single server. Most performance metrics for this queueing system are not known and remain an open problem.
Cyrus Derman was an American mathematician and amateur musician who did research in Markov decision process, stochastic processes, operations research, statistics and a variety of other fields.
Jacobus (Jaap) Wessels was a Dutch mathematician and Professor of Stochastic Operations Research at the Eindhoven University of Technology, known for his contributions in the field of Markov decision processes.
In queueing theory, a discipline within the mathematical theory of probability, the G/M/1 queue represents the queue length in a system where interarrival times have a general distribution and service times for each job have an exponential distribution. The system is described in Kendall's notation where the G denotes a general distribution, M the exponential distribution for service times and the 1 that the model has a single server.
European Institute for Statistics, Probability, Stochastic Operations Research and its Applications (EURANDOM) is a research institute at the Eindhoven University of Technology, dedicated to fostering research in the stochastic sciences and their applications.
François Louis Baccelli is senior researcher at INRIA Paris, in charge of the ERC project NEMO on network mathematics.
Asaf Hajiyev is the Secretary-General of the Parliamentary Assembly of the Black Sea Economic Cooperation, Former Member of National Assembly of the Republic of Azerbaijan, Doctor of Physical and Mathematical Sciences, Professor, Academician, Chair of Probability Theory and Mathematical Statistics in BSU.
Bruce Edward Hajek is a Professor in the Coordinated Science Laboratory, the head of the Department of Electrical and Computer Engineering, and the Leonard C. and Mary Lou Hoeft Chair in Engineering at the University of Illinois at Urbana-Champaign. He does research in communication networking, auction theory, stochastic analysis, combinatorial optimization, machine learning, information theory, and bioinformatics.
Frank den Hollander is a Dutch mathematician.
Amber Lynn Puha is an American mathematician and educator at California State University San Marcos. Her research concerns probability theory and stochastic processes.