Optimized Ring Identification for an Arbitrary Network Topology and Traffic Matrix


Christian Mauz


Proceedings of Workshop on All Optical Networks (WAON) 2001, June 2001.

[BibTeX, LaTeX, and HTML Reference]


An optimized algorithm is presented to embed a mesh of rings network in an arbitrary network topology to provide the necessary transport capacity for a given traffic pattern. The network can be characterized by a three-layer model. The first layer defines the ring configuration, the second the connection allocation and the third the connections among the rings. Rings are constructed systematically from faces. It is assumed that a ring provides a full-meshed network with a certain capacity between every node pair. Simulated annealing (SA) is used to optimize the mapping to best fit the traffic demands. For the objective function certain parameters can be considered. It is possible to incorporate boundary conditions, e.g. the maximum number of nodes in a ring in this function. The algorithm is tested on the basis of the COST~239 Pan-European case study as an example.


Ring Identification, Virtual Topology Design

Download this document:


Copyright Notice: © 2001 C. Mauz.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.