Allocation of distinguishable servers (Q1820674): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 05:48, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Allocation of distinguishable servers |
scientific article |
Statements
Allocation of distinguishable servers (English)
0 references
1986
0 references
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.
0 references
hypercube model
0 references
optimal policy
0 references