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...
| Τόπος έκδοσης: | IEEE Transactions on communications 49, 9 (2001). |
|---|---|
| Κύριος συγγραφέας: | |
| Μορφή: | Άρθρο |
| Γλώσσα: | English |
| Θέματα: |