#### Filter Results:

- Full text PDF available (61)

#### Publication Year

2001

2017

- This year (5)
- Last 5 years (43)
- Last 10 years (75)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ivo J. B. F. Adan, Johan van Leeuwaarden, Erik M. M. Winands
- Oper. Res. Lett.
- 2006

For queueing models that can be analyzed as (embedded) Markov chains, many results are presented in terms of the probability generating function (PGF) of the stationary queue length distribution. Queueing models that belong to this category are bulk service queues, M/G/l and G/M/l-type queues, and discrete or discrete-time queues. The determination of the… (More)

- Peter M. van de Ven, Johan van Leeuwaarden, Dee Denteneer, Augustus J. E. M. Janssen
- Perform. Eval.
- 2012

Random-access networks may exhibit severe unfairness in throughput, in the sense that some nodes receive consistently higher throughput than others. Recent studies show that this unfairness is due to local differences in the neighborhood structure: nodes with fewer neighbors receive better access. We study the unfairness in saturated linear networks, and… (More)

- Augustus J. E. M. Janssen, Johan van Leeuwaarden, Bert Zwart
- Queueing Syst.
- 2008

To obtain insight in the quality of heavy-traffic approximations for queues with many servers, we consider the steady-state number of waiting customers in an M/D/s queue as s → ∞. In the Halfin-Whitt regime, it is well known that this random variable converges to the supremum of a Gaussian random walk. This paper develops methods that yield more accurate… (More)

In this paper we consider a class of quasi-birth-and-death processes for which explicit solutions can be obtained for the rate matrix R and the associated matrix G. The probabilistic interpretations of these matrices allow us to describe their elements in terms of paths on the two-dimensional lattice. Then determining explicit expressions for the matrices… (More)

- Benny Van Houdt, Johan van Leeuwaarden
- INFORMS Journal on Computing
- 2011

- Augustus J. E. M. Janssen, Johan van Leeuwaarden
- IJWMIP
- 2005

We consider a discrete-time multi-server queue for which the moments of the stationary queue length can be expressed in terms of series over the zeros in the closed unit disk of a queue-specific characteristic function. In many important cases these zeros can be considered to be located on a queue-specific curve, called generalized Szegö curve. By adopting… (More)

- Johan van Leeuwaarden
- Transportation Science
- 2006

- Johan van Leeuwaarden, Jacques Resing
- Queueing Syst.
- 2005

In [13] it is shown that the two-stage tandem queue with coupled processors can be solved using the theory of boundary value problems. In this paper we consider the issues that arise when calculating performance measures like the mean queue length and the fraction of time a station is empty. It is assumed that jobs arrive at the first station according to a… (More)

- Peter M. van de Ven, Sem C. Borst, Johan van Leeuwaarden, Alexandre Proutière
- Perform. Eval.
- 2010

Random-access algorithms such as the Carrier-Sense Multiple-Access (CSMA) protocol provide a popular mechanism for distributed medium access control in large-scale wireless networks. In recent years, fairly tractable models have been shown to yield remarkably accurate throughput estimates for CSMA networks. These models typically assume that both the… (More)

- Augustus J. E. M. Janssen, Johan van Leeuwaarden, Bert Zwart
- Operations Research
- 2011

We apply a new corrected diffusion approximation for the Erlang C formula to determine staffing levels in cost minimization and constraint satisfaction problems. These problems are motivated by large customer contact centers that are modeled as an M/M/s queue with s the number of servers or agents. The proposed staffing levels are refinements of the… (More)