A new reward model for MDP state aggregation with application to CAC and Routing
An optimal solution of the call admission control and routing problem in multi‐service loss networks, in terms of average reward per time unit, is possible by modeling the network behavior as a Markov decision process (MDP). However, even after applying the standard link independence assumption, the...
Gespeichert in:
Veröffentlicht in: | European transactions on telecommunications 2005-11, Vol.16 (6), p.495-508 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!