loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth IEEE Symposium on Computers and Communications 2004 Volume 1 (ISCC'04)
Routing in all-optical ring networks revisited
Alexandria, Egypt
June 28-July 01
ISBN: 0-7803-8623-X
S. Stefanakos, Comput. Eng. & Networks. Lab., Eidgenossische Tech. Hochschule, Zurich, Switzerland
T. Erlebach, Comput. Eng. & Networks. Lab., Eidgenossische Tech. Hochschule, Zurich, Switzerland
A common approach for establishing connection requests in an optical ring network that uses wavelength-division multiplexing is to first find a routing of the requests that minimizes the congestion and then deal with the wavelength allocation. The congestion of a routing, however, does not reflect its wavelength requirements. Indeed, we observe that for certain instances such an approach can result in considerable waste of network resources. To overcome this, we propose a new routing objective, namely to minimize the maximum clique of the routing, i.e., the maximum number of connections that pairwise share a common fiber. We present optimal algorithms and heuristics for finding minimum clique routings and perform experiments to evaluate their performance.
Citation:
S. Stefanakos, T. Erlebach, "Routing in all-optical ring networks revisited," iscc, vol. 1, pp.288-293, Ninth IEEE Symposium on Computers and Communications 2004 Volume 1 (ISCC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.