Optical network uses a tool for routing called Latin
router. These routers use particular algorithms for routing. For
example, we can refer to LDF algorithm that uses backtracking (one
of CSP methods) for problem solving. In this paper, we proposed
new approached for completion routing table (DRA&CRA
algorithm) and compare with pervious proposed ways and showed
numbers of backtracking, blocking and run time for DRA algorithm
less than LDF and CRA algorithm.
[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] D.Banerjee, J.Frank, and B.Mukherjee, "Passive Optical Network
Architecture Based on Waveguide Grating Routers", Department of
Computer Science University of California, March 1, 1996.
[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.
[7] 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.
[8] Habiboghli, A., Mostafaei, R., and Meybodi, M. R., "Using Latin
Router for Routing Wavelength with Configuration Algorithm",
Proceedings of the WCSET 2009: World Congress of Science,
Engineering and Technology, Venice, Italy, pp. 61-64 July 29-31, 2009.
[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] D.Banerjee, J.Frank, and B.Mukherjee, "Passive Optical Network
Architecture Based on Waveguide Grating Routers", Department of
Computer Science University of California, March 1, 1996.
[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.
[7] 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.
[8] Habiboghli, A., Mostafaei, R., and Meybodi, M. R., "Using Latin
Router for Routing Wavelength with Configuration Algorithm",
Proceedings of the WCSET 2009: World Congress of Science,
Engineering and Technology, Venice, Italy, pp. 61-64 July 29-31, 2009.
@article{"International Journal of Engineering, Mathematical and Physical Sciences:62951", author = "Ali Habiboghli and Rouhollah Mostafaei and Vasif Nabiyev", title = "Completion Latin Square for Wavelength Routing", abstract = "Optical network uses a tool for routing called Latin
router. These routers use particular algorithms for routing. For
example, we can refer to LDF algorithm that uses backtracking (one
of CSP methods) for problem solving. In this paper, we proposed
new approached for completion routing table (DRA&CRA
algorithm) and compare with pervious proposed ways and showed
numbers of backtracking, blocking and run time for DRA algorithm
less than LDF and CRA algorithm.", keywords = "Latin Router, Constraint Satisfaction Problem,Wavelength Routing.", volume = "4", number = "2", pages = "313-4", }