New upper bound for a rearrangeable non‐blocking WSW architecture
| Autor: | Bey-Chi Lin |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Spectrum (functional analysis)
020206 networking & telecommunications 020302 automobile design & engineering 02 engineering and technology Link (geometry) Blocking (statistics) Optical switch Upper and lower bounds Computer Science Applications Reduction (complexity) Combinatorics 0203 mechanical engineering 0202 electrical engineering electronic engineering information engineering Partition (number theory) Node (circuits) Electrical and Electronic Engineering Mathematics |
| Zdroj: | IET Communications. 13:3425-3433 |
| ISSN: | 1751-8636 |
| DOI: | 10.1049/iet-com.2019.0242 |
| Popis: | An optical network based on elastic optical switches allows requests using different spectrum widths to improve utilisation efficiency. This study considers one three-stage WSW (waveband switching-space switching-waveband switching), optical node architecture for elastic optical networks. A sufficient condition for a rearrangeable non-blocking WSW architecture with limited input/output links has been derived in an earlier work. In this study, the author improves the upper bound by adopting a new interstage link partition scheme associated with a tricky routing algorithm. Suppose a WSW architecture has r input/output links each of which has n frequency slot units (FSUs). Compared with earlier results, the results of the proposed scheme show that s − 1 (or 3s − 4) FSUs per interstage link can be reduced for even (or odd) min{r, n}, where s = min{⌈r/2⌉, ⌈n/2⌉}. The reduction gain is at least 3.5% (or 10%) for even (or odd) min{r, n} if r = n ≤ 26, even achieving 23.3% for limited odd r = n. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text