Matches in UGent Biblio for { <https://biblio.ugent.be/publication/2913855#aggregation> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- aggregation classification "A1".
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2012".
- aggregation format "application/pdf".
- aggregation hasFormat 2913855.bibtex.
- aggregation hasFormat 2913855.csv.
- aggregation hasFormat 2913855.dc.
- aggregation hasFormat 2913855.didl.
- aggregation hasFormat 2913855.doc.
- aggregation hasFormat 2913855.json.
- aggregation hasFormat 2913855.mets.
- aggregation hasFormat 2913855.mods.
- aggregation hasFormat 2913855.rdf.
- aggregation hasFormat 2913855.ris.
- aggregation hasFormat 2913855.txt.
- aggregation hasFormat 2913855.xls.
- aggregation hasFormat 2913855.yaml.
- aggregation isPartOf urn:issn:1547-5816.
- aggregation language "eng".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Technology and Engineering".
- aggregation title "Stochastic decomposition in discrete-time queues with generalized vacations and applications".
- aggregation abstract "For several specific queueing models with a vacation policy, the stationary system occupancy at the beginning of a rantdom slot is distributed as the sum of two independent random variables. One of these variables is the stationary number of customers in an equivalent queueing system with no vacations. For models in continuous time with Poissonian arrivals, this result is well-known, and referred to as stochastic decomposition, with proof provided by Fuhrmann and Cooper. For models in discrete time, this result received less attention, with no proof available to date. In this paper, we first establish a proof of the decomposition result in discrete time. When compared to the proof in continuous time, conditions for the proof in discrete time are somewhat more general. Second, we explore four different examples: non-preemptive proirity systems, slot-bound priority systems, polling systems, and fiber delay line (FDL) buffer systems. The first two examples are known results from literature that are given here as an illustration. The third is a new example, and the last one (FDL buffer systems) shows new results. It is shown that in some cases the queueing analysis can be considerably simplified using this property.".
- aggregation authorList BK617280.
- aggregation endPage "938".
- aggregation issue "4".
- aggregation startPage "925".
- aggregation volume "8".
- aggregation aggregates 2913856.
- aggregation isDescribedBy 2913855.
- aggregation similarTo jimo.2012.8.925.
- aggregation similarTo LU-2913855.