Abstract
In this paper we present a greedy wavelength routing algorithm that allocates a total bandwidth of w(l) wavelengths to any set of requests of load l (where load is defined as the maximum number of requests that go through any directed fiber link) and we give sufficient conditions for correct operation of the algorithm when applied to binary tree networks. We exploit properties of Ramanujan graphs to show that (for the case of binary tree networks) our algorithm increases the bandwidth utilized compared to the algorithm presented in [3]. Furthermore, we use another class of graphs called dispersers, to implement wavelength converters of asymptotically optimal complexity with respect to their size (the number of all possible conversions). We prove that their use leads to optimal and nearly-optimal bandwidth allocation even in a greedy manner.
This work has been partially supported by Progetto MURST 40% Algorithmi, Modelli di Calcolo e Strutture Informative, EU Esprit Project 20244 ALCOM-IT, and Project 3943 of the Greek General Secretariat of Research and Technology.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano, “Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters”. In Proc. of SIROCCO '97, 1997.
V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano, “Efficient Wavelength Routing in Trees with Low-Degree Converters”. In Proc. of the DIMACS Workshop on Optical Networks, 1998, to appear.
L. Gargano, “Limited Wavelength Conversion in All-Optical Tree Networks”. In Proc. of ICALP '98, 1998, to appear.
C. Kaklamanis, P. Persiano, “Efficient Wavelength Routing on Directed Fiber Trees”. In Proc. of the 4th European Symposium on Algorithms (ESA '96), LNCS, Springer Verlag, 1996, pp. 460–470.
C. Kaklamanis, P. Persiano, T. Erlebach, K. Jansen, “Constrained Bipartite Edge Coloring with Applications to Wavelength Routing”. In Proc. of 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, 1997.
A. Lubotsky, R. Philipps, P. Sarnak, “Ramanujan Graphs”. Combinatorica, vol. 8, pp. 261–278, 1988.
M. Mihail, C. Kaklamanis, S. Rao, “Efficient Access to Optical Bandwidth”. In Proc. of the 36th Annual Symposium on Foundations of Computer Science, pp. 548–557, 1995.
J. Radhakrishnan, A. Ta-Shma, “Tight Bounds for Depth-Two Superconcentrators”. In Proc. of the 38th Annual Symposium on Foundations of Computer Science, 1997.
P. Raghavan, E. Upfal, “Efficient Routing in All-Optical Networks”. In Proc. of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 133–143.
M. Sipser, “Expanders, randomness, or time versus space”. Journal of Computer and System Sciences, 36:379–383, 1988.
A. Ta-Shma, “Almost Optimal Dispersere”. In Proc. of STOC '98, 1998, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Auletta, V., Caragiannis, I., Kaklamanis, C., Persiano, P. (1998). On the complexity of wavelength converters. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055828
Download citation
DOI: https://doi.org/10.1007/BFb0055828
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64827-7
Online ISBN: 978-3-540-68532-6
eBook Packages: Springer Book Archive