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...
Main Authors: | Chakrabarty, Amitabha, Collier, Martin J. |
---|---|
Drugi avtorji: | Department of Computer Science and Engineering, BRAC University |
Format: | Conference paper |
Jezik: | English |
Izdano: |
© 2013 IEEE
2016
|
Teme: | |
Online dostop: | http://hdl.handle.net/10361/7309 http://dx.doi.org/110.1109/AINA.2013.55 |
Podobne knjige/članki
-
O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
od: Chakrabarty, Amitabha, et al.
Izdano: (2016) -
Cost efficient implementation of multistage symmetric repackable networks
od: Chakrabarty, Dr. Amitabha, et al.
Izdano: (2016) -
A new routing algorithm for symmetric rearrangeable networks and emerging applications
od: Chakrabarty, Amitabha, et al.
Izdano: (2016) -
Social interest based routing algorithm for pocket switched network
od: Tasfe, Mahrin, et al.
Izdano: (2018) -
Accelerating a Bellman-Ford routing algorithm using GPU
od: Jeong, In-Kyu, et al.
Izdano: (2016)