On the Optimality of Trunk Reservation in Overflow Processes
From MaRDI portal
Publication:3416021
DOI10.1017/S0269964800002163zbMath1134.60404MaRDI QIDQ3416021
Publication date: 19 January 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Optimality of randomized trunk reservation for a problem with a single constraint, Optimization via trunk reservation in single resource loss systems under heavy traffic, Design and evaluation of a dynamic capacity apportionment procedure.
Cites Work
- Unnamed Item
- Unnamed Item
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
- Dynamic programming, Markov chains, and the method of successive approximations
- Iterative solution of the functional equations of undiscounted Markov renewal programming
- Finite state Markovian decision processes
- Optimal control of admission to a quenching system
- Optimal control of random walks, birth and death processes, and queues
- The Interrupted Poisson Process As An Overflow Process