Simultaneous Connection

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 186 Experts worldwide ranked by ideXlab platform

Akihiro Kajiwara - One of the best experts on this subject based on the ideXlab platform.

Remigiusz Rajewski - One of the best experts on this subject based on the ideXlab platform.

  • Rearrangeable $$2 \times 2$$2×2 elastic optical switch with two Connection rates and spectrum conversion capability
    Photonic Network Communications, 2020
    Co-Authors: Wojciech Kabaciński, Remigiusz Rajewski, Atyaf Al-tameemi
    Abstract:

    In this study, we consider Simultaneous Connection routing in the three-stage switching fabric of the wavelength-space-wavelength architecture for elastic optical switches, which serve Connections that can occupy different spectrum widths. Recently, the upper bound of the rearrangeability conditions was derived and proved for a switching fabric serving a limited number of Connection rates. A control algorithm based on matrix decomposition was also proposed. In addition, the necessary and sufficient conditions were derived and proved for a switching fabric with a size of $$2 \times 2$$ 2 × 2 serving only two Connection rates, but only when the ratios between the Connection rates and link capacity are integers. In this study, we extend these results to an arbitrary ratio between the Connection rates and link capacity. The number of frequency slot units required in the interstage links is much lower than that in the strict-sense nonblocking switching fabrics. We also propose modifications to the control algorithm, which further reduces the number of frequency slot units required in many cases. Finally, we extend the results for $$2 \times 2$$ 2 × 2 switching fabrics to those with a size of $$r \times r$$ r × r .

  • Rearrangeable $$2 \times 2$$ 2 × 2
    Photonic Network Communications, 2019
    Co-Authors: Wojciech Kabaciński, Remigiusz Rajewski, Atyaf Al-tameemi
    Abstract:

    In this study, we consider Simultaneous Connection routing in the three-stage switching fabric of the wavelength-space-wavelength architecture for elastic optical switches, which serve Connections that can occupy different spectrum widths. Recently, the upper bound of the rearrangeability conditions was derived and proved for a switching fabric serving a limited number of Connection rates. A control algorithm based on matrix decomposition was also proposed. In addition, the necessary and sufficient conditions were derived and proved for a switching fabric with a size of $$2 \times 2$$ 2 × 2 serving only two Connection rates, but only when the ratios between the Connection rates and link capacity are integers. In this study, we extend these results to an arbitrary ratio between the Connection rates and link capacity. The number of frequency slot units required in the interstage links is much lower than that in the strict-sense nonblocking switching fabrics. We also propose modifications to the control algorithm, which further reduces the number of frequency slot units required in many cases. Finally, we extend the results for $$2 \times 2$$ 2 × 2 switching fabrics to those with a size of $$r \times r$$ r × r .

  • Necessary and Sufficient Conditions for the Rearrangeability of WSW1 Switching Fabrics
    IEEE Access, 2019
    Co-Authors: Wojciech Kabaciński, Atyaf Al-tameemie, Remigiusz Rajewski
    Abstract:

    This paper considers the three-stage switching fabrics of the wavelength-space-wavelength architecture, called the WSW1 switching fabrics, for elastic optical nodes. Seven control algorithms for Simultaneous Connection routing are described. One algorithm is designed for the WSW1 switching fabric with two inputs and two outputs, four algorithms for the WSW1 switching fabric with three inputs and outputs, and two algorithms for nodes with a capacity greater than 3. We establish the necessary conditions for rearrangeability and prove sufficient rearrangeable conditions for the proposed algorithms. In cases where the switching fabric capacity is a multiple of 3, the sufficient conditions obtained for the proposed algorithms are the best known and close to the necessary conditions.

  • Rearrangeability of Wavelength-Space-Wavelength Switching Fabric Architecture for Elastic Optical Switches
    IEEE Access, 2019
    Co-Authors: Wojciech Kabaciński, Atyaf Al-tameemie, Remigiusz Rajewski
    Abstract:

    In this paper, we consider the necessary and sufficient rearrangeability conditions for the wavelength-space-wavelength switching fabric, called the WSW2 switching fabric, for elastic optical network nodes. We derive and prove the lower bound of the necessary conditions for such switching fabrics to be rearrangeable. We also show the upper bound of the sufficient conditions for the rearrangeability of the switching fabric with two input and two output switches. For Simultaneous Connection routing, we propose a routing algorithm that always ends with success in switching fabrics, which fulfill the sufficient conditions. Finally, we extend the proposed algorithm to the switching fabric with r input and r output switches, and we derive the conditions under which this routing algorithm always ends in success. The required number of center-stage switches is significantly lower than that in the strict-sense nonblocking switching fabrics. To our knowledge, the proposed routing algorithm is the first one which ends with success for any Connection set, within the provided sufficient conditions.

Asahi Morimatsu - One of the best experts on this subject based on the ideXlab platform.

