Distributed rerouting in DCS mesh networks
Abstract:
In continuation of our precedent work presented in [1], this paper proposes a fast distributed rerouting algorithm based on a new approach in generation of the necessaries restoration paths. Future services of telecommunication will demand a fault-tolerant Network with complete survivability. In this context, it is the aim of the rerouting algorithms to reconfigure the network around the failures such that calls in progress are not dropped and the quality of services is not degraded. In other words, the problem to resolve is rerouting the lost traffic caused by failures of network elements (f.ex. arcs) through alternatives routes in real time. This can be reached through integration of DCS distributed control architecture. The choice of distributed rerouting deals with some technological advances like the deployment of fibre optic transmission and of reconfigurable DCS (Digital Cross-connect System) nodes, throughout the network. In this paper we will take in consideration DCS Mesh Networks. In such Networks, even a single failure causes important losses of traffic but on the other side the DCS nodes can realize a fast and efficient reaction against the failures. During our work, we have considered the DCS nodes as powerfull computers in charge of cross-connection of links in real-time. Unlikely of centralized rerouting where a special node calculates and distributes Rerouting Tables to
Citations
| 1 | A new distributed restoration algorithm for telecommunications networks – Carlier, Nace |
