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...
Hoofdauteurs: | Chakrabarty, Amitabha, Collier, Martin J. |
---|---|
Andere auteurs: | Department of Computer Science and Engineering, BRAC University |
Formaat: | Conference paper |
Taal: | English |
Gepubliceerd in: |
© 2013 IEEE
2016
|
Onderwerpen: | |
Online toegang: | http://hdl.handle.net/10361/7309 http://dx.doi.org/110.1109/AINA.2013.55 |
Gelijkaardige items
-
O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
door: Chakrabarty, Amitabha, et al.
Gepubliceerd in: (2016) -
Cost efficient implementation of multistage symmetric repackable networks
door: Chakrabarty, Dr. Amitabha, et al.
Gepubliceerd in: (2016) -
A new routing algorithm for symmetric rearrangeable networks and emerging applications
door: Chakrabarty, Amitabha, et al.
Gepubliceerd in: (2016) -
Social interest based routing algorithm for pocket switched network
door: Tasfe, Mahrin, et al.
Gepubliceerd in: (2018) -
Accelerating a Bellman-Ford routing algorithm using GPU
door: Jeong, In-Kyu, et al.
Gepubliceerd in: (2016)