QoS-aware routing in ATM and IP-over-ATM

Authors:
R. Bolla;F. Davoli;M. Marchese;M. Perrando
Affiliations:
Department of Communications, Computer and System Science (DIST), University of Genoa, Via Opera Pia 13, 16145 Genova, Italy;Department of Communications, Computer and System Science (DIST), University of Genoa, Via Opera Pia 13, 16145 Genova, Italy;Italian National Consortium for Telecommunications (CNIT), University of Genoa Research Unit, Via Opera Pia 13, 16145 Genova, Italy;Department of Communications, Computer and System Science (DIST), University of Genoa, Via Opera Pia 13, 16145 Genova, Italy
Venue:
Computer Communications
Year:
2001

Citing 4
Cited 0

On the distribution of routing computation in hierarchical ATM networks

IEEE/ACM Transactions on Networking (TON)
Call Admission Control and Routing of QoS-Aware and Best-Effort Flows in an IP-over-ATM Networking Environment

QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Dynamic route selection at call set-up level in ATM networks

Proceedings of the IFIP TC6 WG6.3/WG6.4 Fourth International Workshop on ATM Networks, Performance Modelling and Analysis, Volume 3
Bandwidth allocation and admission control in ATM networks with service separation

IEEE Communications Magazine

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper analyzes the performance of some dynamic routing algorithms for ATM and IP-over-ATM networks. The main algorithm, named AR-DLCP (Alternate Routing - Distributed Least Congested Path), is based on a distributed computation, where the ''best'' route is chosen node-by-node in the call set-up phase, by taking decisions on the basis of a cost function, composed of a local part and an aggregate part. The local cost is constructed for each outgoing link on the basis of the knowledge of the current and the maximum number of connections that the link can support, while still ensuring the required Quality-of-Service at the cell level. The aggregate cost is aimed at reflecting the congestion situation of a node and is computed through an information exchange mechanism among adjacent nodes. In a fully connected core network, only direct and two-hop paths are considered; in the general meshed topology case, paths are organized in a two-level hierarchy. Static and dynamic trunk reservation schemes that guarantee enough bandwidth to direct paths are discussed. The performance of the two alternatives is evaluated by simulation under various traffic load situations. In particular, AR-DLCP is compared with other algorithms already in the literature as DLCP, Learning Automata and RTNR (Real Time Network Routing). In the general topology case, the algorithm is also combined with a bandwidth allocation mechanism and IP routing, by taking into account the presence of best-effort traffic, in an IP-over-ATM context.