loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02)
An Efficient Routing Algorithm for All-Optical Networks with Turn Constraints
Fort Worth, Texas
October 11-October 16
ISBN: 0-7695-1840-0
ASCII Text
x 
 
H. Soliman, C. Peyton, "An Efficient Routing Algorithm for All-Optical Networks with Turn Constraints," Modeling, Analysis, and Simulation of Computer Systems, International Symposium on, pp. 0161, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/MASCOT.2002.1167073,
author = {H. Soliman and C. Peyton},
title = {An Efficient Routing Algorithm for All-Optical Networks with Turn Constraints},
journal ={Modeling, Analysis, and Simulation of Computer Systems, International Symposium on},
volume = {0},
year = {2002},
isbn = {0-7695-1840-0},
pages = {0161},
doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.2002.1167073},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
TI - An Efficient Routing Algorithm for All-Optical Networks with Turn Constraints
SN - 0-7695-1840-0
SP
EP
A1 - H. Soliman,
A1 - C. Peyton,
PY - 2002
VL - 0
JA - Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
ER -
 
In all-optical networks, adjacent link constraints (known as turn constraints) can model existing restrictions in all-optical networks with limited wavelength converters and blocking optical switches. We presents two different concrete implementations for a shortest path routing algorithm that accounts for link and turn constraints in all-optical networks. The efficiency of our new algorithm implementation is proven and analyzed via the simulation of sparse network topologies.
Citation:
H. Soliman, C. Peyton, "An Efficient Routing Algorithm for All-Optical Networks with Turn Constraints," mascots, pp.0161, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.