Allocation schemes of resources with downgrading

DOI10.1017/APR.2017.15MaRDI QIDQ5233184zbMATH OpenOpenAlexFDO

Authors Christine Fricker, Guilherme Thompson, Fabrice M. Guillemin, Philippe Robert

Publication date 16 September 2019

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1604.00894

zbMATH Keywords

loss systemresource allocationscaling method

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Communication networks in operations research (90B18)

Abstract: We consider a server with large capacity delivering video files encoded in various resolutions. We assume that the system is under saturation in the sense that the total demand exceeds the server capacity $C$. In such a case, requests may be rejected. For the policies considered in this paper, instead of rejecting a video request, it is downgraded. When the occupancy of the server is above some value $C_0<C$, the server delivers the video at a minimal bit rate. The quantity $C_0$ is the bit rate adaptation threshold. For these policies, request blocking is thus replaced by bit rate adaptation. Under the assumptions of Poisson request arrivals and exponential service times, we show that, by rescaling the system, a process associated to the occupancy of the server converges to some limiting process whose invariant distribution is computed by a Wiener-Hopf technique. This allows us to derive an asymptotic expression of the key performance measure of such a policy, the equilibrium probability that a request is transmitted without downgrading. Numerical applications of these results are presented.

Recommendations

• Adaptive Video on Demand
• On the total amount of resources occupied by serviced customers
• Competitive on-line scheduling of continuous-media streams
• Bandwidth packing
• Distributed algorithms for rate-adaptive media streams

Cites work

• A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning
• An infinite server system with general packing constraints
• Applied Probability and Queues
• Asymptotic analysis of single resource loss systems in heavy traffic, with applications to integrated networks
• Blocking probabilities in large circuit-switched networks
• Dynamic and equilibrium behavior of controlled loss networks
• scientific article; zbMATH DE number 53382 (Why is no real title available?)
• scientific article; zbMATH DE number 53539 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• scientific article; zbMATH DE number 1947316 (Why is no real title available?)
• Large loss networks
• Loss networks
• Loss Networks
• Pull-based load distribution in large-scale heterogeneous service systems

Cited in

(1)

• Allocation of Resources to Depots

This page was built for publication: Allocation schemes of resources with downgrading

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233184)