THESIS
1997
viii, 68 leaves : ill. ; 30 cm
Abstract
In modern high speed communication networks, it is very important to handle a variety of traffic types. The service quality of such a network is mainly determined by the admission and routing policies adopted by that network. So, call admission and routing in integrated communication networks has been an active research topic in recent years. Numerous methods based on different theoretical models have been proposed. In the literature, Markov Decision Process (MDP) cost-based admission and routing control have been widely discussed in telephone switching networks, but their application in an integrated communication network is rarely used due to the enormous number of states of the Markov model describing the network....[
Read more ]
In modern high speed communication networks, it is very important to handle a variety of traffic types. The service quality of such a network is mainly determined by the admission and routing policies adopted by that network. So, call admission and routing in integrated communication networks has been an active research topic in recent years. Numerous methods based on different theoretical models have been proposed. In the literature, Markov Decision Process (MDP) cost-based admission and routing control have been widely discussed in telephone switching networks, but their application in an integrated communication network is rarely used due to the enormous number of states of the Markov model describing the network.
In this research, we study this problem of determining optimal admission and routing policies in integrated communication networks by a fundamental concept, the performance potentials, of a Markov system describing a network. We extend the general MDP system to a new MDP model with event-related cost function, because the cost function of the MDP system for many problems depends on the events. Furthermore, we analyse these problems by the Generalized Semi-Markov Process (GSMP) model with the exponential event distribution property. Some new policy iteration algorithms based on the event-related cost function for the infinite-horizon average-cost MDP can be derived and employed to find the optimal policy by observing a single sample path of a Markov system. These algorithms can be applied on-line to our problems. First, one link call admission in an integrated service network can be controlled perfectly. Second, with the assumption of decomposition of the MDP, the optimal routing path in an integrated service network could be found. Simulation results show that our approachs work well with moderate computing complexity.
Post a Comment