Onno Boxma focuses on Queue, Queueing theory, Real-time computing, Service and M/G/1 queue. His Queue study introduces a deeper knowledge of Computer network. He interconnects Measure and Applied mathematics in the investigation of issues within Queueing theory.
The Real-time computing study which covers Operations research that intersects with Server. His Service research includes elements of Conservation law and Decomposition. Onno Boxma has included themes like Discrete mathematics, Moment, Pareto distribution and M/G/k queue in his M/G/1 queue study.
Queue, Queueing theory, Computer network, Service and M/G/1 queue are his primary areas of study. His Queue study incorporates themes from Workload, Polling, Mathematical optimization and Applied mathematics. His Queueing theory research integrates issues from Poisson distribution, Exponential distribution, Real-time computing and Lévy process.
His work deals with themes such as Processor sharing and Operations research, which intersect with Service. His work carried out in the field of M/G/1 queue brings together such families of science as Discrete mathematics and M/G/k queue. The M/G/k queue study combines topics in areas such as M/M/1 queue and Bulk queue.
His main research concerns Queue, Queueing theory, Computer network, Mathematical optimization and Applied mathematics. A large part of his Queue studies is devoted to Polling system. His Queueing theory research includes themes of Factorization, Duality, Lévy process and Operations research.
His study in Service extends to Computer network with its themes. His biological study spans a wide range of topics, including Distribution and Recursion. His Real-time computing research is multidisciplinary, incorporating elements of M/G/k queue, M/G/1 queue, Bulk queue and Multilevel queue.
Onno Boxma mainly focuses on Queue, Queueing theory, Polling system, Computer network and Exponential distribution. His Queue research is multidisciplinary, incorporating perspectives in Discrete mathematics, Process and Mathematical optimization. His study in Queueing theory is interdisciplinary in nature, drawing from both Duality, Statistical physics and Duality.
His Polling system study integrates concerns from other disciplines, such as Real-time computing and Order picking. His research integrates issues of Workload and Service in his study of Computer network. The various areas that Onno Boxma examines in his Fork–join queue study include G/G/1 queue, Bulk queue, M/G/k queue and Multilevel queue.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Boundary value problems in queueing system analysis
Jacob Willem Cohen;O. J. Boxma.
Pseudo-conservation laws in cyclic-service systems
OJ Onno Boxma;WP Groenendijk.
Journal of Applied Probability (1987)
Workloads and waiting times in single-server systems with multiple customer classes
O. J. Boxma.
Queueing Systems (1989)
A ruin model with dependence between claim sizes and claim intervals
Hansjörg Albrecher;Onno J. Boxma.
Insurance Mathematics & Economics (2004)
Useful martingales for stochastic storage processes with Lévy-type input
Offer Kella;Onno J. Boxma.
Journal of Applied Probability (1992)
Approximations of the Mean Waiting Time in an M/G/s Queueing System
OJ Onno Boxma;JW Cohen;N Huffels.
Operations Research (1979)
On the discounted penalty function in a Markov-dependent risk model
Hansjörg Albrecher;Hansjörg Albrecher;Onno J. Boxma.
Insurance Mathematics & Economics (2005)
Dominance relations in polling systems
H. Levy;M. Sidi;O. J. Boxma.
Queueing Systems (1990)
Sojourn time asymptotics in the M / G / 1 processor sharing queue
A. P. Zwart;O. J. Boxma.
Queueing Systems (2000)
Approximate analysis of exponential queueing systems with blocking
Onno J. Boxma;Alan G. Konheim.
Acta Informatica (1980)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: