2017 4th International Conference on Advanced Computing and Communication Systems (ICACCS) 2017
DOI: 10.1109/icaccs.2017.8014704
|View full text |Cite
|
Sign up to set email alerts
|

Cost performance analysis: Usage of resources in cloud using Markov-chain model

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…where π is a column vector containing all the steady-state probabilities P (u 1,1 ,,...,u M N ,N ) , the superscript T denotes the transposed operation, and 0 is a row vector with all elements equal to 0. The matrix Q is the state transition rate matrix, considering that rows define the origin state x and the columns the destination state y.The elements of Q, referred to q x,y , are defined as follows: The Gauss-Seidel method [27] has been selected to solve the SSBE system of equations (16) and compute the steadystate probabilities. This method avoids the discretization of the CTMC transition rate matrix and provides a good compromise between accuracy and complexity in comparison to other methods.…”
Section: B Model Implementationmentioning
confidence: 99%
See 1 more Smart Citation
“…where π is a column vector containing all the steady-state probabilities P (u 1,1 ,,...,u M N ,N ) , the superscript T denotes the transposed operation, and 0 is a row vector with all elements equal to 0. The matrix Q is the state transition rate matrix, considering that rows define the origin state x and the columns the destination state y.The elements of Q, referred to q x,y , are defined as follows: The Gauss-Seidel method [27] has been selected to solve the SSBE system of equations (16) and compute the steadystate probabilities. This method avoids the discretization of the CTMC transition rate matrix and provides a good compromise between accuracy and complexity in comparison to other methods.…”
Section: B Model Implementationmentioning
confidence: 99%
“…In this context, this paper proposes a Markov model to characterize and assess the performance of RAN slicing in multi-service and multi-tenant scenarios. Markovian approaches have been widely used to characterize the utilization of resources in many fields, such as mobility [15], cloud computing [16], Call Admission Control (CAC) for 3G [17] and 4G femtocells [18] or for a heterogeneous network's Radio Access Technologies (RAT) policies [19]. More recently, works in the field of 5G exploit Markov modeling to approach a proactive resource allocation scheme in highly mobile networks [20] and the management of admission control for handoff requests between small-cell and macrocell domains [21].…”
Section: Introductionmentioning
confidence: 99%
“…In the above context, this paper tackles the RAN slicing problem from a modeling perspective by proposing and developing a Markov model characterization of RAN slicing in multi-tenant and multi-service scenarios. Markovian approaches have been widely used to characterize the utilization of resources in many fields, such as in mobility [24], cloud computing [25], Call Admission Control (CAC) scheme for 3G [26] or for heterogeneous networks Radio Access Technologies (RAT) policies [27]. More recently, works in the field of 5G exploit Markov modeling to approach a proactive resource allocation scheme in highly mobile networks [28], the management of Admission Control (AC) for handoff requests between small cell and macro cell domains [29], the computation of the estimated spectrum requirement [30] and the management of slices' creation [31].…”
Section: Introductionmentioning
confidence: 99%
“…Markovian approaches have been widely used to characterise the resource sharing paradigm in many fields, such as in mobility [12], cloud computing [13], Asynchronous Transfer Mode (ATM) dynamic capacity allocation [14] as well as in cellular networks (see e.g., [15] for a CDMA radio channel emulator, [16] for a Call Admission Control (CAC) scheme for 3G or [17] for heterogeneous networks Radio Access Technologies (RAT) policies). More recently, works in the field of 5G exploit Markov modelling for high mobility networks [18] [19].…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, deg n S is defined as the union of the degraded states for the services of the n-th tenant, i.e. Equivalently the global system degraded states S deg would be computed as the union of the degraded states of each of the tenants.By using the previous definitions, the degradation probability per service and tenant is defined in(13). This can be easily extended to compute the degradation probability per tenant or the global degradation probability by considering deg n S or deg S in the summation, respectively.…”
mentioning
confidence: 99%