A rearrangement algorithm for switching networks composed of digital symmetrical matrices

Authors
Huynh, DT Nguyen, HN
Citation
Dt. Huynh et Hn. Nguyen, A rearrangement algorithm for switching networks composed of digital symmetrical matrices, INF SCI, 125(1-4), 2000, pp. 83-98
Citations number
15
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION SCIENCES
ISSN journal
00200255 → ACNP
Volume
125
Issue
1-4
Year of publication
2000
Pages
83 - 98
Database
ISI
SICI code
0020-0255(200006)125:1-4<83:ARAFSN>2.0.ZU;2-9
Abstract
The goal of this paper is to study the rearrangeability of switching networ ks composed of digital symmetrical matrices (DSM networks). We will describ e an efficient rearrangement algorithm for rearrangeable DSM networks with O(r(2)) time complexity, where r is the number of input (output) switches. We also show that r-1 is an upper bound on the number of existing connectio ns that need to be rearranged in order to realize a connection request. (C) 2000 Elsevier Science Inc. All rights reserved.