Computing approximate blocking probabilities for a class of all-optical networks

被引:262
作者
Birman, A
机构
[1] IBM T. J. Watson Research Center, Yorktowne Heights
[2] Princeton University, Princeton, NJ
关键词
D O I
10.1109/49.510908
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We study a class of all-optical networks using wavelength-division multiplexing (WDM) and wavelength routing, in which a connection between a pair of nodes in the network is assigned a path and a wavelength on that path, Moreover, on the links of that path no other connection can share the assigned wavelength, Using a generalized reduced load approximation scheme we calculate the blocking probabilities for the optical network model for two routing schemes: fixed routing and least loaded routing.
引用
收藏
页码:852 / 857
页数:6
相关论文
共 7 条
[1]  
BALA K, 1991, P INFOCOM 91, P1
[2]   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
[3]   Computing Approximate Blocking Probabilities for Large Loss Networks with State-Dependent Routing [J].
Chung, Shun-Ping ;
Kashper, Arik ;
Ross, Keith W. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (01) :105-115
[4]  
KAROL MJ, 1993, J LIGHTWAVE TECH MAY
[5]   ROUTING AND CAPACITY ALLOCATION IN NETWORKS WITH TRUNK RESERVATION [J].
KELLY, FP .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (04) :771-793
[6]   COMPARATIVE EVALUATIONS OF RANDOMIZED AND DYNAMIC ROUTING STRATEGIES FOR CIRCUIT-SWITCHED NETWORKS [J].
MITRA, D ;
SEERY, JB .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1991, 39 (01) :102-116
[7]  
RAMASWAMI R, 1994, IEEE INFOCOM SER, P970, DOI 10.1109/INFCOM.1994.337639