Optimal Control in Fluid Models of nxn Input-Queued Switches under Linear Fluid-Flow Costs

被引：0

作者：

Lu Y. ^{[1
]}

Squillante M.S. ^{[1
]}

Suk T. ^{[1
]}

机构：

[1] IBM Research, United States

来源：

Performance Evaluation Review | 2021年 / 48卷 / 03期

关键词：

Scheduling;

D O I：

10.1145/3453953.3453981

中图分类号：

学科分类号：

摘要：

We consider a fluid model of n x n input-queued switches with associated fluid-flow costs and derive an optimal scheduling control policy to an infinite horizon discounted control problem with a general linear objective function of fluid cost. Our optimal policy coincides with the cμ-rule in certain parameter domains, but more generally, takes the form of the solution to a flow maximization problem. Computational experiments demonstrate the benefits of our optimal scheduling policy over variants of max-weight scheduling and the cμ-rule. © 2021 Copyright is held by the owner/author(s).

引用

页码：122 / 127

页数：5

共 25 条

[1]

Andrews M., Jung K., Stolyar A., Stability of the Max-weight Routing and Scheduling Protocol in Dynamic Networks and at Critical Loads, STOC ?07, pp. 145-154, (2007)

[2]

Avram F., Bertsimas D., Ricard M., Fluid models of sequencing problems in open queueing networks

[3]

An optimal control approach, Stochastic Networks, pp. 199-234, (1995)

[4]

Bauerle N., Rieder U., Optimal control of single-server uid networks, QUESTA, 35, 1, pp. 185-200, (2000)

[5]

Billingsley P., Convergence of Probability Measures, (2013)

[6]

Bramson M., State space collapse with application to heavy traffc limits for multiclass queueing networks, QUESTA, 30, 1, pp. 89-140, (1998)

[7]

Chen H., Yao D.D., Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization, (2001)

[8]

Chen H., Yao D.D., Dynamic Scheduling of a Multiclass Fluid Network, Op. Res, 41, 6, pp. 1104-1115, (1993)

[9]

Cox D.R., Smith W.L., Queues, (1961)

[10]

Dai J.G., Prabhakar B., The throughput of data switches with and without speedup, INFOCOM ?00, pp. 556-564, (2000)

← 1 2 3 →