On optimal call admission control in resource-sharing system.

On optimal call admission control in resource-sharing system.

In this paper, we consider call admission control of multiple classes without waiting room. We use event-based dynamic programming for our model. We show that sometimes the customer classes can be ordered: if it is optimal to accept a class, then to accept a more profitable class is optimal too. We...

Descrizione completa

Dettagli Bibliografici
Pubblicato in:IEEE Transactions on communications 49, 9 (2001).
Autore principale: Altman, E.
Natura: Articolo
Lingua:English
Soggetti:
2-classes problem.
Customer classes.
Event-based dynamic programming.
Fluid model.
Large-capacity case.
Minimum cost.
One-dimensional state space.
Optimal call admission control.
Optimal control.
Optimal policies.
Resource-sharing system.
Service time distribution.
Submodularity.
Trunk reservation policy.
Waiting room.