Abstract
An efficient algorithm is presented to map an arbitrary traffic pattern and network topology on a mesh of rings network. The network is described by a two-layer model. The first layer defines the ring configuration 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. Simulated annealing (SA) is used to optimize the mapping to best fit the traffic 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.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35491-0_28
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Hamel et al, “Increased Capacity in an MS Protection Ring using WDM Technique and OADM: The Coloured Section Ring”, IEE Electr. Lett., Vol. 32, p. 234–235, Feb. 1996
H.A. Jäger, “The Modular WDM-Gridconnect as a Passive Routing Structure with Distributed Interfacing Capabilities”, Photon. Netw. Comm., Vol. 1, No. 1, p. 23–34, June 1999
H.A. Jäger and T. Gipser, “Mapping of Virtual Regular Mesh Network Topologies onto Arbitrary Geographical Node Distributions”, Proc. of Conf. on Netw. and Opt. Comm (NOC), ISBN 90 5199 274, Vol. 3, p. 64–71, June 1996
H. Harai, M. Murata and H. Miyahara, “Performance Analysis of Wavelength Assignment Policies in All-Optical Networks with Limited-Range Wavelength Conversion”, IEEE J. on Selected Areas in Comm, Vol. 16, No. 7, p. 1051–60, Sept. 1998
C. Kuratowski, “Sur le problème the courbes guaches en topologie”, Fundamenta Mathematicae, Vol. 15, p. 271–83, 1930
K. Mehlhorn and S. Näher, “LEDA, A Platform for Combinatorial and Geometric Computing”, Cambridge University Press, 1996, http://www.mpi-sb.mpg.de/LEDA/leda.html
A.T. White, “Graphs, Groups, and Surfaces”, North Holland, 1984
E. Hadjiconstantinou and N. Christofides, “An efficient implementation of an algorithm for finding K shortest simple paths”, Networks, vol. 34, no. 2, p. 88–101, Sept. 1999
P. Batchelor et al, “Study on the implementation of optical transparent transport networks in the European environment-results of the research project COST 239”, Photon. Netw. Comm, Vol. 2, No. 1, p. 15–32, Jan.-March 2000
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 IFIP International Federation for Information Processing
About this paper
Cite this paper
Mauz, C. (2002). Mapping of Arbitrary Traffic Demand and Network Topology on a Mesh of Rings Network. In: Jukan, A. (eds) Towards an Optical Internet. ONDM 2001. IFIP Advances in Information and Communication Technology, vol 76. Springer, New York, NY. https://doi.org/10.1007/978-0-387-35491-0_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-35491-0_3
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-6859-6
Online ISBN: 978-0-387-35491-0
eBook Packages: Springer Book Archive