Adaptation of the service capacity in a queueing system which is subjected to a change in the arrival rate at unknown epoch

1978 ◽  
Vol 10 (03) ◽  
pp. 666-681 ◽  
Author(s):  
M. Yadin ◽  
S. Zacks

The paper studies the problem of optimal adaptation of an M/M/1 queueing station, when the arrival rate λ0 of customers shifts at unknown epoch, τ, to a known value, λ1. The service intensity of the system starts at μ0 and can be increased at most N times to μ1 < μ2 < · · · < μ N . The cost structure consists of the cost changing μ i to μ j (i + 1 ≦ j ≦ N); of maintaining service at rate μ (per unit of time) and of holding customers at the station (per unit of time). Adaptation policies are constrained by the fact that μ can be only increased. A Bayes solution is derived, under the prior assumption that τ has an exponential distribution. This solution minimizes the total expected discounted cost for the entire future.

1978 ◽  
Vol 10 (3) ◽  
pp. 666-681 ◽  
Author(s):  
M. Yadin ◽  
S. Zacks

The paper studies the problem of optimal adaptation of an M/M/1 queueing station, when the arrival rate λ0 of customers shifts at unknown epoch, τ, to a known value, λ1. The service intensity of the system starts at μ0 and can be increased at most N times to μ1 < μ2 < · · · < μN. The cost structure consists of the cost changing μi to μj (i + 1 ≦ j ≦ N); of maintaining service at rate μ (per unit of time) and of holding customers at the station (per unit of time). Adaptation policies are constrained by the fact that μ can be only increased. A Bayes solution is derived, under the prior assumption that τ has an exponential distribution. This solution minimizes the total expected discounted cost for the entire future.


1990 ◽  
Vol 27 (03) ◽  
pp. 693-700 ◽  
Author(s):  
Matthew J. Sobel

Assigning each arriving customer to the fastest idle server is shown to maximize throughput (equivalently, minimize blocking probability) in a queueing model with Poisson arrivals, heterogeneous exponential servers, and no waiting room. If a cost structure is imposed on this model, under specified conditions the same policy minimizes the expected discounted cost and the long-run average cost per unit time.


1990 ◽  
Vol 27 (3) ◽  
pp. 693-700 ◽  
Author(s):  
Matthew J. Sobel

Assigning each arriving customer to the fastest idle server is shown to maximize throughput (equivalently, minimize blocking probability) in a queueing model with Poisson arrivals, heterogeneous exponential servers, and no waiting room. If a cost structure is imposed on this model, under specified conditions the same policy minimizes the expected discounted cost and the long-run average cost per unit time.


Author(s):  
Mohammad Istiak Hossain ◽  
Jan I. Markendahl

AbstractSmall-scale commercial rollouts of Cellular-IoT (C-IoT) networks have started globally since last year. However, among the plethora of low power wide area network (LPWAN) technologies, the cost-effectiveness of C-IoT is not certain for IoT service providers, small and greenfield operators. Today, there is no known public framework for the feasibility analysis of IoT communication technologies. Hence, this paper first presents a generic framework to assess the cost structure of cellular and non-cellular LPWAN technologies. Then, we applied the framework in eight deployment scenarios to analyze the prospect of LPWAN technologies like Sigfox, LoRaWAN, NB-IoT, LTE-M, and EC-GSM. We consider the inter-technology interference impact on LoRaWAN and Sigfox scalability. Our results validate that a large rollout with a single technology is not cost-efficient. Also, our analysis suggests the rollout possibility of an IoT communication Technology may not be linear to cost-efficiency.


2017 ◽  
Vol 34 (1) ◽  
pp. 77-83 ◽  
Author(s):  
Rigoberto I. Delgado ◽  
Sara L. Gill

Background: This article focuses on the costs of opening and running a Baby Café. A Baby Café is an intervention that focuses on providing peer-to-peer support for breastfeeding mothers. Research aim: This study aimed to estimate the costs of establishing and running a Baby Café. Methods: The authors used a microcosting approach to identifying costs using the case of a Baby Café located in San Antonio, Texas, and modeled after other existing cafés in the United States. They also used extensive literature review and conducted an informal interview with a manager of an existing Baby Café in the United States to validate our cost data. The cost analysis was done from the provider perspective. Results: Costs of starting a Baby Café were $36,000, whereas annual operating costs totaled $47,000. Total discounted costs for a 5-year period amounted to $250,000, resulting in a cost per Baby Café session of $521 and cost per mother of $104. Varying the number of sessions per week and number of mothers attending each session, the discounted cost per Baby Café session ranged between $460 and $740 and the cost per mother varied between $65 and $246. Conclusion: These findings can be used by policy makers and organizations to evaluate local resource requirements for starting a Baby Café. Further research is needed to evaluate the effectiveness of this intervention against other breastfeeding promoting initiatives.


2014 ◽  
Vol 4 (1) ◽  
pp. E1-E24 ◽  
Author(s):  
Dana Mukamel ◽  
Richard Fortinsky ◽  
Alan White ◽  
Charlene Harrington ◽  
Laura White ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document