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

作者：Ghamkhari Mahdi; Mohsenian Rad Hamed^*

来源：IEEE Communications Letters, 2016, 20(1): 69-72.

DOI：10.1109/LCOMM.2015.2499740

• Convex optimization
• finite buffers
• loss probability

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 nonconvex loss probability formula for G/D/1 queues to present a convex and even more accurate loss probability model. We then use empirical data and computer simulations to examine the performance of the proposed design.

• 出版日期2016-1