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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sharing Memory Optimally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Servers Sharing a Finite Storage: Comparison of Space Allocation Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying a New Device in the Optimization of Exponential Queuing Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Maximal Gain for Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete versions of an algorithm due to Varaiya / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative solution of the functional equations of undiscounted Markov renewal programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks / rank
 
Normal rank

Latest revision as of 16:47, 17 June 2024

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