2016
DOI: 10.1109/lcomm.2015.2499740
|View full text |Cite
|
Sign up to set email alerts
|

A Convex Optimization Framework for Service Rate Allocation in Finite Communications Buffers

Abstract: Abstract-We study the convexity of loss probability in communications and networking optimization problems that involve finite buffers, where the arrival process has a general distribution. Examples of such problems include scheduling, energy management and revenue and cost optimization problems. To achieve a computationally tractable optimization framework, we propose to adjust an existing non-convex loss probability formula for G/D/1 queues to present a convex and even more accurate loss probability model. W… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…Meanwhile, it is easy to prove that the solution spaces constructed by the constrains of two problems are convex spaces, and the functions of two problems are the cumulative sums after taking the logarithm of two objective functions. Therefore, two functions of the optimization problems are concave; then, these two problems are convex optimization problems according to convex optimal theory [26], which means the distance between solutions of dual problems and original problems can be regarded as 0 [27], and these two problems can be transferred into dual problems and solved in their dual domain.…”
Section: Theorem 1 the Objective Function Fmentioning
confidence: 99%
“…Meanwhile, it is easy to prove that the solution spaces constructed by the constrains of two problems are convex spaces, and the functions of two problems are the cumulative sums after taking the logarithm of two objective functions. Therefore, two functions of the optimization problems are concave; then, these two problems are convex optimization problems according to convex optimal theory [26], which means the distance between solutions of dual problems and original problems can be regarded as 0 [27], and these two problems can be transferred into dual problems and solved in their dual domain.…”
Section: Theorem 1 the Objective Function Fmentioning
confidence: 99%
“…Moreover, when ignoring the inequality constraints, there is a linear function relationship between λ i and x i,t , which can be represented as φ i (λ i ) = x i,t . When each DG is operating in the optimal consistent condition λ i * , the optimal power output x * i,t can be obtained [20].…”
Section: Optimization Solutionmentioning
confidence: 99%
“…Based on the definition of communication matrices, it is clear to gain that W i,j is a row stochastic matrix and U i,j is a column stochastic matrix. Note that the convergence will not be affected by the communication weights selection process when the above stochastic characteristics are satisfied [20]. Note ρ(W) = ρ(U) = 1, where ρ(•) represents the spectral radius of the matrix.…”
Section: The Design Of Communication Weightmentioning
confidence: 99%
“…An extension of (11) when this assumption is relaxed is given in [39]. As for the model in (10), the first term is the reserve capacity payment and the second term is the reserve call payment.…”
Section: F Operational Revenuementioning
confidence: 99%
“…For the case studies that involve only one time slot, the data is from 3:30 PM to 3:45 PM, which is one of the ten time intervals at which PJM sent out a reserve capacity signal during the studied period. For simulations that include one data center, we use the loss probability model in [39], which is an extension of the model in (11) to the entire range of service rate.…”
Section: A Simulation Settingmentioning
confidence: 99%