loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)
Nearly-All-Optical Routing in Sparse Optical Tori
Bialystok, Poland
September 13-September 17
ISBN: 0-7695-2554-7
ASCII Text
x 
 
Risto T. Honkanen, "Nearly-All-Optical Routing in Sparse Optical Tori," Parallel Computing in Electrical Engineering, International Conference on, pp. 251-256, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PARELEC.2006.55,
author = {Risto T. Honkanen},
title = {Nearly-All-Optical Routing in Sparse Optical Tori},
journal ={Parallel Computing in Electrical Engineering, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2554-7},
pages = {251-256},
doi = {http://doi.ieeecomputersociety.org/10.1109/PARELEC.2006.55},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Computing in Electrical Engineering, International Conference on
TI - Nearly-All-Optical Routing in Sparse Optical Tori
SN - 0-7695-2554-7
SP251
EP256
A1 - Risto T. Honkanen,
PY - 2006
KW - null
VL - 0
JA - Parallel Computing in Electrical Engineering, International Conference on
ER -
 
Risto T. Honkanen, University of Kuopio, Finland
In this paper we present an all-optical network architecture and a nearly-all-optical router for it. The sparse optical torus network consists of an torus, where processors are deployed diagonally. Addresses of packets are encoded and recognized by using fiber Bragg grating arrays. The optical address recognition ensures that only a few logical gates are needed to implement routing decisions at the routing nodes. A work-optimal routing of -relation is achieved with a reasonable size of .
Citation:
Risto T. Honkanen, "Nearly-All-Optical Routing in Sparse Optical Tori," parelec, pp.251-256, International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.