A vertex-allocation theorem for resources in queuing networks
A vertex-allocation theorem for resources in queuing networks
复制标题
排队网络中资源的顶点分配定理
DOI：
10.1145/42267.45068
复制
发表时间：
1988
期刊：
影响因子：
--
通讯作者：
C. Woodside
中科院分区：
文献类型：
--
作者：
S. Tripathi;C. Woodside
研究了一类具有多条开链和多条闭链的产品型排队网络。有些封闭链，每个有一个客户，需要在网络中分配资源，以最大化加权吞吐量性能标准。具有多个客户的链可以分解为多个每个客户一个的链。证明了资源的最优分配存在于可行分配集的一个顶点（极值点）上。这大大减少了最优分配的搜索空间。讨论了该结果在分布式计算中的应用。
A product-form queuing network with multiple open and closed chains is considered. Some of the closed chains, which have a single customer each, require allocation of resources in the network so as to maximize a weighted throughput performance criterion. Chains with more than one customer can be decomposed into many chains of one customer each. It is proved that an optimal allocation of resources lies on a vertex (extreme points) of the set of feasible allocations. This considerably reduces the search space for an optimal allocation. Applications of this result in distributed computing are discussed.