A rearrangement algorithm for switching networks composed of digital symmetrical matrices (Q1573379): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:57, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A rearrangement algorithm for switching networks composed of digital symmetrical matrices |
scientific article |
Statements
A rearrangement algorithm for switching networks composed of digital symmetrical matrices (English)
0 references
5 August 2001
0 references
The goal of this paper is to study the rearrangeability of switching networks composed of digital symmetrical matrices (DSM networks). We describe 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 connections that need to be rearranged in order to realize a connection request.
0 references
DSM networks
0 references
rearrangeability of switching networks
0 references
digital symmetrical matrices
0 references
upper bound
0 references
