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...

وصف كامل

التفاصيل البيبلوغرافية
المؤلفون الرئيسيون: Chakrabarty, Amitabha, Collier, Martin J.
مؤلفون آخرون: Department of Computer Science and Engineering, BRAC University
التنسيق: Conference paper
اللغة:English
منشور في: © 2013 IEEE 2016
الموضوعات:
Complexity
Interconnection networks
Permutation
Rearrangeable networks
Routing tags
الوصول للمادة أونلاين:http://hdl.handle.net/10361/7309
http://dx.doi.org/110.1109/AINA.2013.55

الانترنت

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

مواد مشابهة