Abstract
The Routing and Wavelength Assignment problem is investigated in the context of collaboration where tools are shared and used simultaneously over a fiber optic network. Both online and offline versions are discussed, with and without using time as a parameter for scheduling purposes, and including the case where the network is used to carry time-multiplexed traffic. Also, the problem of rescheduling a blocked demand is studied. Several solutions based on Integer Linear Programs (ILP) and heuristics are proposed, implemented and their performance compared. The offline case is solved using two types of ILPs: link and path formulations. ILPs are also proposed for the online problem in addition to heuristic algorithms. While the link formulations give optimal solutions, they take a long time to solve and thus they can only be used for small problems. Path formulations and heuristics scale better but at the expense of optimality. The online approach is recommended when the resort to an offline approach is forbidden by the size of the problem.
Similar content being viewed by others
References
Banerjee, N., Mehta, V., Pandey, S(2004) A genetic algorithm approach for solving the routing and wavelength assignment problem in WDM networks. In: 3rd IEE International Conference on Networking, ICN 2004, pp. 70–78. Feb–March
Chlamtac I., Ganz A., Karmi G.: Lightpath communications: An approach to high bandwidth optical WAN’s. IEEE Trans. Commun. 40(7), 1171–1182 (1992)
Dutta R., Rouskas G.N.: A survey of virtual topology design algorithms for wavelength routed optical networks. Opt. Netw. 1, 73–89 (2000)
Fiber-to-the-Home Council. http://www.ftthcouncil.org
Inocybe Inc. http://www.inocybe.ca
Jaumard, B., Meyer, C., Thiongane, B., Yu, Xiao: ILP formulations and optimal solutions for the RWA problem. Global Telecommunications Conference, 2004. GLOBECOM ’04. IEEE 3, 1918–1924 vol.3, Nov.-3 Dec. (2004)
Kuri J., Puech N., Gagnaire M., Dotaro E., Douville R.: Routing and wavelength assignment of scheduled lightpath demands. IEEE J. Sel. Areas Commun. 21(8), 1231–1240 (2003)
Li T., Wang B.: On optimal survivability design under a scheduled traffic model in wavelength-routed optical mesh networks. In: CNSR 06: Proceedings of the 4th Annual Communication Networks and Services Research Conference, pp. 26–33. IEEE Computer Society, Washington, DC, USA (2006)
Lim Y., Kim H.: A shortest path algorithm for real road network based on path overlap. J. East. Asia Soc. Trans. Stud. 6, 1426–1438 (2005)
Mukherjee B., Banerjee D., Ramamurthy S., Mukherjee A.: Some principles for designing a wide-area WDM optical network. IEEE/ACM Trans. Netw. 4(5), 684–696 (1996)
O’Mahoney M.J., Simeonidou D., Yu A., Zhou J.: The design of a European optical network. J. Lightwave Technol. 13(5), 817–828 (1995)
Reardon Marguerite: Verizon bets big on network infrastructure. October
The National Science Foundation Cyberinfrastructure Council: Cyberinfrastructure vision for 21st century discovery. March (2007)
Zang H., Jue J., Mukherjee B.: A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Opt. Netw. Mag. 1, 47–60 (2000)
Zhou Y., Poo G.-S.: Optical multicast over wavelength-routed WDM networks: A survey. Opt. Switch. Netw. 2(3), 176–197 (2005)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Harzallah, Y., Horton, J.D. & Spencer, B. Assigning routes and wavelengths for collaboration over optical networks. Photon Netw Commun 22, 1–12 (2011). https://doi.org/10.1007/s11107-010-0302-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-010-0302-y