Douglas J. Leith - One of the best experts on this subject based on the ideXlab platform.

  • Utility Fair Rate Allocation in LTE/802.11 Networks
    IEEE ACM Transactions on Networking, 2017
    Co-Authors: Bahar Partov, Douglas J. Leith
    Abstract:

    We consider proportional fair rate allocation in a heterogeneous network with a mix of LTE and 802.11 cells which supports multipath and multihomed operation (Simultaneous Connection of a user device to multiple LTE base stations and 802.11 access points). We show that the utility fair optimization problem is non-convex but that a global optimum can be found by solving a sequence of convex optimizations in a distributed fashion. The result is a principled approach to offload from LTE to 802.11 and for exploiting LTE/802.11 path diversity to meet user traffic demands.

  • Allerton - Utility fair RAT selection in multi-homed LTE/802.11 networks
    2015 53rd Annual Allerton Conference on Communication Control and Computing (Allerton), 2015
    Co-Authors: Bahar Partov, Douglas J. Leith
    Abstract:

    We consider proportional fair rate allocation in a heterogeneous network with a mix of LTE and 802.11 Radio Access Technologies (RATs) which supports multipath and multi-homed operation (Simultaneous Connection of a user device to multiple LTE BSs and one 802.11 AP). We show that the utility fair optimisation problem is non-convex but that a global optimum can be found by solving a sequence of convex optimisations in a distributed fashion. The result is a principled approach to offload from LTE to 802.11 and for exploiting LTE/802.11 path diversity to meet user traffic demands.

  • Utility fair RAT selection in multi-homed LTE/802.11 networks
    2015 53rd Annual Allerton Conference on Communication Control and Computing (Allerton), 2015
    Co-Authors: Bahar Partov, Douglas J. Leith
    Abstract:

    We consider proportional fair rate allocation in a heterogeneous network with a mix of LTE and 802.11 Radio Access Technologies (RATs) which supports multipath and multi-homed operation (Simultaneous Connection of a user device to multiple LTE BSs and one 802.11 AP). We show that the utility fair optimisation problem is non-convex but that a global optimum can be found by solving a sequence of convex optimisations in a distributed fashion. The result is a principled approach to offload from LTE to 802.11 and for exploiting LTE/802.11 path diversity to meet user traffic demands.

Wojciech Kabaciński - One of the best experts on this subject based on the ideXlab platform.

  • Rearrangeable $$2 \times 2$$2×2 elastic optical switch with two Connection rates and spectrum conversion capability
    Photonic Network Communications, 2020
    Co-Authors: Wojciech Kabaciński, Remigiusz Rajewski, Atyaf Al-tameemi
    Abstract:

    In this study, we consider Simultaneous Connection routing in the three-stage switching fabric of the wavelength-space-wavelength architecture for elastic optical switches, which serve Connections that can occupy different spectrum widths. Recently, the upper bound of the rearrangeability conditions was derived and proved for a switching fabric serving a limited number of Connection rates. A control algorithm based on matrix decomposition was also proposed. In addition, the necessary and sufficient conditions were derived and proved for a switching fabric with a size of $$2 \times 2$$ 2 × 2 serving only two Connection rates, but only when the ratios between the Connection rates and link capacity are integers. In this study, we extend these results to an arbitrary ratio between the Connection rates and link capacity. The number of frequency slot units required in the interstage links is much lower than that in the strict-sense nonblocking switching fabrics. We also propose modifications to the control algorithm, which further reduces the number of frequency slot units required in many cases. Finally, we extend the results for $$2 \times 2$$ 2 × 2 switching fabrics to those with a size of $$r \times r$$ r × r .

  • Necessary and Sufficient Conditions for the Rearrangeability of WSW1 Switching Fabrics
    IEEE Access, 2019
    Co-Authors: Wojciech Kabaciński, Atyaf Al-tameemie, Remigiusz Rajewski
    Abstract:

    This paper considers the three-stage switching fabrics of the wavelength-space-wavelength architecture, called the WSW1 switching fabrics, for elastic optical nodes. Seven control algorithms for Simultaneous Connection routing are described. One algorithm is designed for the WSW1 switching fabric with two inputs and two outputs, four algorithms for the WSW1 switching fabric with three inputs and outputs, and two algorithms for nodes with a capacity greater than 3. We establish the necessary conditions for rearrangeability and prove sufficient rearrangeable conditions for the proposed algorithms. In cases where the switching fabric capacity is a multiple of 3, the sufficient conditions obtained for the proposed algorithms are the best known and close to the necessary conditions.

  • Rearrangeability of Wavelength-Space-Wavelength Switching Fabric Architecture for Elastic Optical Switches
    IEEE Access, 2019
    Co-Authors: Wojciech Kabaciński, Atyaf Al-tameemie, Remigiusz Rajewski
    Abstract:

    In this paper, we consider the necessary and sufficient rearrangeability conditions for the wavelength-space-wavelength switching fabric, called the WSW2 switching fabric, for elastic optical network nodes. We derive and prove the lower bound of the necessary conditions for such switching fabrics to be rearrangeable. We also show the upper bound of the sufficient conditions for the rearrangeability of the switching fabric with two input and two output switches. For Simultaneous Connection routing, we propose a routing algorithm that always ends with success in switching fabrics, which fulfill the sufficient conditions. Finally, we extend the proposed algorithm to the switching fabric with r input and r output switches, and we derive the conditions under which this routing algorithm always ends in success. The required number of center-stage switches is significantly lower than that in the strict-sense nonblocking switching fabrics. To our knowledge, the proposed routing algorithm is the first one which ends with success for any Connection set, within the provided sufficient conditions.