Blocking in a shared resource environment with batched Poisson arrival processes

Kaufman, J. S.; Rege, Kiran M.

doi:10.1016/0166-5316(94)00029-8

Cited by 46 publications

(41 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a 1995 paper [3], Choudhury, Cheung and Whitt claimed to provide a product-form solution for both the partial blocking and the complete blocking policies. That solution agreed with the results obtained by Kaufman and Regge [14], for general distribution of batch sizes, and by van Doorn and Planken [6], for geometrically distributed batches. However, both of those papers had analyzed only the partial blocking policy.…”

Section: Introductionsupporting

confidence: 91%

Multi-Class Resource Sharing With Batch Arrivals

Ezhilchelvan¹,

Mitrani²

2018

Prob. Eng. Inf. Sci.

View full text Add to dashboard Cite

A cloud provider hosts virtual machines (VMs) of different types, with different resource requirements. There are bounds on the total amounts of each kind of resource that are available. Requests arrive in batches of different sizes. Under the 'complete blocking' policy, a request is accepted only if all the VMs in its batch can be accommodated. The 'partial blocking' policy would accept a request if there is room for at least one of the VMs in the batch. Blocked requests are lost, with an associated loss of revenue. The trade-offs between costs and benefits are evaluated by means of appropriate models, for which novel solutions based on fixed-point iterations are proposed. The applicability of those solutions is extended, by means of simplifications, to very largescale systems. Numerical examples and comparisons with simulations are presented.

show abstract

Section: Introductionsupporting

confidence: 91%

Multi-Class Resource Sharing With Batch Arrivals

Ezhilchelvan¹,

Mitrani²

2018

Prob. Eng. Inf. Sci.

View full text Add to dashboard Cite

show abstract

“…However, applying probability to schemes with varying behaviour can address these concerns. Therefore, by employing the recursive methodology approach presented in [27,28], we can calculate the probability p of an individual cloud node capacity q as:…”

Section: Vm Placement and The Data Centre Modelmentioning

confidence: 99%

v-Mapper: An Application-Aware Resource Consolidation Scheme for Cloud Data Centres

Abbasi

Jin

2017

Preprint

View full text Add to dashboard Cite

† This paper is an extended version of paper published in the 9th Asia-Pacific Services Computing Conference (APSCC'15), Bangkok, Thailand, 7-9 December 2015. Abstract: Cloud computing refers to applications delivered as services over the Internet. Cloud systems employ policies that are inherently dynamic in nature and that depend on temporal conditions defined in terms of external events, such as the measurement of bandwidth, use of hosts, intrusion detection or specific time events. In this paper, we investigate an optimized resource management scheme named v-Mapper. The basic premise of v-Mapper is to exploit application-awareness concepts using software-defined networking (SDN) features. This paper makes three key contributions to the field: (1) We propose a virtual machine (VM) placement scheme that can effectively mitigate the VM placement issues for data-intensive applications; (2) We propose a validation scheme that will ensure that a service is entertained only if there are sufficient resources available for its execution and (3) We present a scheduling policy that aims to eliminate network load constraints. An evaluation was carried out with various benchmarks and demonstrated that v-Mapper shows improved performance over other state-of-the-art approaches in terms of average task completion time, service delay time and bandwidth utilization. Given the growing importance of supporting large-scale data processing and analysis in datacentres, the v-Mapper system has the potential to make a positive impact in improving datacentre performance in the future.

show abstract

“…[32] proposes occupancy distribution for traffic that is characterised by any peakedness factor. In [33] and [34], a model of a multiservice server with call streams of the batched Poisson type is developed. [35] and [36] propose a recursive generalisation of the distribution (6) for Erlang, Engset and Pascal traffic.…”

Section: Commentsmentioning

confidence: 99%

Queuing Systems for the Internet

Stasiak

2016

IEICE Trans. Commun.

View full text Add to dashboard Cite

SUMMARY This article proposes a versatile model of a multiservice queueing system with elastic traffic. The model can provide a basis for an analysis of telecommunications and computer network systems, internet network systems in particular. The advantage of the proposed approach is a possibility of a determination of delays in network nodes for a number of selected classes of calls offered in modern telecommunications networks.

show abstract

Blocking in a shared resource environment with batched Poisson arrival processes

Cited by 46 publications

References 10 publications

Multi-Class Resource Sharing With Batch Arrivals

Multi-Class Resource Sharing With Batch Arrivals

v-Mapper: An Application-Aware Resource Consolidation Scheme for Cloud Data Centres

Queuing Systems for the Internet

Contact Info

Product

Resources

About