Optimal capacity assignment in general queueing networks

P.K. Pollett ()
Additional contact information
P.K. Pollett: University of Queensland

Chapter Chapter 14 in Optimization, 2009, pp 261-272 from Springer

Abstract: Abstract We consider the problem of how best to assign the service capacity in a queueing network in order to minimize the expected delay under a cost constraint. We study systems with several types of customers, general service time distributions, stochastic or deterministic routing, and a variety of service regimes. For such networks there are typically no analytical formulae for the waiting-time distributions. Thus we shall approach the optimal allocation problem using an approximation technique: specifically, the residual-life approximation for the distribution of queueing times. This work generalizes results of Kleinrock, who studied networks with exponentially distributed service times. We illustrate our results with reference to data networks.

Keywords: Capacity assignment; queueing network; residual-life approximation (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-0-387-98096-6_14

Ordering information: This item can be ordered from
http://www.springer.com/9780387980966

DOI: 10.1007/978-0-387-98096-6_14

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().