Nonblocking WDM switches based on arrayed waveguide grating and limited wavelength conversion

被引:0
作者
Ngo, HQ [1 ]
Pan, DZ [1 ]
Qiao, CM [1 ]
机构
[1] SUNY Buffalo, Amherst, NY 14260 USA
来源
IEEE INFOCOM 2004: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS | 2004年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Constructing wavelength division multiplexing (WDM) switches with cheap components and low complexity is an important problem in optical networking. Typically, there are two request models widely considered. In one model, a connection request asks to go from a wavelength on an input fiber of the WDM switch to a particular wavelength on an output fiber. In the other, a connection only needs to get to a particular output fiber, irrespective of what wavelength it will be on. In this paper, we give novel constructions of strictly non-blocking and rearrangeably nonblocking WDM switches for both request models using limited range wavelength converters and arrayed waveguide grating routers. We fully analyze their blocking characteristics. Our designs are all relatively simple and easy to be laid out, and are useful for both optical circuit-switching and optical packet/burst switching. As far as we know, these are the first of such constructions.
引用
收藏
页码:1352 / 1362
页数:11
相关论文
共 21 条
[1]  
[Anonymous], 1998, MATH THEORY NONBLOCK
[2]  
Benes V.E., 1965, (Mathematics in Science and Engineering), V17
[3]   A STUDY OF NON-BLOCKING SWITCHING NETWORKS [J].
CLOS, C .
BELL SYSTEM TECHNICAL JOURNAL, 1953, 32 (02) :406-424
[4]   ON EDGE COLORING BIPARTITE GRAPHS [J].
COLE, R ;
HOPCROFT, J .
SIAM JOURNAL ON COMPUTING, 1982, 11 (03) :540-546
[5]   AN N X N OPTICAL MULTIPLEXER USING A PLANAR ARRANGEMENT OF 2 STAR COUPLERS [J].
DRAGONE, C .
IEEE PHOTONICS TECHNOLOGY LETTERS, 1991, 3 (09) :812-815
[6]   USING EULER PARTITIONS TO EDGE COLOR BIPARTITE MULTIGRAPHS [J].
GABOW, HN .
INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1976, 5 (04) :345-355
[7]   ALGORITHMS FOR EDGE COLORING BIPARTITE GRAPHS AND MULTIGRAPHS [J].
GABOW, HN ;
KARIV, O .
SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :117-129
[8]  
Hall P, 1935, J. Lond. Math. Soc., Vs1-10, P26, DOI [10.1112/jlms/s1-10.37.26, DOI 10.1112/JLMS/S1-10.37.26]
[9]  
Haxell P, 2002, LECT NOTES COMPUT SC, V2461, P538
[10]  
JING ZG, 2003, P IEEE INF 03 SAN FR