loading...
Efficient Solution of the Traffic Grooming Problem in Light-Trail Optical Networks
Cagliari, Sardinia, Italy June 26-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISCC.2006.6511th IEEE Symposium on Computers and ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Amr S. Ayad, Cairo University, Egypt
Khaled M. El Sayed, Cairo University, Egypt
Sanaa H. Ahmed, Cairo University, Egypt
The concept of light-trails has been introduced in [1] as an efficient and feasible technology for IP transport over all-optical networks. Light-trails have been shown to offer a number of advantages over other technologies such as Optical Burst Switching (OBS) or Optical Packet Switching (OPS). This paper discusses the routing problem of light-trails. We present an enhancement for reducing the size of the routing problem before optimally solving it using Integer Linear Programming (ILP). We also propose an efficient heuristic for solving the static routing problem. The results show the efficiency of the proposed heuristic scheme.
Citation:
Amr S. Ayad, Khaled M. El Sayed, Sanaa H. Ahmed, "Efficient Solution of the Traffic Grooming Problem in Light-Trail Optical Networks," iscc, pp.622-627, 11th IEEE Symposium on Computers and Communications (ISCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.