Allocation of distinguishable servers

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

The model considered is a variation of the Hypercube model in which there are R distinguishable servers and N types of customers. We consider two interesting special cases-light and heavy traffic intensities-and use asymptotic techniques to derive policies for assigning servers to arriving customers which are optimal under these conditions. For light traffic, we show that it is optimal to assign the server with the smallest assignment cost while, for heavy traffic, we derive an efficient algorithm for finding the optimal policy.

Original languageEnglish (US)
Pages (from-to)85-93
Number of pages9
JournalComputers and Operations Research
Volume13
Issue number1
DOIs
StatePublished - 1986
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Allocation of distinguishable servers'. Together they form a unique fingerprint.

Cite this