Mixing Convergence and Deflection Strategies for Packet Routing in All-Optical Networks

被引:3
作者
Barth, D. [1 ]
Berthome, P. [2 ,3 ]
Chiaroni, D.
Fourneau, J. M. [1 ]
Laforest, C. [4 ]
Vial, S. [1 ]
机构
[1] Univ Paris, Univ Versailles, CNRS, PRiSM Lab,UMR 8144, F-75252 Paris, France
[2] Univ Orleans, ENSI Bourges, Orleans, France
[3] Univ Orleans, LIFO, Orleans, France
[4] Univ Clermont Ferrand 2, Photochim Mol & Macromol Lab, CNRS, LIMOS,UMR 6158, F-63177 Clermont Ferrand, France
关键词
All-optical networks; Routing algorithms; Packet-switched networks; Performance evaluation; BOUNDS;
D O I
10.1364/JOCN.1.000222
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We present two routing algorithms based on deflection and convergence, which are able to provide high bandwidth and an ending guarantee for the end-to-end delay in a core network. We study the performance of these routing techniques by using simulations, and we prove the bounds on the delay.
引用
收藏
页码:222 / 234
页数:13
相关论文
共 28 条
[1]   ON DISTRIBUTED COMMUNICATIONS NETWORKS [J].
BARAN, P .
IEEE TRANSACTIONS ON COMMUNICATIONS SYSTEMS, 1964, CS12 (01) :1-&
[2]  
Barth D., 2004, Journal of Interconnection Networks, V5, P93, DOI 10.1142/S0219265904001040
[3]  
Barth D, 2002, LECT NOTES COMPUT SC, V2400, P767
[4]  
BARTH D, 2005, 2 INT C BROADB NETW, V2, P1063
[5]  
BARTH D, 2005, ROBUSTESSE ROUTAGE E
[6]  
BARTH D, 2008, INT C PHOT SWITCH 20
[7]  
BARTH D, 2001, 15 EUR SIM MULT PRAG
[8]  
BARTH D, 2003, LRI1346
[9]  
Berge C., 1985, Graphs and Hypergraphs
[10]  
Borrero A, 2003, PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON COMPUTER AND INFORMATION SCIENCES, P103