Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download file Download BibTeX

Title

Simultaneous Connections Routing in Wavelength–Space–Wavelength Elastic Optical Switches

Authors

[ 1 ] Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ 2 ] Instytut Sieci Teleinformatycznych, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ D ] phd student | [ P ] employee

Scientific discipline (Law 2.0)

[2.3] Information and communication technology

Year of publication

2023

Published in

Sensors

Journal year: 2023 | Journal volume: vol. 23 | Journal number: iss. 7

Article type

scientific article

Publication language

english

Keywords
EN
  • three-stage switching network
  • rearrangeable switching network
  • connection routing
  • elastic optical networ
Abstract

EN In this paper, we investigate the three-stage, wavelength–space–wavelength switching fabric architecture for nodes in elastic optical networks. In general, this switching fabric has r input and output switches with wavelength-converting capabilities and one center-stage space switch that does not change the spectrum used by a connection. This architecture is most commonly denoted by the WSW1 (r, n, k) switching network. We focus on this switching fabric serving simultaneous connection routing. Such routing takes place mostly in synchronous packet networks, where packets for switching arrive at the inputs of a switching network at the same time. Until now, only switching fabrics with up to three inputs and outputs have been extensively investigated. Routing in switching fabrics of greater capacity is estimated based on routing in switches with two or three inputs and outputs. We now improve the results for the switching fabrics with four inputs and outputs and use these results to estimate routing in the switching fabric with an arbitrary number of inputs and outputs. We propose six routing algorithms based on matrix decomposition for simultaneous connection routing. For the proposed routing algorithms, we derive criteria under which they always succeed. The proposed routing algorithms allow the construction of nonblocking switching fabrics with a lower number of wavelength converters and the reduction of the overall switching fabric cost.

Pages (from - to)

1 - 22

DOI

10.3390/s23073615

URL

https://www.mdpi.com/1424-8220/23/7/3615

License type

CC BY (attribution alone)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Full text of article

Download file

Access level to full text

public

Ministry points / journal

100

Impact Factor

3,4

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.