Copyright © 2005 Elsevier Ltd All rights reserved.
On-line resources allocation for ATM networks with rerouting
Available online 16 February 2005.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
This paper presents an application we developed for France Telecom R&D to solve a difficult real-life network problem. The problem takes place in an Asynchronous Transfer Mode (ATM) network administration context and consists in planning demands of connection over a period of 1 year. A new demand is accepted if both bandwidth and Quality of Service (QoS) requirements are satisfied. Demands are not known prior to the assignment and must be performed on-line according to their arrival. Moreover, the acceptance or the reject of a demand must be decided within a given time of 1 min.
First, we look for a route satisfying the new demand. In case of failure, we try to reroute some already accepted connections in order to satisfy this new demand. Rerouting has been modelled as a Weighted Constraint Satisfaction Problem (WCSP) and solved by VNS/LDS+CP, a hybrid method well suited for solving WCSPs in on-line contexts. Experiments show that our rerouting enables to accept an average of 67% of demands that would be rejected otherwise.
Keywords: Network routing; ATM; Quality of service; Dijkstra shortest path algorithm; Anytime context; Constraint satisfaction problem; WCSP; Hybrid search algorithm; VNS; LDS
Article Outline
- 1. Introduction
- 2. Resource allocation in ATM networks
- 2.1. ATM technology
- 2.2. Quality of Service and metrics
- 2.3. QoS in ATM network
- 2.4. Connections reservation for ATM networks
- 2.4.1. Connections reservation service
- 2.4.2. Communication network
- 2.4.3. Rerouting in ATM networks
- 3. Retained approach
- 3.1. Efficient time representation
- 3.2. Characteristics of the problem
- 3.3. Anytime algorithms
- 3.4. Hybrid methods
- 3.5. Overview of the resolution method
- 4. Computing demand conflicts
- 4.1. Conflicting shortest path and demand conflict
- 4.2. Extending Dijkstra's algorithm
- 4.3. Computing and ordering demand conflicts
- 5. Rerouting using VNS/LDS+CP
- 5.1. Valued constraint satisfaction problems
- 5.2. Building weighted CSPs
- 5.2.1. Variables, domains and constraints
- 5.2.2. Modelling as a WCSP
- 5.3. Rerouting with VNS/LDS+CP
- 5.3.1. Building the initial assignment
- 5.3.2. Relaxing variables
- 5.3.3. Control of the neighborhood size
- 5.3.4. Rebuilding a solution
- 5.3.5. Limited discrepancy search
- 5.3.6. Constraint propagation
- 5.3.7. Heuristics
- 6. Study of an example
- 6.1. Description
- 6.2. Arrival of a new demand
- 6.3. Selecting demand conflicts
- 6.4. Rerouting with VNS/LDS+CP
- 7. Related works
- 8. Experimental results
- 9. Conclusions and further works
- Acknowledgements
- Further Reading
- References







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)







