Optimization of static traffic allocation policies

M.B. Combé; O.J. Boxma

doi:10.1016/0304-3975(94)90292-5

Optimization of static traffic allocation policies

M.B. Combé, O.J. Boxma

Research output: Contribution to journal › Article › Academic › peer-review

35 Citations (Scopus)

4 Downloads (Pure)

Abstract

We consider the traffic allocation problem: arriving customers have to be assigned to one of a group of servers. The aim is to optimize system performance measures, such as mean waiting time of a customer or total number of customers in the system, under a given static allocation policy. Two static policies are considered: probabilistic assignment and allocation according to a fixed pattern. For these two policies, general properties as well as optimization aspects are discussed.

Original language	English
Pages (from-to)	17-43
Number of pages	27
Journal	Theoretical Computer Science
Volume	125
Issue number	1
DOIs	https://doi.org/10.1016/0304-3975(94)90292-5
Publication status	Published - 1994

Access to Document

10.1016/0304-3975(94)90292-5

Cite this

@article{8b8a48c71ee24af3a9a470567900013c,

title = "Optimization of static traffic allocation policies",

abstract = "We consider the traffic allocation problem: arriving customers have to be assigned to one of a group of servers. The aim is to optimize system performance measures, such as mean waiting time of a customer or total number of customers in the system, under a given static allocation policy. Two static policies are considered: probabilistic assignment and allocation according to a fixed pattern. For these two policies, general properties as well as optimization aspects are discussed.",

author = "M.B. Comb{\'e} and O.J. Boxma",

year = "1994",

doi = "10.1016/0304-3975(94)90292-5",

language = "English",

volume = "125",

pages = "17--43",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - Optimization of static traffic allocation policies

AU - Combé, M.B.

AU - Boxma, O.J.

PY - 1994

Y1 - 1994

N2 - We consider the traffic allocation problem: arriving customers have to be assigned to one of a group of servers. The aim is to optimize system performance measures, such as mean waiting time of a customer or total number of customers in the system, under a given static allocation policy. Two static policies are considered: probabilistic assignment and allocation according to a fixed pattern. For these two policies, general properties as well as optimization aspects are discussed.

AB - We consider the traffic allocation problem: arriving customers have to be assigned to one of a group of servers. The aim is to optimize system performance measures, such as mean waiting time of a customer or total number of customers in the system, under a given static allocation policy. Two static policies are considered: probabilistic assignment and allocation according to a fixed pattern. For these two policies, general properties as well as optimization aspects are discussed.

U2 - 10.1016/0304-3975(94)90292-5

DO - 10.1016/0304-3975(94)90292-5

M3 - Article

SN - 0304-3975

VL - 125

SP - 17

EP - 43

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -

Optimization of static traffic allocation policies

Abstract

Access to Document

Fingerprint

Cite this