Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
