A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks (Q1085077)

From MaRDI portal
Revision as of 16:38, 12 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
scientific article

    Statements

    A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks (English)
    0 references
    0 references
    0 references
    1986
    0 references
    Certain problems occurring in optimal sharing of memory among processors or in optimal allocation servers with blocking can be seen as instances of a general semi-Markov decision problem with exponentially distributed transition times. The paper considers an improved value-iteration algorithm for a discrete semi-Markov decision model. The idea is to create sparse transition matrices by introducing fictitious decision epochs. Numerical experiments are also presented for practical applications with a large number of states.
    0 references
    resource allocation
    0 references
    communication networks
    0 references
    optimal sharing
    0 references
    general semi-Markov decision problem
    0 references
    exponentially distributed transition times
    0 references
    value-iteration algorithm
    0 references

    Identifiers