A vertex-allocation theorem for resources in queuing networks

13Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

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. © 1988, ACM. All rights reserved.

Cite

CITATION STYLE

APA

Tripathi, S. K., & Woodside, C. M. (1988). A vertex-allocation theorem for resources in queuing networks. Journal of the ACM (JACM), 35(1), 221–230. https://doi.org/10.1145/42267.45068

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free