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 profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90096-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078002625 / rank | |||
Normal rank | |||
Revision as of 20:56, 19 March 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
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
