Abstract
Motivated by the increasing importance of multifiber WDM networks we study two routing and wavelength assignment problems in such networks:
-
Fiber Cost Minimization: the number of wavelengths per fiber is given and we want to minimize the cost of fiber links that need to be reserved in order to satisfy a set of communication requests; we introduce a generalized setting where network pricing is nonuniform, that is the cost of hiring a fiber may differ from link to link.
-
Wavelength Minimization: the number of available parallel fibers on each link is given and we want to minimize the wavelengths per fiber that are needed in order to satisfy a set of communication requests.
For each problem we consider two variations: undirected, which corresponds to full-duplex communication, and directed, which corresponds to one-way communication. Moreover, for rings we also study the problem in the case of pre-determined routing. We present exact or constant-ratio approximation algorithms for all the above variations in chain, ring, star and spider networks.
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
C. Chekuri, M. Mydlarz, and F. B. Shepherd. Multicommodity demand flow in a tree. In Proc. Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, pages 410–425, 2003.
A. L. Chiu and E. Modiano. Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. Journal of Lightwave Technology, 18(1):2–12, 2000.
R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O(ElogD) time. Combinatorica, 21(1):5–12, 2001.
R. Dutta, S. Huang, and G. N. Rouskas. Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms. In Proc. of the 2003 ACM SIGMETRICS, 2003, pages 298–299. ACM Press.
T. Erlebach, A. Pagourtzis, K. Potika, and S. Stefanakos. Resource allocation problems in multifiber WDM tree networks. In Proc. of the 29th Workshop on Graph Theoretic Concepts in Computer Science, LNCS 2880, pages 218–229, 2003.
G. Li and R. Simha. On the wavelength assignment problem in multifiber WDM star and ring networks. IEEE/ACM Transactions on Networking, 9(l):60–68, 2001.
L. Margara and J. Simon. Wavelength assignment problem on all-optical networks with k fibres per link. In Proc. Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, pages 768–779, 2000.
C. Nomikos, A. Pagourtzis, K. Potika, and S. Zachos. Path multi-coloring in weighted graphs. In Proc. of the 8th PCI, volume I, pages 178–186, 2001.
C. Nomikos, A. Pagourtzis, and S. Zachos. Routing and path multicoloring. Information Processing Letters, 80(5):249–256, 2001.
C. Nomikos, A. Pagourtzis, and S. Zachos. Minimizing request blocking in all-optical rings. In Proc. INFOCOM2003, San Francisco, CA, 2003.
P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In Proc. of the twenty-sixth annual ACM STOC, pages 134–143. ACM Press, 1994.
V. Vizing. On an estimate of the chromatic class of a p-graph (in russian). Diskret. Analiz., 3:23–30, 1964.
P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In Proc. of the 14th Annual ACM-SIAM SODA, pages 830–831, Baltimore, MD, January 2003.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nomikos, C., Pagourtzis, A., Potika, K., Zachos, S. (2004). Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-24693-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive