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

Jason P. Jue - One of the best experts on this subject based on the ideXlab platform.

  • Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks
    Journal of Optical Communications and Networking, 2014
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    In a network in which multiple domains are defined due to geographical and/or administrative reasons, only a limited amount of domain information is exchanged by domain service providers. Topology aggregation is a method used to facilitate this limited information exchange. The amount of information provided for each domain may vary based on the technical and management decisions taken by the service provider. For instance, some domains may choose to provide only a single shortest path between two border nodes, while another may be able to provide a pair of disjoint paths with Minimum Total Cost. In such cases, end-to-end protected path routing needs to facilitate and use different amounts of domain information provided by domain service providers in order to find the best solution. In this work, we propose several approaches that help find a pair of disjoint end-to-end paths that may traverse multiple domains from source to destination and result in Minimum Total Cost. These approaches include methods for inter-domain information exchange that carry Costs of disjoint paths within a domain. The performance of minimizing the Total Cost of a pair of end-to-end paths is investigated. Finally, the blocking probabilities of these various approaches due to the existence of trap topologies in the network are also discussed.

  • Domain-disjoint routing based on topology aggregation for survivable multidomain optical networks
    Journal of Optical Communications and Networking, 2013
    Co-Authors: Chengyi Gao, M. M. Hasan, Jason P. Jue
    Abstract:

    In a multidomain network, topology aggregation (TA) may be adopted to provide limited information regarding intradomain connectivity without revealing detailed topology information. If the TA information does not include details on the mapping of aggregated links in the TA over the physical topology, then physical disjointness cannot be guaranteed in the case in which two interdomain paths traverse the same domain through different aggregated links. Thus, in order to provide survivability over multiple domains, it may be necessary to find two domain-disjoint paths in the multidomain network. In this paper, we propose an algorithm for finding domain-disjoint working and backup paths for a multidomain connection request. The algorithm modifies the original multidomain network topology by adding cyclic structures that enable the direct application of Bhandari's algorithm to find a pair of diverse paths with Minimum Total Cost over the modified topology. We give detailed analysis of various scenarios that may occur during the routing procedure, and the corresponding performance of our approach in these scenarios. We show that our approach can achieve good performance in finding domain-disjoint paths with Minimum Total Cost.

  • Survivable inter-domain routing with Suurballe-based intra-domain disjointness information in multi-domain optical networks
    Optical Fiber Communication Conference, 2012
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    We propose an algorithm to find a pair of disjoint inter-domain paths with Minimum Total Cost based on a matrix for each domain that includes information generated by Suurballe's algorithm between the intra-domain aggregated links.

  • GLOBECOM - Survivable inter-domain routing based on topology aggregation with disjointness information in multi-domain optical networks
    2012 IEEE Global Communications Conference (GLOBECOM), 2012
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    In a multi-domain network, domains can be defined geographically or administratively. Since only a limited amount of information of each domain is allowed to be broadcasted by domain service providers, Topology Aggregation (TA) is usually adopted. The amount of information provided by each domain may vary based on the service provider. For instance, some domains may provide only a single shortest path between two border nodes, while others may be capable of providing a pair of disjoint paths with Minimum Total Cost. In this case, inter-domain path routing with protection needs to consider and utilize the different levels of information provided by different domains in order to find the best solution. In this paper, we propose two approaches that find a pair of disjoint inter-domain paths with Minimum Total Cost based on a matrix for each domain that includes disjointness information between the aggregated links inside the domain.

