By Topic

A Simple Control Algorithm for Rearrangeable Switching Networks with Time Division Multiplexed 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
$33 $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)
S. Ohta ; NTT Electrical Communications Laboratories, Kanagawa, Japan

A simple control algorithm is proposed for a three-stage rearrangeable switching network with time division multiplexed links. The nonblocking condition is shown for the rearrangeable network controlled by the proposed algorithm. The rearrangeable nonblocking network controlled by the proposed method is more cost effective in hardware than a strictly nonblocking network for a large number of channels multiplexed on links. The computing complexity of the algorithms is not more than that for controlling the strictly nonblocking network. In the proposed algorithm, only one path must be moved in the rearrangement, thus reducing the difficulty in implementing the rearrangeable network. This algorithm is efficient for broadband switching systems or cross-connect devices where nonblocking switches are needed.

Published in:

IEEE Journal on Selected Areas in Communications  (Volume:5 ,  Issue: 8 )