Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1993375#aggregation> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- aggregation classification "A1".
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation creator person.
- aggregation date "2011".
- aggregation format "application/pdf".
- aggregation hasFormat 1993375.bibtex.
- aggregation hasFormat 1993375.csv.
- aggregation hasFormat 1993375.dc.
- aggregation hasFormat 1993375.didl.
- aggregation hasFormat 1993375.doc.
- aggregation hasFormat 1993375.json.
- aggregation hasFormat 1993375.mets.
- aggregation hasFormat 1993375.mods.
- aggregation hasFormat 1993375.rdf.
- aggregation hasFormat 1993375.ris.
- aggregation hasFormat 1993375.txt.
- aggregation hasFormat 1993375.xls.
- aggregation hasFormat 1993375.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 "Partially shared buffers with full or mixed priority".
- aggregation abstract "This paper studies a finite-sized discrete-time two-class priority queue. Packets of both classes arrive according to a two-class discrete batch Markovian arrival process (2-DBMAP), taking into account the correlated nature of arrivals in heterogeneous telecommunication networks. The model incorporates time and space priority to provide different types of service to each class. One of both classes receives absolute time priority in order to minimize its delay. Space priority is implemented by the partial buffer sharing acceptance policy and can be provided to the class receiving time priority or to the other class. This choice gives rise to two different queueing models and this paper analyses both these models in a unified manner. Furthermore, the buffer finiteness and the use of space priority raise some issues on the order of arrivals in a slot. This paper does not assume that all arrivals from one class enter the queue before those of the other class. Instead, a string representation for sequences of arriving packets and a probability measure on the set of such strings are introduced. This naturally gives rise to the notion of intra-slot space priority. Performance of these queueing systems is then determined using matrix-analytic techniques. The numerical examples explore the range of service differentiation covered by both models.".
- aggregation authorList BK509280.
- aggregation endPage "751".
- aggregation issue "3".
- aggregation startPage "735".
- aggregation volume "7".
- aggregation aggregates 1993401.
- aggregation aggregates 2024925.
- aggregation isDescribedBy 1993375.
- aggregation similarTo jimo.2011.7.735.
- aggregation similarTo LU-1993375.