Bounding of performance measures for threshold-based queuing systems: theory and application to dynamic resource management in video-on-demand servers

DOI10.1109/12.995445zbMath1391.90184OpenAlexW1994216099MaRDI QIDQ4571300

John C. S. Lui, Leana Golubchik

Publication date: 9 July 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cc6396ffa86fc2f54a1b95a008bea57ee0094071

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (4)

Approach to the Analysis of Probability Measures of Cloud Computing Systems with Dynamic Scaling ⋮ Fluctuation analysis in parallel queues with hysteretic control ⋮ Distribution of the number of losses in busy-periods of oscillating \(M^X / G / 1 / (n, a, b)\) systems ⋮ Moments of losses during busy-periods of regular and nonpreemptive oscillating \(M^X/G/1/n\) systems

This page was built for publication: Bounding of performance measures for threshold-based queuing systems: theory and application to dynamic resource management in video-on-demand servers