Hierarchical QoS Routing in ATM Networks Based on MDP Cost Function

Authors:
Affiliations:
Venue:
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Year:
2000

Citing 0
Cited 3

Analysis of adaptive cost functions for dynamic update policies for QoS routing in hierarchical networks

Information Sciences—Informatics and Computer Science: An International Journal
Fast setup of end-to-end paths for bandwidth constrained applications in an IP/MPLS-ATM integrated environment

Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient hierarchical QoS routing in ATM networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

ATM Private Network-to-Network Interface (PNNI) adopts hierarchical routing, which reduces nodal, and link information to accomplish scalability and efficiency in large A ATM networks. In this paper, 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 cost function has received much less attention. In this paper, 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 very good performance while significantly reduces the amount of advertised information. Among these two link cost functions, the MDP-based approach provides a systematic way of defining call admission function and yields better network utilization than the COL-based approach.