A distributed semi-rearrangeable nonblocking path hunt algorithm for Clos networks with TDM links

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]

Abstract

Abstract is missing.