Using of Latin Router for Routing Wavelength with Configuration Algorithm
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 32799
Using of Latin Router for Routing Wavelength with Configuration Algorithm

Authors: A. Habiboghli, R. Mostafaei, M. R.Meybodi

Abstract:

Optical network uses a tool for routing which is called Latin router. These routers use particular algorithms for routing. In this paper, we present algorithm for configuration of optical network that is optimized regarding previous algorithm. We show that by decreasing the number of hops for source-destination in lightpath number of satisfied request is less. Also we had shown that more than single-hop lightpath relating single-hop lightpath is better.

Keywords: Latin Router, Constraint Satisfied, Wavelength, Optical Network

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1057203

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1431

References:


[1] C. Chien and S. Banerjee. "Optical switch configuration and lightpath assignment in wavelength routing multihop lightwave networks." Proceedings of the 14th IEEE Info COM, 1995
[2] D.Banerjee and J.Frank, "Constraint Satisfaction in Optical Routing for Passive Wavelength-Routed Networks", Department of Computer Science University of California, 1998.
[3] Carla P. Gomes and D.hmoys, "Completing Quasigroups or Latin Squares: A Structured Graph Coloring Problem", In Proc. Computational Symposium on Graph Coloring and Generalizations, Cornell University , Dept. of Comp. Science , 2002
[4] D. Banerjee and J. Frank, and B. Mukherjee, "Passive Optical Network Architecture Based on Waveguide Grating Routers" IEEE Journal on selectet areas in communications, september 1998
[5] M.H.Saqalli , L.Purvis and E.C.Freuder " Survey of Application Integrating Constraint Satisfaction and Case-Based Reasoning " university of New Hampshire , pages3-4 , 2000
[6] K.Vermirovsky , "Algorithms for Constraint Satisfaction Problems ", Master Thesis of Purdue University ,2003