Combinatorial Properties and Defragmentation Algorithms in WSW1 Switching Fabrics
A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentatio...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Academy of Sciences
2020-02-01
|
| Series: | International Journal of Electronics and Telecommunications |
| Subjects: | |
| Online Access: | https://journals.pan.pl/Content/113750/PDF/14_2020.pdf |
| Summary: | A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-spacewavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability. |
|---|---|
| ISSN: | 2081-8491 2300-1933 |