Abstract
We study the problem of allocating optical bandwidth to sets of communication requests in all-optical networks that utilize Wave-length Division Multiplexing (WDM). WDM technology establishes communication between pairs of network nodes by establishing transmitter-receiver paths and assigning wavelengths to each path so that no two paths going through the same fiber link use the same wavelength. Optical bandwidth is the number of distinct wavelengths. Since state-of-the-art technology allows for a limited number of wavelengths, the engineering problem to be solved is to establish communication between pairs of nodes so that the total number of wavelengths used is minimized.
In this paper we describe the implementation and study the performance of a wavelength routing algorithm for irregular networks. The algorithm proposed by Raghavan and Upfal [17] and is based on a random walk technique. We also describe a variation of this algorithm based on a Markov chain technique which is experimentally proved to have improved performance when applied to random networks generated according to the Gn,p model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan. Efficient Routing and Scheduling Algorithms for Optical Networks. In Proc. of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 94), pp. 412-423, 1994.
Y. Aumann, Y. Rabani. Improved Bounds for All Optical Routing. In Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 95), pp. 567–576, 1995.
B. Beauquier, J.-C. Bermond, L. Gargano, P. Hell, S. Perennes, U. Vaccaro. Graph Problems arising from Wavelength Routing in All-Optical Networks. 2nd Workshop on Optics and Computer Science (WOCS 97), 1997.
J.-C. Bermond, L. Gargano, S. Perennes, A. Rescigno, U. Vaccaro. Efficient Collective Communication in Optical Networks. In Proc. of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP 96), LNCS 1099, Springer-Verlag, pp. 574–585, 1996.
A.Z. Broder, A. Frieze, and E. Upfal. Existence and Construction of Edge Disjoint Paths on Expander Graphs. In Proc. of the 24th Annual ACM Symposium on the Theory of Computing (STOC 92), pp. 140–149, 1992.
E. Dijkstra. A Note on Two Problems in Connection with Graphs. Num. Math., 1:269–271, 1959.
T. Erlebach, K. Jansen. Scheduling of Virtual Connections in Fast Networks. In Proc. of the 4th Workshop on Parallel Systems and Algorithms (PASA 96), pp. 13–32, 1996.
T. Erlebach, K. Jansen. Call Scheduling in Trees, Rings, and Meshes. In Proc. Of the Hawaii Int. Conf. on Syst. Sciences (HICSS 97), 1997.
M.R. Garey, D.S. Johnson, G.L. Miller, C.H. Papadimitriou. The Complexity of Coloring Circular Arcs and Chords. SIAM Journ. Alg. Disc. Meth., vol. 1, no. 2, (1980), pp. 216–227.
C. Kaklamanis, P. Persiano. EfficientWavelength Routing on Directed Fiber Trees. In Proc. of the 4th European Symposium on Algorithms (ESA 96), LNCS 1136, Springer Verlag, 1997, pp. 460–470.
C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen. Constrained Bipartite Edge Coloring with Applications toWavelength Routing. In Proc. of the 24th Internation Colloquium on Automata, Languages, and Programming (ICALP 97), LNCS 1256, Springer Verlag, 1997, pp. 493–504.
V. Kumar, E. Schwabe. Improved Access to Optical Bandwidth in Trees. In Proc. of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 97), 1997, pp. 437–444.
M. Mihail, C. Kaklamanis, S. Rao. Efficient Access to Optical Bandwidth. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS 95), 1995, pp. 548–557.
R. Motwani, P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
R.K. Pankaj. Architectures for Linear Lightwave Networks. PhD. Thesis, Dept. of EECS, MIT, 1992.
Y. Rabani. Path Coloring on the Mesh. In Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS 96), 1996.
P. Raghavan, E. Upfal. Efficient Routing in All-Optical Networks. In Proc. of the 26th Annual Symposium on Theory of Computing (STOC 94), 1994, pp. 133–143.
R. Ramaswami, K. Sivarajan. Optical Networks. Morgan Kaufmann, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bouganis, A., Caragiannis, I., Kaklamanis, C. (1999). Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks. In: Vitter, J.S., Zaroliagis, C.D. (eds) Algorithm Engineering. WAE 1999. Lecture Notes in Computer Science, vol 1668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48318-7_21
Download citation
DOI: https://doi.org/10.1007/3-540-48318-7_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66427-7
Online ISBN: 978-3-540-48318-2
eBook Packages: Springer Book Archive