By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ayandeh, S. ; Onex Commun. Corp., Bedford, MA, USA

A new path hunt algorithm for semi-rearrangeable Clos networks with TDM links is introduced. This algorithm extends the operating range of the network to full capacity utilization. This is with no expansion in the middle stage of the network and is an improvement over existing algorithms (Ohta and Ueda 1987, Ohta 1987). A novel approach to the handling of multicast traffic is introduced in the form of a cascaded pre-stage. An algorithm for re-arrangement in the pre/first stage is defined and its properties are explored. This novel approach allows for the re-arrangeably non-blocking operation of the network up to full network capacity while reducing hardware overbuild in the middle stage from O(m2) down to O(2m). Both bundled and incremental multicast connections are supported. Algorithms are verified via simulation.

Published in:

Communications, 2002. ICC 2002. IEEE International Conference on  (Volume:5 )

Date of Conference: