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

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

  • Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
    Proceedings of International Conference on Parallel Processing, 1996
    Co-Authors: K.v. Anjan, T.m. Pinkston, J. Duato
    Abstract:

    This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-Recovery which relaxes the sequential Recovery Requirement for simultaneous Recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the Requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.

  • IPPS - Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
    Proceedings of International Conference on Parallel Processing, 1996
    Co-Authors: K.v. Anjan, T.m. Pinkston, J. Duato
    Abstract:

    This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-Recovery which relaxes the sequential Recovery Requirement for simultaneous Recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the Requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.

K.v. Anjan - One of the best experts on this subject based on the ideXlab platform.

  • Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
    Proceedings of International Conference on Parallel Processing, 1996
    Co-Authors: K.v. Anjan, T.m. Pinkston, J. Duato
    Abstract:

    This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-Recovery which relaxes the sequential Recovery Requirement for simultaneous Recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the Requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.

  • IPPS - Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
    Proceedings of International Conference on Parallel Processing, 1996
    Co-Authors: K.v. Anjan, T.m. Pinkston, J. Duato
    Abstract:

    This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-Recovery which relaxes the sequential Recovery Requirement for simultaneous Recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the Requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.

T.m. Pinkston - One of the best experts on this subject based on the ideXlab platform.

  • Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
    Proceedings of International Conference on Parallel Processing, 1996
    Co-Authors: K.v. Anjan, T.m. Pinkston, J. Duato
    Abstract:

    This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-Recovery which relaxes the sequential Recovery Requirement for simultaneous Recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the Requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.

  • IPPS - Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent
    Proceedings of International Conference on Parallel Processing, 1996
    Co-Authors: K.v. Anjan, T.m. Pinkston, J. Duato
    Abstract:

    This paper generalizes a theory for deadlock-free adaptive wormhole routing by considering a mixed set of resources: edge and central buffers. This generalized theory is then applied to a concurrent version of Disha deadlock-Recovery which relaxes the sequential Recovery Requirement for simultaneous Recovery from deadlocks. The proposed extension to Disha does not necessitate any additional resource cost; rather it serves to eliminate the Requirement of mutual exclusive access to the deadlock-free lane implemented by a Token. With this extension, Disha Concurrent remains applicable to any topology with a Hamiltonian path including k-ary n-cube networks and is also applicable to tree-based networks.

Piet Demeester - One of the best experts on this subject based on the ideXlab platform.

  • Fast failure Recovery for in-band OpenFlow networks
    2013 9th International Conference on the Design of Reliable Communication Networks (DRCN), 2013
    Co-Authors: Sachin Sharma, Dimitri Staessens, Didier Colle, Mario Pickavet, Piet Demeester
    Abstract:

    In OpenFlow, control and data plane are decoupled from switches/routers. Direct programming of routers/switches is realised from one or more servers (so called controllers). In the case of an in-band OpenFlow network, the control traffic (traffic to or from the controllers) is sent on the same channel used to transport data traffic. Therefore, when a failure occurs along the data traffic path, both control and data traffic can be affected. This paper explains how failure Recovery can be deployed in such a network. To achieve carrier-grade quality, the network should be able to recover from the failure within 50 ms. We apply two well-known Recovery mechanisms-restoration and protection- for the control and the data traffic, and run extensive emulation experiments. The emulation results show that restoration does not allow to recover within 50 ms. Moreover, the restoration of the control traffic delays the restoration of the data traffic. The emulation results also show that protection for both control and data traffic can meet the carrier-grade Recovery Requirement, even in a large-scale network serving many flows.

  • DRCN - Fast failure Recovery for in-band OpenFlow networks
    2013
    Co-Authors: Sachin Sharma, Dimitri Staessens, Didier Colle, Mario Pickavet, Piet Demeester
    Abstract:

    In OpenFlow, control and data plane are decoupled from switches/routers. Direct programming of routers/switches is realised from one or more servers (so called controllers). In the case of an in-band OpenFlow network, the control traffic (traffic to or from the controllers) is sent on the same channel used to transport data traffic. Therefore, when a failure occurs along the data traffic path, both control and data traffic can be affected. This paper explains how failure Recovery can be deployed in such a network. To achieve carrier-grade quality, the network should be able to recover from the failure within 50 ms. We apply two well-known Recovery mechanisms-restoration and protection- for the control and the data traffic, and run extensive emulation experiments. The emulation results show that restoration does not allow to recover within 50 ms. Moreover, the restoration of the control traffic delays the restoration of the data traffic. The emulation results also show that protection for both control and data traffic can meet the carrier-grade Recovery Requirement, even in a large-scale network serving many flows.

