Siamack Ayandeh. A distributed semi-rearrangeable nonblocking path hunt algorithm for Clos networks with TDM links. In IEEE International Conference on Communications, ICC 2002, April 28 - May 2, 2002, New York City, NY, USA. pages 2832-2842, IEEE, 2002. [doi]
@inproceedings{Ayandeh02, title = {A distributed semi-rearrangeable nonblocking path hunt algorithm for Clos networks with TDM links}, author = {Siamack Ayandeh}, year = {2002}, doi = {10.1109/ICC.2002.997359}, url = {http://dx.doi.org/10.1109/ICC.2002.997359}, researchr = {https://researchr.org/publication/Ayandeh02}, cites = {0}, citedby = {0}, pages = {2832-2842}, booktitle = {IEEE International Conference on Communications, ICC 2002, April 28 - May 2, 2002, New York City, NY, USA}, publisher = {IEEE}, isbn = {0-7803-7400-2}, }