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
|
الموضوعات: | |
الوصول للمادة أونلاين: | http://hdl.handle.net/10361/7309 http://dx.doi.org/110.1109/AINA.2013.55 |
مواد مشابهة
-
O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
بواسطة: Chakrabarty, Amitabha, وآخرون
منشور في: (2016) -
Cost efficient implementation of multistage symmetric repackable networks
بواسطة: Chakrabarty, Dr. Amitabha, وآخرون
منشور في: (2016) -
A new routing algorithm for symmetric rearrangeable networks and emerging applications
بواسطة: Chakrabarty, Amitabha, وآخرون
منشور في: (2016) -
Social interest based routing algorithm for pocket switched network
بواسطة: Tasfe, Mahrin, وآخرون
منشور في: (2018) -
Accelerating a Bellman-Ford routing algorithm using GPU
بواسطة: Jeong, In-Kyu, وآخرون
منشور في: (2016)