Mapping of Arbitrary Traffic Demand and Network Topology on a Mesh of Rings Network
ReferenceProceedings of the Fifth Working Conference on Optical Network Design and Modelling (ONDM'01), Feb. 2001.
AbstractAn e±cient algorithm is presented to map an arbitrary tra±c pattern and network topology on a mesh of rings network. The network is described by a two-layer model. The ¯rst layer de¯nes the ring con¯gu- ration and the second the connection allocation. 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. Sim- ulated annealing (SA) is used to optimize the mapping to best ¯t the tra±c demands. For that, an objective function with certain parameters is introduced. 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.
KeywordsRing 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.