The UvA-LINKER will give you a range of other options to find the full text of a publication (including a direct link to the full-text if it is located on another database on the internet).
De UvA-LINKER biedt mogelijkheden om een publicatie elders te vinden (inclusief een directe link naar de publicatie online als deze beschikbaar is in een database op het internet).
| Authors||I. Adan, M. Mandjes, W. Scheinhardt, E. Tzenova|
|Title||On a generic class of two-node queueing systems|
|Title series||Eurandom report series|
|Faculty||Faculty of Economics and Business|
|Institute/dept.||FEB: Amsterdam School of Economics Research Institute (ASE-RI)|
|Abstract||This paper analyzes a generic class of two-node queueing systems. A first queue is fed by an on-off Markov uid source; the input of a second queue is a function of the state of the Markov uid source as well, but now also of the first queue being empty or not. This model covers the classical two-node tandem queue and the two-class priority queue as special cases. Relying predominantly on probabilistic argumentation, the steady-state buffer content of both queues is determined (in terms of its Laplace transform). Interpreting the buer content of the second queue in terms of busy periods of the first queue, the (exact) tail asymptotics of the distribution of the second queue are found. Two regimes can be distinguished: a first in which the state of the first queue (that is, being empty or not) hardly plays a role, and a second in which it explicitly does. This dichotomy can be understood by using large-deviations heuristics.|
Use this url to link to this page: http://dare.uva.nl/en/record/303536
Contact us about this recordNotify a colleague
Add to bookbag