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

IEEE International Conference on Communications

Volumn 5, Issue , 2002, Pages 2832-2842

  Ayandeh, Siamack ^a  

^a Onex Communications Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; TIME DIVISION MULTIPLEXING;

CLOS NETWORKS; MULTICAST TRAFFIC;

TELECOMMUNICATION NETWORKS;

EID: 0036282601     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. A study of non-blocking switching networks
2. A new decomposition algorithm for rearrangeable Clos interconnection networks
3. A rearrangement algorithm for threestage switching networks
4. A simple control algorithm for rearrangeable switching networks with TDM links
5. Semi-rearrangeably non blocking operation of Clos networks in the multirate environment
6. On non-blocking multicast three-stage Clos networks
7. Realization of multiple connection assignments with asymmetrical multi-stage connection networks
8. Rearrangeability of multi connection three-stage Clos networks
9. Non blocking broadcast switching networks
10. Performance of split routing algorithm for three stage multicast networks
11. Three stage multi connection networks which are non-blocking in the wide sense
12. A class of inter-connection networks for multicasting