Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Johan S. Leeuwaarden"'
Publikováno v:
Queueing Systems: Theory and Applications, 77(2), 211-242. Springer
We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the optimal thr
Publikováno v:
Queueing Systems: Theory and Applications, 74(2-3), 273-302. Springer
We consider a system in which customers join upon arrival the shortest of two single-server queues. The interarrival times between customers are Erlang distributed and the service times of both servers are exponentially distributed. Under these assum
Publikováno v:
Queueing Systems: Theory and Applications, 63(1-4), 459-475. Springer
We consider a class of piecewise deterministic Markov processes that occur as scaling limits of Markov chains describing the Transmission Control Protocol (TCP). The class of processes allows for general increase and decrease profiles. Our key observ
Publikováno v:
Queueing Systems: Theory and Applications, 56(3-4), 229-240. Springer
We propose a new queueing model named the acquisition queue. It differs from conventional queueing models in that the server not only serves customers, but also performs acquisition of new customers. The server has to divide its energy between both a
Publikováno v:
Janssen, A J E M, van Leeuwaarden, J S H & Zwart, A P 2011, ' A lower bound for the Erlang C formula in the Halfin-Whitt regime. ', Queueing Systems, vol. 2011, pp. 361-363 . https://doi.org/10.1007/s11134-011-9244-z
Queueing Systems, 2011, 361-363. Springer Netherlands
Queueing Systems: Theory and Applications, 68(3-4), 361-363. Springer
Queueing Systems, 2011, 361-363. Springer Netherlands
Queueing Systems: Theory and Applications, 68(3-4), 361-363. Springer
One of the classical models of queueing theory is the M/M/s queue or Erlang delay model. This model has s homogeneous servers working in parallel. Customers arrive according to a Poisson process with arrival rate λ, and the service times are indepen
Publikováno v:
Queueing Systems: Theory and Applications, 78(2), 189-195. Springer
Contrary to what we claimed in [5], the solution to the Riemann–Hilbert problem (4) considered in [5] for some domain Dx is in general not the restriction to Dx of the solution to the modified Riemann–Hilbert problem (6) in [5]. This occurs only
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b96554058e3587270a9b8387e60e3d47
https://research.tue.nl/nl/publications/b01e02c6-53ee-476a-aaf2-228b1c8faa1f
https://research.tue.nl/nl/publications/b01e02c6-53ee-476a-aaf2-228b1c8faa1f
Publikováno v:
Queueing Systems: Theory and Applications, 76(1), 109-110. Springer
No abstract.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e03cc702b5a420009cbbfd29ac966e20
https://research.tue.nl/nl/publications/0add812f-707c-4541-b0a5-765ccc7aa844
https://research.tue.nl/nl/publications/0add812f-707c-4541-b0a5-765ccc7aa844
Publikováno v:
Queueing Systems: Theory and Applications, 74(2-3), 235-272. Springer
We study the stationary distribution of a random walk in the quarter plane arising in the study of three-hop wireless networks with stealing. Our motivation is to find exact tail asymptotics (beyond logarithmic estimates) for the marginal distributio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01ef5aa7f600f51f30c8f9425a645842
https://research.tue.nl/nl/publications/488374ab-0656-4846-a4c5-7d277d14d744
https://research.tue.nl/nl/publications/488374ab-0656-4846-a4c5-7d277d14d744
Publikováno v:
Queueing Systems: Theory and Applications, 68(3-4), 321-331. Springer
We introduce a novel class of tandem queueing networks which arise in modeling the congestion behavior of wireless multi-hop networks with distributed medium access control. These models provide valuable insight in how the network performance in term
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::265fb9e5efef748e9f632a8257cb7ed6
https://research.tue.nl/nl/publications/4ec1b6ba-1878-4d58-a280-c4db59dc85ec
https://research.tue.nl/nl/publications/4ec1b6ba-1878-4d58-a280-c4db59dc85ec
Publikováno v:
QUEUEING SYSTEMS
Queueing Systems
Queueing Systems, Springer Verlag, 2010, 66 (2), pp.107-130. ⟨10.1007/s11134-010-9188-8⟩
Queueing Systems: Theory and Applications, 66(2), 107-130. Springer
Queueing Systems
Queueing Systems, Springer Verlag, 2010, 66 (2), pp.107-130. ⟨10.1007/s11134-010-9188-8⟩
Queueing Systems: Theory and Applications, 66(2), 107-130. Springer
We develop power series approximations for a discrete-time queueing system with two parallel queues and one processor. If both queues are nonempty, a customer of queue 1 is served with probability ß, and a customer of queue 2 is served with probabil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::efeff2f7c622a579596659766580a4e6
https://biblio.ugent.be/publication/1059560
https://biblio.ugent.be/publication/1059560