Optimization of static traffic allocation policies

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

    Research output: Contribution to journalArticleAcademicpeer-review

    34 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 languageEnglish
    Pages (from-to)17-43
    Number of pages27
    JournalTheoretical Computer Science
    Volume125
    Issue number1
    DOIs
    Publication statusPublished - 1994

    Fingerprint

    Dive into the research topics of 'Optimization of static traffic allocation policies'. Together they form a unique fingerprint.

    Cite this