Matches in UGent Biblio for { <https://biblio.ugent.be/publication/1848733#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 "2011".
- aggregation format "application/pdf".
- aggregation hasFormat 1848733.bibtex.
- aggregation hasFormat 1848733.csv.
- aggregation hasFormat 1848733.dc.
- aggregation hasFormat 1848733.didl.
- aggregation hasFormat 1848733.doc.
- aggregation hasFormat 1848733.json.
- aggregation hasFormat 1848733.mets.
- aggregation hasFormat 1848733.mods.
- aggregation hasFormat 1848733.rdf.
- aggregation hasFormat 1848733.ris.
- aggregation hasFormat 1848733.txt.
- aggregation hasFormat 1848733.xls.
- aggregation hasFormat 1848733.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 "Frame-bound priority scheduling in discrete-time queueing systems".
- aggregation abstract "A well-known problem with priority policies is starvation of delay-tolerant traffic. Additionally, insufficient control over delay differentiation (which is needed for modern network applications) has incited the development of sophisticated scheduling disciplines. The priority policy we present here has the benefit of being open to rigorous analysis. We study a discrete time queueing system with a single server and single queue, in which N types of customers enter pertaining to different priorities. A general i.i.d. arrival process is assumed and service times are generally distributed. We divide the time axis into 'frames' of fixed size (counted as a number of time-slots), and re-order the customers that enter the system during the same frame such that the high-priority customers are served first. This paper gives an analytic approach to studying such a system, and in particular focuses on the system content (meaning the customers of each type in the system at random slot marks)in stationary regime, and the delay distribution of a random customer. Clearly, in such a system the frame's size is the key factor in the delay differentiation between the N priority classes. The numerical results at the end of this paper illustrate this observation.".
- aggregation authorList BK576936.
- aggregation endPage "788".
- aggregation issue "3".
- aggregation startPage "767".
- aggregation volume "7".
- aggregation aggregates 1848917.
- aggregation isDescribedBy 1848733.
- aggregation similarTo jimo.2011.7.767.
- aggregation similarTo LU-1848733.