ROUTING AND WAVELENGTH ASSIGNMENT IN ALL-OPTICAL NETWORKS

被引:587
作者
RAMASWAMI, R [1 ]
SIVARAJAN, KN [1 ]
机构
[1] INDIAN INST SCI,BANGALORE 560012,KARNATAKA,INDIA
关键词
D O I
10.1109/90.469957
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers the problem of routing connections in a reconfigurable optical network using wavelength division multiplexing, Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned different wavelengths, We derive an upper bound on the carried traffic of connections (or equivalently, a lower bound on the blocking probability) for any routing and wavelength assignment (RWA) algorithm in such a network, The bound scales with the number of wavelengths and is achieved asymptotically (when a large number of wavelengths is available) by a fixed RWA algorithm, Although computationally intensive, our bound can be used as a metric against which the performance of different RWA algorithms can be compared for networks of moderate size, We illustrate this by comparing the performance of a simple shortest-path RWA (SP-RWA) algorithm via simulation relative to our bound, We also derive a similar bound for optical networks using dynamic wavelength converters, which are equivalent to circuit-switched telephone networks, and compare the two cases for different examples, Finally, we quantify the amount of wavelength reuse achievable in large networks using the SP-RWA via simulation as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as deBruijn networks, We also quantify the difference in wavelength reuse between two different optical node architectures, The results show that it is feasible to provide several all-optical connections to each node in a large network using a limited number of wavelengths, For instance, using 32 wavelengths, it is possible to provide 10 full-duplex connections to each node in a 128-node random network with average degree 4, and 5 full duplex connections per node in a 1000-node random network with average degree 4. The results also show that wavelength converters offer a 10-40% increase in the amount of reuse achievable for our sampling of 14 networks ranging from 16 to 1000 nodes when the number of wavelengths available is small (10 or 32).
引用
收藏
页码:489 / 500
页数:12
相关论文
共 24 条
[1]  
AGGARWAL A, 1994, 5TH P ANN ACM SIAM S, P412
[2]  
BALA K, 1991, P INFOCOM 91, P1
[3]  
BALA K, 1993, CTR3239302 COL U TEC
[4]   ON THE NUMBER OF WAVELENGTHS AND SWITCHES IN ALL-OPTICAL NETWORKS [J].
BARRY, RA ;
HUMBLET, PA .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1994, 42 (2-4) :583-591
[5]   FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].
BRON, C ;
KERBOSCH, J .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :575-577
[6]  
CHEUNG NK, 1990, IEEE J SELECT AREAS, V8
[7]   LIGHTPATH COMMUNICATIONS - AN APPROACH TO HIGH BANDWIDTH OPTICAL WANS [J].
CHLAMTAC, I ;
GANZ, A ;
KARMI, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (07) :1171-1182
[8]   LIGHTNETS - TOPOLOGIES FOR HIGH-SPEED OPTICAL NETWORKS [J].
CHLAMTAC, I ;
GANZ, A ;
KARMI, G .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 1993, 11 (5-6) :951-961
[9]  
CHLAMTAC I, 1989, P IEEE INFOCOM 89, P887
[10]  
Colbourn C., 1987, COMBINATORICS NETWOR