Low complexity routing algorithm for rearrangeable switching networks

Low complexity routing algorithm for rearrangeable switching networks

This conference paper was presented in the 27th IEEE International Conference on Advanced Information Networking and Applications, AINA 2013; Barcelona; Spain; 25 March 2013 through 28 March 2013 [© 2013 IEEE] The conference paper's definite version is available at: http://dx.doi.org/110.1109/A...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Chakrabarty, Amitabha, Collier, Martin J.
Awduron Eraill: Department of Computer Science and Engineering, BRAC University
Fformat: Conference paper
Iaith:English
Cyhoeddwyd: © 2013 IEEE 2016
Pynciau:
Complexity
Interconnection networks
Permutation
Rearrangeable networks
Routing tags
Mynediad Ar-lein:http://hdl.handle.net/10361/7309
http://dx.doi.org/110.1109/AINA.2013.55

Rhyngrwyd

http://hdl.handle.net/10361/7309
http://dx.doi.org/110.1109/AINA.2013.55

Eitemau Tebyg