Budget-Constrained Edge Service Provisioning With Demand Estimation via Bandit Learning
نویسندگان
چکیده
منابع مشابه
Bayesian Service Demand Estimation with Gibbs Sampling
Performance modelling of web applications involves the task of estimating service demands of requests at physical resources, such as CPUs. In this paper, we propose a service demand estimation algorithm based on a Markov Chain Monte Carlo (MCMC) technique, Gibbs sampling. Our methodology is widely applicable as it requires only queue length samples at each resource, which are simple to measure....
متن کاملA Model for Time- and Budget-constrained Activity Demand Analysis
This paper describes and demonstrates the derivation of a system of demands for activity participation by applying microeconomic theory in a time-price setting. Both time and money constraints are incorporated explicitly and the integer nature of demand observations is accommodated via a multivariate negative binomial stochastic specification. A model based on this theory is calibrated, providi...
متن کاملEmergent service provisioning and demand estimation through self-organizing agent communities
A major challenge within open markets is the ability to satisfy service demand with an adequate supply of service providers, especially when such demand may be volatile due to changing requirements, or fluctuations in the availability of services. Ideally, this supply and demand should be balanced; however, when consumer demand changes over time, and providers independently choose which service...
متن کاملAn Infrastructure - as - a - Service Cloud : On - Demand Resource Provisioning
Cloud computing allows business customers to elastically scale up and down their resource usage based on needs. This feature eliminates the dilemma of planning IT infrastructures for Cloud users, where under-provisioning compromises service quality while over-provisioning wastes investment as well as electricity. It offers virtually infinite resource. It also made the desirable “pay as you go” ...
متن کاملEdge covering with budget constrains
We study two related problems: the Maximum weightm′-edge cover (MWEC ) problem and the Fixed cost minimum edge cover (FCEC ) problem. In the MWEC problem, we are given an undirected simple graph G = (V,E) with integral vertex weights. The goal is to select a set U ⊆ V of maximum weight so that the number of edges with at least one endpoint in U is at most m′. Goldschmidt and Hochbaum [7] show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal on Selected Areas in Communications
سال: 2019
ISSN: 0733-8716,1558-0008
DOI: 10.1109/jsac.2019.2933781