Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously known. Solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network partially leading to scalable solutions; however, a previous proposal employing a reduced auxiliary graph produces blocking that is not fairly distributed among calls. A novel algorithm is thus proposed in this paper for achieving fairness in relation to the blocking of calls. This algorithm uses alternative routing rather than shortest-path routing as well as auxiliary graphs based on the virtual topology. Results reveal a higher degree of fairness obtained by the use of the novel algorithm than by previously proposed algorithms.
© 2010 Optical Society of AmericaFull Article | PDF Article
Fernando Agraz, Luis Velasco, Jordi Perelló, Marc Ruiz, Salvatore Spadaro, Gabriel Junyent, and Jaume Comellas
J. Opt. Commun. Netw. 1(2) A258-A269 (2009)
Rajesh Roy, Avishek Nag, and Biswanath Mukherjee
J. Opt. Commun. Netw. 2(5) 256-265 (2010)
Sheng Huang, Ming Xia, Chip Martel, and Biswanath Mukherjee
J. Opt. Commun. Netw. 2(8) 545-557 (2010)