Optimal dynamic routing in Markov queueing networks (Q1071639): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming and stochastic control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple dynamic routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal control of two interacting service stations / 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: Optimal control of service in tandem queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Equivalence Between Continuous and Discrete Time Markov Decision Processes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0005-1098(86)90035-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013489250 / rank
 
Normal rank

Latest revision as of 11:50, 30 July 2024

scientific article
Language Label Description Also known as
English
Optimal dynamic routing in Markov queueing networks
scientific article

    Statements

    Optimal dynamic routing in Markov queueing networks (English)
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    traffic control
    0 references
    Markov queueing networks
    0 references
    finite buffer capacity
    0 references
    Existence of optimal dynamic routing policies
    0 references
    long-run average and infinite-horizon discounted cases
    0 references
    computer communication networks
    0 references
    0 references