Hierarchical QoS routing in ATM networks based on MDP cost function

Abstract

The ATM private network-to-network interface (PNNI) adopts hierarchical routing which reduces nodal and link information to accomplish scalability and efficiency in large ATM networks. We design and evaluate two different aggregation schemes (asymmetric simple and full-mesh). Information aggregated includes available bandwidth, delay and cost. In the past, the definition of the cost function has received much less attention. We study two approaches: the Markov decision process (MDP) approach and the competitive on-line (COL) routing approach. Our simulation results show that the proposed asymmetric simple aggregation scheme yields a very good performance while it significantly reduces the amount of advertised information. Among these two link cost functions, the MDP-based approach provides a systematic way of defining the call admission function and yields a better network utilization than the COL-based approach.