Chengyi Gao - One of the best experts on this subject based on the ideXlab platform.

  • Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks
    Journal of Optical Communications and Networking, 2014
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    In a network in which multiple domains are defined due to geographical and/or administrative reasons, only a limited amount of domain information is exchanged by domain service providers. Topology aggregation is a method used to facilitate this limited information exchange. The amount of information provided for each domain may vary based on the technical and management decisions taken by the service provider. For instance, some domains may choose to provide only a single shortest path between two border nodes, while another may be able to provide a pair of disjoint paths with Minimum Total Cost. In such cases, end-to-end protected path routing needs to facilitate and use different amounts of domain information provided by domain service providers in order to find the best solution. In this work, we propose several approaches that help find a pair of disjoint end-to-end paths that may traverse multiple domains from source to destination and result in Minimum Total Cost. These approaches include methods for inter-domain information exchange that carry Costs of disjoint paths within a domain. The performance of minimizing the Total Cost of a pair of end-to-end paths is investigated. Finally, the blocking probabilities of these various approaches due to the existence of trap topologies in the network are also discussed.

  • Domain-disjoint routing based on topology aggregation for survivable multidomain optical networks
    Journal of Optical Communications and Networking, 2013
    Co-Authors: Chengyi Gao, M. M. Hasan, Jason P. Jue
    Abstract:

    In a multidomain network, topology aggregation (TA) may be adopted to provide limited information regarding intradomain connectivity without revealing detailed topology information. If the TA information does not include details on the mapping of aggregated links in the TA over the physical topology, then physical disjointness cannot be guaranteed in the case in which two interdomain paths traverse the same domain through different aggregated links. Thus, in order to provide survivability over multiple domains, it may be necessary to find two domain-disjoint paths in the multidomain network. In this paper, we propose an algorithm for finding domain-disjoint working and backup paths for a multidomain connection request. The algorithm modifies the original multidomain network topology by adding cyclic structures that enable the direct application of Bhandari's algorithm to find a pair of diverse paths with Minimum Total Cost over the modified topology. We give detailed analysis of various scenarios that may occur during the routing procedure, and the corresponding performance of our approach in these scenarios. We show that our approach can achieve good performance in finding domain-disjoint paths with Minimum Total Cost.

  • Survivable inter-domain routing with Suurballe-based intra-domain disjointness information in multi-domain optical networks
    Optical Fiber Communication Conference, 2012
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    We propose an algorithm to find a pair of disjoint inter-domain paths with Minimum Total Cost based on a matrix for each domain that includes information generated by Suurballe's algorithm between the intra-domain aggregated links.

  • GLOBECOM - Survivable inter-domain routing based on topology aggregation with disjointness information in multi-domain optical networks
    2012 IEEE Global Communications Conference (GLOBECOM), 2012
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    In a multi-domain network, domains can be defined geographically or administratively. Since only a limited amount of information of each domain is allowed to be broadcasted by domain service providers, Topology Aggregation (TA) is usually adopted. The amount of information provided by each domain may vary based on the service provider. For instance, some domains may provide only a single shortest path between two border nodes, while others may be capable of providing a pair of disjoint paths with Minimum Total Cost. In this case, inter-domain path routing with protection needs to consider and utilize the different levels of information provided by different domains in order to find the best solution. In this paper, we propose two approaches that find a pair of disjoint inter-domain paths with Minimum Total Cost based on a matrix for each domain that includes disjointness information between the aggregated links inside the domain.

Frédéric Semet - One of the best experts on this subject based on the ideXlab platform.

Dongxing-ye - One of the best experts on this subject based on the ideXlab platform.

Hakki C. Cankaya - One of the best experts on this subject based on the ideXlab platform.

  • Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks
    Journal of Optical Communications and Networking, 2014
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    In a network in which multiple domains are defined due to geographical and/or administrative reasons, only a limited amount of domain information is exchanged by domain service providers. Topology aggregation is a method used to facilitate this limited information exchange. The amount of information provided for each domain may vary based on the technical and management decisions taken by the service provider. For instance, some domains may choose to provide only a single shortest path between two border nodes, while another may be able to provide a pair of disjoint paths with Minimum Total Cost. In such cases, end-to-end protected path routing needs to facilitate and use different amounts of domain information provided by domain service providers in order to find the best solution. In this work, we propose several approaches that help find a pair of disjoint end-to-end paths that may traverse multiple domains from source to destination and result in Minimum Total Cost. These approaches include methods for inter-domain information exchange that carry Costs of disjoint paths within a domain. The performance of minimizing the Total Cost of a pair of end-to-end paths is investigated. Finally, the blocking probabilities of these various approaches due to the existence of trap topologies in the network are also discussed.

  • Survivable inter-domain routing with Suurballe-based intra-domain disjointness information in multi-domain optical networks
    Optical Fiber Communication Conference, 2012
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    We propose an algorithm to find a pair of disjoint inter-domain paths with Minimum Total Cost based on a matrix for each domain that includes information generated by Suurballe's algorithm between the intra-domain aggregated links.

  • GLOBECOM - Survivable inter-domain routing based on topology aggregation with disjointness information in multi-domain optical networks
    2012 IEEE Global Communications Conference (GLOBECOM), 2012
    Co-Authors: Chengyi Gao, Hakki C. Cankaya, Jason P. Jue
    Abstract:

    In a multi-domain network, domains can be defined geographically or administratively. Since only a limited amount of information of each domain is allowed to be broadcasted by domain service providers, Topology Aggregation (TA) is usually adopted. The amount of information provided by each domain may vary based on the service provider. For instance, some domains may provide only a single shortest path between two border nodes, while others may be capable of providing a pair of disjoint paths with Minimum Total Cost. In this case, inter-domain path routing with protection needs to consider and utilize the different levels of information provided by different domains in order to find the best solution. In this paper, we propose two approaches that find a pair of disjoint inter-domain paths with Minimum Total Cost based on a matrix for each domain that includes disjointness information between the aggregated links inside the domain.