| Publication | Date of Publication | Type |
|---|
Stochastic epidemic spreading: not all super-spreading processes are born equal, neither all lockdown strategies
Stochastic Models | 2024-02-12 | Paper |
On fairness in polling systems
Annals of Operations Research | 2022-11-09 | Paper |
Admit or preserve? Addressing server failures in cloud computing task management
Queueing Systems | 2020-03-26 | Paper |
| scientific article; zbMATH DE number 7042534 (Why is no real title available?) | 2019-03-26 | Paper |
Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks
IEEE Transactions on Computers | 2017-07-12 | Paper |
QUANTIFYING FAIRNESS IN QUEUING SYSTEMS
Probability in the Engineering and Informational Sciences | 2008-11-25 | Paper |
Locality of reference and the use of sojourn time variance for measuring queue unfairness
Operations Research Letters | 2008-01-21 | Paper |
A resource allocation queueing fairness measure: properties and bounds
Queueing Systems | 2007-09-06 | Paper |
Protecting bursty applications against traffic aggressiveness
Computer Networks | 2007-08-23 | Paper |
Top percentile network pricing and the economics of multi-homing
Annals of Operations Research | 2007-02-05 | Paper |
Buffer Requirements and Server Ordering in a Tandem Queue with Correlated Service Times
Mathematics of Operations Research | 2005-11-11 | Paper |
On measuring fairness in queues
Advances in Applied Probability | 2005-03-30 | Paper |
Announced dynamic access probability protocol for next generation wireless networks.
Computer Networks | 2003-08-07 | Paper |
Cell identification codes for tracking mobile users
Wireless Networks | 2003-02-19 | Paper |
Customer delay in very large multi-queue single-server systems
Performance Evaluation | 1997-02-27 | Paper |
Should caches be split or shared? Analysis using the superposition of bursty stack depth processes
Performance Evaluation | 1997-02-27 | Paper |
| The individual station technique for the analysis of cyclic polling systems | 1997-02-11 | Paper |
A Sequence of Servers with Arbitrary Input and Regular Service Times Revisited
Management Science | 1996-10-20 | Paper |
Queueing in space
Advances in Applied Probability | 1995-11-06 | Paper |
Correction to equation (5.6) in the paper: A queueing network with a single cyclically roving server
Queueing Systems | 1994-05-18 | Paper |
Pseudo-cyclic policies for multi-queue single server systems
Annals of Operations Research | 1994-03-10 | Paper |
Efficient visit orders for polling systems
Performance Evaluation | 1993-12-20 | Paper |
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
Annals of Operations Research | 1993-01-16 | Paper |
A queueing network with a single cyclically roving server
Queueing Systems | 1992-09-27 | Paper |
Polling systems with zero switch-over periods: a general method for analyzing the expected delay
Performance Evaluation | 1992-08-13 | Paper |
A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems
Operations Research Letters | 1992-06-27 | Paper |
Efficient visit frequencies for polling tables: Minimization of waiting cost
Queueing Systems | 1992-06-25 | Paper |
Lock and no-lock mortgage plans: Is it only a matter of risk shifting?
Operations Research Letters | 1991-01-01 | Paper |
Dominance relations in polling systems
Queueing Systems | 1990-01-01 | Paper |
Modeling and dynamic scheduling of a queueing system with blocking and starvation
IEEE Transactions on Communications | 1989-01-01 | Paper |
The Analysis of Random Polling Systems
Operations Research | 1988-01-01 | Paper |
A contraction algorithm for finding small cycle cutsets
Journal of Algorithms | 1988-01-01 | Paper |
A Queue with Starter and a Queue with Vacations: Delay Analysis by Decomposition
Operations Research | 1986-01-01 | Paper |
