<mml:math altimg="si6.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mi>O</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>log</mml:mo><mml:mover accent="false"><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mo accent="true">¯</mml:mo></mml:mover><mml:mo>.</mml:mo><mml:mo>log</mml:mo><mml:mi>N</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math> routing algorithm for <mml:math altimg="si7.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd" xmlns:sa="http://www.elsevier.com/xml/common/struct-aff/dtd"><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>log</mml:mo><mml:mi>N</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-stage switching networks and beyond

Amitabha Chakrabarty; Martin Collier

doi:10.1016/j.jpdc.2014.06.004

O(logm¯.logN) routing algorithm for (2logN−1)-stage switching networks and beyond

Journal of Parallel and Distributed Computing ◽

10.1016/j.jpdc.2014.06.004 ◽

2014 ◽

Vol 74 (10) ◽

pp. 3045-3055 ◽

Cited By ~ 5

Author(s):

Amitabha Chakrabarty ◽

Martin Collier

Keyword(s):

Routing Algorithm ◽

Switching Networks

Download Full-text

Low Complexity Routing Algorithm for Rearrangeable Switching Networks

2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA) ◽

10.1109/aina.2013.55 ◽

2013 ◽

Author(s):

A. Chakrabarty ◽

M. Collier

Keyword(s):

Routing Algorithm ◽

Low Complexity ◽

Switching Networks

Download Full-text

The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks

IEEE Journal on Selected Areas in Communications ◽

10.1109/jsac.2006.258221 ◽

2006 ◽

Vol 24 (12) ◽

pp. 35-44 ◽

Cited By ~ 11

Author(s):

Wojciech Kabacinski ◽

Marek Michalski

Keyword(s):

Routing Algorithm ◽

Wide Sense ◽

Switching Networks

Download Full-text

Cost-Effective Deflection Routing Algorithm in Optical Burst Switching Networks

Parallel and Distributed Computing: Applications and Technologies - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30501-9_94 ◽

2004 ◽

pp. 464-468

Author(s):

SuKyoung Lee ◽

LaeYoung Kim ◽

JooSeok Song

Keyword(s):

Routing Algorithm ◽

Optical Burst Switching ◽

Cost Effective ◽

Switching Networks ◽

Deflection Routing ◽

Burst Switching ◽

Optical Burst Switching Networks ◽

Optical Burst

Download Full-text

A New Routing Algorithm Based on Priority in Optical Burst Switching Networks

International Journal of Digital Content Technology and its Applications ◽

10.4156/jdcta.vol6.issue17.44 ◽

2012 ◽

Vol 6 (17) ◽

pp. 402-409

Author(s):

Guan AiHong ◽

Wang BoYun

Keyword(s):

Routing Algorithm ◽

Optical Burst Switching ◽

Switching Networks ◽

Burst Switching ◽

Optical Burst Switching Networks ◽

Optical Burst

Download Full-text

Simulation of a New Constraint Based Routing Algorithm for Multi-Protocol Label Switching Networks

2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications ◽

10.1109/ictta.2008.4530216 ◽

2008 ◽

Cited By ~ 2

Author(s):

Mahmood Z Al-Ani ◽

Fawzi M M Al-Naima ◽

Siddeeq Y Amin

Keyword(s):

Routing Algorithm ◽

Switching Networks ◽

Label Switching ◽

Multi Protocol Label Switching

Download Full-text

TPDR: an efficient deflection routing algorithm to resolve burst contention in optical burst switching networks

10.1117/12.570878 ◽

2005 ◽

Author(s):

Xiaolong Yang ◽

Keping Long ◽

Qianbin Chen ◽

Hong Jiang

Keyword(s):

Routing Algorithm ◽

Optical Burst Switching ◽

Switching Networks ◽

Deflection Routing ◽

Burst Switching ◽

Optical Burst Switching Networks ◽

Optical Burst

Download Full-text

Adaptive load balancing routing algorithm for optical burst-switching networks

2006 Optical Fiber Communication Conference and the National Fiber Optic Engineers Conference ◽

10.1109/ofc.2006.215713 ◽

2006 ◽

Cited By ~ 3

Author(s):

Yu Du ◽

Tao Pu ◽

Hanyi Zhang ◽

YiIi Quo

Keyword(s):

Load Balancing ◽

Routing Algorithm ◽

Optical Burst Switching ◽

Switching Networks ◽

Burst Switching ◽

Optical Burst Switching Networks ◽

Optical Burst

Download Full-text

An Efficient Crosstalk-Free Routing Algorithm Based on Permutation Decomposition for Optical Multi-log2 N Switching Networks

Lecture Notes in Computer Science - Network and Parallel Computing ◽

10.1007/978-3-642-40820-5_18 ◽

2013 ◽

pp. 207-219

Author(s):

Xiaofeng Liu ◽

Youjian Zhao ◽

Yajuan Wu

Keyword(s):

Routing Algorithm ◽

Switching Networks

Download Full-text

Performance Analysis of Particle Swarm Optimization Based Routing Algorithm in Optical Burst Switching Networks

Journal of Optical Communications ◽

10.1515/joc.2011.044 ◽

2011 ◽

Vol 32 (4) ◽

Author(s):

Rui Hou ◽

Junle Yu

Keyword(s):

Particle Swarm Optimization ◽

Performance Analysis ◽

Routing Algorithm ◽

Particle Swarm ◽

Optical Burst Switching ◽

Switching Networks ◽

Swarm Optimization ◽

Burst Switching ◽

Optical Burst Switching Networks ◽

Optical Burst

Download Full-text

A distributed routing algorithm in hybrid circuit/packet switching networks

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution? ◽

10.1109/infcom.1988.12992 ◽

2003 ◽

Author(s):

Li Wei ◽

Yang Youwei ◽

Hu Zheng

Keyword(s):

Packet Switching ◽

Routing Algorithm ◽

Switching Networks ◽

Distributed Routing ◽

Packet Switching Networks ◽

Hybrid Circuit

Download Full-text