Constraint satisfaction in optical routing for passive wavelength-routed networks
A wavelength-routed, optical network employs all-optical channels (lightpaths) on multiple wavelengths to establish a rearrangeable interconnection pattern (virtual topology) for transport of data. A lightpath may span multiple fiber-links, and may be routed optically at an intermediate node without undergoing electronic conversion. We examine the problem of establishing a set of lightpaths in an optical network, which employs a passive wavelength routing device called a Latin Router (LR). Latin Routers are attractive for optical network design because of their fault-tolerance and low cost, but make traditional routing algorithms difficult to implement due to the complexity of the constraints they impose on legitimate routes and colors. We employ a local search algorithm to search the space of virtual topologies in order to satisfy a maximum number of given lightpath requests. We use the same algorithm to maximize the number of single-hop connections for a given network. We show that the algorithm can satisfy a high percentage of lightpaths under low to moderate network loads. Experiments reveal that we can establish O(N) lightpaths in an optical network with N nodes. We believe that our work is the first known attempt at designing optical wide-area networks using Latin Routers.
Keywordswavelength routing latin routers local search optical networks
Unable to display preview. Download preview PDF.
- [BH95]R. A. Barry and P. A. Humblet. Models of blocking probability in all optical networks with and without wavelength changers. Proceedings of IEEE Infocom, pages 402–411, June 1995.Google Scholar
- [BM95]D. Banerjee and B. Mukherjee. Practical approaches for routing and wavelength assignments in large all optical wavelength routed networks. IEEE Special Issue JSAC/JLT on Optical Networks, 1995.Google Scholar
- [CB95]C. Chien and S. Banerjee. Optical switch configuration and lightpath assignment in wavelength routing multihop lightwave networks. Proceedings of the 14th IEEE Infocom, 1995.Google Scholar
- [CPS90]O. Chien, H. Plugfelder, and J. Smith, editors. Quasigroups and Loops: Theory and Applications. Helderman Verlag, 1990.Google Scholar
- [DEK91]C. Dragone, C. A. Edwards, and R. C. Kistler. Integrated optics nxn multiplexer on silicon. IEEE Photonics Technology Letters, 3(10):896–898, 1991.Google Scholar
- [MIR93]M. Marathe, H. B. Hunt III, and S. S. Ravi. Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs. 5th International Symposium on Algorithms and Information, 1993.Google Scholar
- [MJPL92]S. Minton, M. Johnston, A. Phillips, and P. Laird. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 1992.Google Scholar
- [RS94]R. Ramaswami and K. Sivarajan. Optical routing and wavelength assignment in all optical networks. Proceedings of IEEE Infocom, pages 970–983 1994.Google Scholar
- [SLM92]B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. Proceedings of the 10th National Conference on Artificial Intelligence, 1992.Google Scholar
- [Tuc75]A. Tucker. Coloring a family of circular arcs. SIAM Journal of Applied Mathematics, 1975.Google Scholar
- [ZA94]Z. Zhang and A. Acampora. A heuristic wavelength assignment algorithm for multihop wdm networks with wavelength routing and wavelength reuse. Proceedings of IEEE Infocom, pages 534–543, 1994.Google Scholar