Hyunseung Choo - One of the best experts on this subject based on the ideXlab platform.

  • Rapid Recovery from link failures in software-defined networks
    Journal of Communications and Networks, 2017
    Co-Authors: Pankaj Thorat, S. M. Raza, Hyunseung Choo
    Abstract:

    Carrier-grade networks (CGNs) can leverage the network programmability of software-defined networking (SDN) to ensure fast Recovery and high availability. However, for the successful adoption of SDN, the failure Recovery Requirement must be addressed. Local detouring is a popular approach for faster Recovery rather than path-based end-to-end Recovery. For fast local Recovery, alternate paths must be preinstalled for each individual flow on the link, which in some cases results in storing thousands of alternate path flow rules. Furthermore, the dependence on the controller for dynamic per-flow detouring may delay the Recovery. In this paper, we propose local immediate (LIm) and immediate controller dependent (ICoD) Recovery mechanisms to address the limitations of OpenFlow-based link Recovery approaches. Our proposed mechanisms considerably reduce the alternate path flow rules by aggregating the disrupted flows using virtual local area network (VLAN) tagging. The proposed algorithms achieve Recovery within 3 ms and 20 ms, respectively and satisfy the strict 50 ms Recovery Requirement of CGNs. LIm and ICoD also reduce the alternate path flow storage Requirement by up to 99%. Simulation results reveal that the flow-aggregation also reduces the effort of the controller and minimizes the alternate path installation traffic.

  • Pre-provisioning of local protection for handling dual-failures in OpenFlow-based networks
    2017 13th International Conference on Network and Service Management (CNSM), 2017
    Co-Authors: Pankaj Thorat, S. M. Raza, Seil Jeon, Hyunseung Choo
    Abstract:

    An essential Requirement in operating a carriergrade network (CGN) is ensuring the high availability and reliability. Software-defined networking (SDN) is expected to address such Requirement while improving the network management. One challenging issue faced in the process of enhancing the reliability of SDN-enabled CGN is how to achieve rapid Recovery with minimal effort. There are two well-known approaches to determine the failover scope: end-to-end (global) detouring and local detouring. Particularly, the local detouring approach provides an efficient means to achieve faster Recovery, as it locally detours the disrupted flows around the failed network components using a preconfigured alternative path. However, it requires thousands of flow entries per switch to be configured. To address the technical challenges, we propose a fault-tolerant forwarding table design (FFTD), which groups the flows using group entries and aggregates the flows using a tagging mechanism for scalable and rapid Recovery from the dual-failures of switches or links without overburdening the controller and the flow table's memory. Our extensive emulation results reveal that the proposed FFTD satisfies the CGN's 50 ms Recovery Requirement. Additionally, it reduces the alternate path flow storage Requirement by up to 99%.

  • proactive failure Recovery scheme for data traffic in software defined networks
    2016 IEEE NetSoft Conference and Workshops (NetSoft), 2016
    Co-Authors: Pankaj Thorat, S. M. Raza, Rajesh Challa, Hyunseung Choo
    Abstract:

    Software-defined networking (SDN) is under consideration for deployment of carrier-grade networks (CGN). SDN must meet the critical network reliability Requirement without incurring high complexity and network resource usage. Local detouring of disrupted flows from the failed network component to a preconfigured alternative path enables rapid Recovery. Preconfigured alternate paths reduce the Recovery time, however, result in storing thousands of flow entries per switch. Furthermore, the reliance on the controller for per-flow detouring would overwhelm the controller and increases the Recovery time. To address these issues, we propose a proactive Recovery scheme to repair an OpenFlow-based network from a node or a link failure without overburdening the controller and the flow tables memory. The proactive scheme aggregates the disrupted flows using virtual Local area network (VLAN) tagging to conserve the flow table memory Requirement. A fast failover (FF) feature of OpenFlow is used to perform rapid local detouring. Our extensive simulation results reveal that the proposed scheme achieves the Recovery around 4 ms and satisfies the CGN's 50 ms Recovery Requirement. Additionally, the proactive Recovery scheme reduces the alternate path flow storage Requirement by up to 99%.