Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 14
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Survivable IP/MPLS-Over-WSON multilayer network optimization

  • Ruiz Ramírez, Marc|||0000-0001-6429-6347
  • Pedrola Escribà, Òscar
  • Velasco Esteban, Luis Domingo|||0000-0002-7345-296X
  • Careglio, Davide|||0000-0002-7931-8147
  • Fernández Palacios, Juan Pedro
  • Junyent Giralt, Gabriel|||0000-0003-0059-7700
Network operators are facing the problem of dimensioning their networks for the expected huge IP traffic volumes while keeping constant or even reducing the connectivity prices. Therefore, new architectural solutions able to cope with the expected traffic increase in a more cost-effective way are needed. In this work, we study the survivable IP/multi-protocol label switching (MPLS) over wavelength switched optical network (WSON) multilayer network problem as a capital expenditure (CAPEX) minimization problem. Two network approaches providing survivability against optical links, IP/MPLS nodes, and opto-electronic port failures are compared: the classical overlay approach where two redundant IP/MPLS networks are deployed, and the new joint multilayer approach which provides the requested survivability through an orchestrated interlayer recovery scheme which minimizes the over-dimensioning of IP/MPLS nodes. Mathematical programming models are developed for both approaches. Solving these models, however, becomes impractical for realistic networks. In view of this, evolutionary heuristics based on the biased random-key genetic algorithm framework are also proposed. Exhaustive experiments on several reference network scenarios illustrate the effectiveness of the proposed approach in minimizing network CAPEX., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

RRPD strategies for a T-OBS network architecture

  • Pedrola Escribà, Òscar
  • Careglio, Davide|||0000-0002-7931-8147
  • Klinkowski, Miroslaw
  • Solé Pareta, Josep|||0000-0002-9411-6308
In this paper, we deal with the physical layer impairments (PLIs) in optical burst switching (OBS). In particular we present a formulation of the routing and regenerator placement and dimensioning (RRPD) problem for a feasible translucent OBS (T-OBS) network architecture. Since addressing the joint RRPD problem results in an extremely complex undertaking, we decouple the problem, and hence, we eventually provide formal models to solve routing and RPD separately in the socalled R+RPD problem. Thus, making use of mixed integer linear programming (MILP) formulations, we first address the routing problem with the aim of minimizing congestion in bottleneck network links, and second, we tackle the issue of performing a sparse placement of electrical regenerators in the network. Since the RPD formulation requires high computational effort for large problem instances, we also propose two alternative heuristic strategies that provide good near-optimal solutions within reasonable time limits. To be precise, we evaluate the trade-off between optimality and complexity provided by these methods. Finally, we conduct a series of simulation experiments on the T-OBS network that prove that the R+RPD strategies effectively deal with burst losses caused by the impact of PLIs, and therefore, ensure that the overall T-OBS network performance remains unaffected.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Modeling the routing and spectrum allocation problem for flexgrid optical networks

  • Velasco Esteban, Luis Domingo|||0000-0002-7345-296X
  • Klinkowski, Miroslaw
  • Ruiz Ramírez, Marc|||0000-0001-6429-6347
  • Comellas Colomé, Jaume|||0000-0002-9129-0562
Flexgrid optical networks are attracting huge interest due to their higher spectrum efficiency and flexibility in comparison with traditional wavelength switched optical networks based on the wavelength division multiplexing technology. To properly analyze, design, plan, and operate flexible and elastic networks, efficient methods are required for the routing and spectrum allocation (RSA) problem. Specifically, the allocated spectral resources must be, in absence of spectrum converters, the same along the links in the route (the continuity constraint) and contiguous in the spectrum (the contiguity constraint). In light of the fact that the contiguity constraint adds huge complexity to the RSA problem,we introduce the concept of channels for the representation of contiguous spectral resources. In this paper, we show that the use of a pre-computed set of channels allows considerably reducing the problem complexity. In our study, we address an off-line RSA problem in which enough spectrum needs to be allocated for each demand of a given traffic matrix. To this end, we present novel integer lineal programming (ILP) formulations of RSA that are based on the assignment of channels. The evaluation results reveal that the proposed approach allows solving the RSA problem much more efficiently than previously proposed ILP-based methods and it can be applied even for realistic problem instances, contrary to previous ILP formulations.
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Service and resource differentiation in shared-path protection environments to maximize network operator's revenues

  • Velasco Esteban, Luis Domingo|||0000-0002-7345-296X
  • Ruiz Ramírez, Marc|||0000-0001-6429-6347
  • Perelló Muntan, Jordi|||0000-0001-6563-2664
  • Spadaro, Salvatore|||0000-0002-4100-1726
  • Comellas Colomé, Jaume|||0000-0002-9129-0562
Network operators are facing hard competition for opportunities in the telecommunications market, forcing network investments to be carefully evaluated before the decision-making process. A great part of core network operators’ revenues comes from the provisioned connectivity services. Taking this premise as our starting point, we first examine the provisioning of differentiated services in current shared-path protection (SPP) environments. This analysis reveals that current resource assignment policies are only able to provide a very poor grade of service to the supported best-effort traffic. Aiming to improve this performance, a novel resource partitioning scheme called diff-WS is proposed, which differentiates those wavelengths supporting each class of service in the network. As a major goal of this paper, the benefits of diff-WS over current resource assignment policies are assessed from an economic perspective. For this purpose, the network operator revenues maximization (NORMA) problem is presented to design the optical network such that the operator’s revenues are maximized. To solve NORMA, we derive statistical models to obtain, given a certain grade of service, the highest traffic intensity for each class of service and resource partitioning scheme. These models turn NORMA into a nonlinear problem, which is finally addressed as an iterative approach, solving an integer linear programming (ILP) subproblem at each iteration. The obtained numerical results on several network topologies illustrate that diff-WS maximizes resource utilization in the network and, thus, the network operator’s profit.
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Designing national IP/MPLS networks with flexgrid optical technology

  • Velasco Esteban, Luis Domingo|||0000-0002-7345-296X
  • Wright, Paul
  • Lord, Andrew
  • Junyent Giralt, Gabriel|||0000-0003-0059-7700
We propose a two-step procedure to design flexgrid-based national networks. Locations are first partitioned into a set of metro areas interconnected through a flexgrid optical network. Next, each network is designed separately. Optimal results show a future large (>200 nodes) flexgrid core network inter-connecting small (~10 nodes) metro regions., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks

  • Pedrola Escribà, Òscar
  • Careglio, Davide|||0000-0002-7931-8147
  • Klinkowski, Miroslaw
  • Velasco Esteban, Luis Domingo|||0000-0002-7345-296X
  • Bergman, K.
  • Solé Pareta, Josep|||0000-0002-9411-6308
Physical layer impairments severely limit the reach and capacity of optical systems, thereby hampering the deployment of transparent optical networks (i.e., no electrical signal regenerators are required). Besides, the high cost and power-consumption of regeneration devices makes it unaffordable for network operators to consider the opaque architecture (i.e., regeneration is available at every network node). In this context, translucent architectures (i.e., regeneration is only available at selected nodes) have emerged as the most promising short term solution to decrease costs and energy consumption in optical backbone networks. Concurrently, the coarse granularity and inflexibility of legacy optical technologies have re-fostered great interest in sub-wavelength switching optical networks, which introduce optical switching in the time domain so as to further improve resources utilization. In these networks, the complex regenerator placement and dimensioning problem emerges. In short, this problem aims at minimizing the number of electrical regenerators deployed in the network. To tackle it, in this paper both a greedy randomized adaptive search procedure and a biased random-key genetic algorithm are developed. Further, we enhance their performance by introducing both path-relinking and variable neighborhood descent as effective intensification procedures. The resulting hybridizations are compared among each other as well as against results from optimal and heuristic mixed integer linear programming formulations. Illustrative results over a broad range of network scenarios show that the biased random-key genetic algorithm working in conjunction with these two intensification mechanisms represents a compelling network planning algorithm for the design of future sub-wavelength optical networks., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

  • Pedrola Escribà, Òscar
  • Ruiz Ramírez, Marc|||0000-0001-6429-6347
  • Velasco Esteban, Luis Domingo|||0000-0002-7345-296X
  • Careglio, Davide|||0000-0002-7931-8147
  • González de Dios, Óscar
  • Comellas Colomé, Jaume|||0000-0002-9129-0562
In this paper we deal with the survivable internet protocol (IP)/multi-protocol label switching (MPLS)-over-wavelength switched optical network (WSON) multi-layer network optimization problem (SIMNO). This problem entails planning an IP/MPLS network layer over a photonic mesh infrastructure whilst, at the same time, ensuring the highest availability of services and minimizing the capital expenditures (CAPEX) investments. Such a problem is currently identified as an open issue among network operators, and hence, its solution is of great interest. To tackle SIMNO, we first provide an integer linear programming (ILP) formulation which provides an insight into the complexity of its managing. Then, a greedy randomized adaptive search procedure (GRASP) with path-relinking (PR) together with a biased random-key genetic algorithm (BRKGA) are specifically developed to help solve the problem. The performance of both heuristics is exhaustively tested and compared making use of various network and traffic instances. Numerical experiments show the benefits of using GRASP instead of BRKGA when dealing with highly complex network scenarios. Moreover, we verified that the use of GRASP with PR remarkably improves the basic GRASP algorithm, particularly in real-sized, complex scenarios such as those proposed in this paper., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

RRPD strategies for a T-OBS network architecture

  • Pedrola Escribà, Òscar
  • Careglio, Davide
  • Klinkowski, Miroslaw
  • Solé Pareta, Josep
In this paper, we deal with the physical layer impairments (PLIs) in optical burst switching (OBS). In particular we present a formulation of the routing and regenerator placement and dimensioning (RRPD) problem for a feasible translucent OBS (T-OBS) network architecture. Since addressing the joint RRPD problem results in an extremely complex undertaking, we decouple the problem, and hence, we eventually provide formal models to solve routing and RPD separately in the socalled R+RPD problem. Thus, making use of mixed integer linear programming (MILP) formulations, we first address the routing problem with the aim of minimizing congestion in bottleneck network links, and second, we tackle the issue of performing a sparse placement of electrical regenerators in the network. Since the RPD formulation requires high computational effort for large problem instances, we also propose two alternative heuristic strategies that provide good near-optimal solutions within reasonable time limits. To be precise, we evaluate the trade-off between optimality and complexity provided by these methods. Finally, we conduct a series of simulation experiments on the T-OBS network that prove that the R+RPD strategies effectively deal with burst losses caused by the impact of PLIs, and therefore, ensure that the overall T-OBS network performance remains unaffected., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Survivable IP/MPLS-Over-WSON multilayer network optimization

  • Ruiz Ramírez, Marc
  • Pedrola Escribà, Òscar
  • Velasco Esteban, Luis Domingo
  • Careglio, Davide
  • Fernández Palacios, Juan Pedro
  • Junyent Giralt, Gabriel
Network operators are facing the problem of dimensioning their networks for the expected huge IP traffic volumes while keeping constant or even reducing the connectivity prices. Therefore, new architectural solutions able to cope with the expected traffic increase in a more cost-effective way are needed. In this work, we study the survivable IP/multi-protocol label switching (MPLS) over wavelength switched optical network (WSON) multilayer network problem as a capital expenditure (CAPEX) minimization problem. Two network approaches providing survivability against optical links, IP/MPLS nodes, and opto-electronic port failures are compared: the classical overlay approach where two redundant IP/MPLS networks are deployed, and the new joint multilayer approach which provides the requested survivability through an orchestrated interlayer recovery scheme which minimizes the over-dimensioning of IP/MPLS nodes. Mathematical programming models are developed for both approaches. Solving these models, however, becomes impractical for realistic networks. In view of this, evolutionary heuristics based on the biased random-key genetic algorithm framework are also proposed. Exhaustive experiments on several reference network scenarios illustrate the effectiveness of the proposed approach in minimizing network CAPEX., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks

  • Pedrola Escribà, Òscar
  • Careglio, Davide
  • Klinkowski, Miroslaw
  • Velasco Esteban, Luis Domingo
  • Bergman, K.
  • Solé Pareta, Josep
Physical layer impairments severely limit the reach and capacity of optical systems, thereby hampering the deployment of transparent optical networks (i.e., no electrical signal regenerators are required). Besides, the high cost and power-consumption of regeneration devices makes it unaffordable for network operators to consider the opaque architecture (i.e., regeneration is available at every network node). In this context, translucent architectures (i.e., regeneration is only available at selected nodes) have emerged as the most promising short term solution to decrease costs and energy consumption in optical backbone networks. Concurrently, the coarse granularity and inflexibility of legacy optical technologies have re-fostered great interest in sub-wavelength switching optical networks, which introduce optical switching in the time domain so as to further improve resources utilization. In these networks, the complex regenerator placement and dimensioning problem emerges. In short, this problem aims at minimizing the number of electrical regenerators deployed in the network. To tackle it, in this paper both a greedy randomized adaptive search procedure and a biased random-key genetic algorithm are developed. Further, we enhance their performance by introducing both path-relinking and variable neighborhood descent as effective intensification procedures. The resulting hybridizations are compared among each other as well as against results from optimal and heuristic mixed integer linear programming formulations. Illustrative results over a broad range of network scenarios show that the biased random-key genetic algorithm working in conjunction with these two intensification mechanisms represents a compelling network planning algorithm for the design of future sub-wavelength optical networks., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

  • Pedrola Escribà, Òscar
  • Ruiz Ramírez, Marc
  • Velasco Esteban, Luis Domingo
  • Careglio, Davide
  • González de Dios, Óscar
  • Comellas Colomé, Jaume
In this paper we deal with the survivable internet protocol (IP)/multi-protocol label switching (MPLS)-over-wavelength switched optical network (WSON) multi-layer network optimization problem (SIMNO). This problem entails planning an IP/MPLS network layer over a photonic mesh infrastructure whilst, at the same time, ensuring the highest availability of services and minimizing the capital expenditures (CAPEX) investments. Such a problem is currently identified as an open issue among network operators, and hence, its solution is of great interest. To tackle SIMNO, we first provide an integer linear programming (ILP) formulation which provides an insight into the complexity of its managing. Then, a greedy randomized adaptive search procedure (GRASP) with path-relinking (PR) together with a biased random-key genetic algorithm (BRKGA) are specifically developed to help solve the problem. The performance of both heuristics is exhaustively tested and compared making use of various network and traffic instances. Numerical experiments show the benefits of using GRASP instead of BRKGA when dealing with highly complex network scenarios. Moreover, we verified that the use of GRASP with PR remarkably improves the basic GRASP algorithm, particularly in real-sized, complex scenarios such as those proposed in this paper., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Service and resource differentiation in shared-path protection environments to maximize network operator's revenues

  • Velasco Esteban, Luis Domingo
  • Ruiz Ramírez, Marc
  • Perelló Muntan, Jordi
  • Spadaro, Salvatore
  • Comellas Colomé, Jaume
Network operators are facing hard competition for opportunities in the telecommunications market, forcing network investments to be carefully evaluated before the decision-making process. A great part of core network operators’ revenues comes from the provisioned connectivity services. Taking this premise as our starting point, we first examine the provisioning of differentiated services in current shared-path protection (SPP) environments. This analysis reveals that current resource assignment policies are only able to provide a very poor grade of service to the supported best-effort traffic. Aiming to improve this performance, a novel resource partitioning scheme called diff-WS is proposed, which differentiates those wavelengths supporting each class of service in the network. As a major goal of this paper, the benefits of diff-WS over current resource assignment policies are assessed from an economic perspective. For this purpose, the network operator revenues maximization (NORMA) problem is presented to design the optical network such that the operator’s revenues are maximized. To solve NORMA, we derive statistical models to obtain, given a certain grade of service, the highest traffic intensity for each class of service and resource partitioning scheme. These models turn NORMA into a nonlinear problem, which is finally addressed as an iterative approach, solving an integer linear programming (ILP) subproblem at each iteration. The obtained numerical results on several network topologies illustrate that diff-WS maximizes resource utilization in the network and, thus, the network operator’s profit., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Modeling the routing and spectrum allocation problem for flexgrid optical networks

  • Velasco Esteban, Luis Domingo
  • Klinkowski, Miroslaw
  • Ruiz Ramírez, Marc
  • Comellas Colomé, Jaume
Flexgrid optical networks are attracting huge interest due to their higher spectrum efficiency and flexibility in comparison with traditional wavelength switched optical networks based on the wavelength division multiplexing technology. To properly analyze, design, plan, and operate flexible and elastic networks, efficient methods are required for the routing and spectrum allocation (RSA) problem. Specifically, the allocated spectral resources must be, in absence of spectrum converters, the same along the links in the route (the continuity constraint) and contiguous in the spectrum (the contiguity constraint). In light of the fact that the contiguity constraint adds huge complexity to the RSA problem,we introduce the concept of channels for the representation of contiguous spectral resources. In this paper, we show that the use of a pre-computed set of channels allows considerably reducing the problem complexity. In our study, we address an off-line RSA problem in which enough spectrum needs to be allocated for each demand of a given traffic matrix. To this end, we present novel integer lineal programming (ILP) formulations of RSA that are based on the assignment of channels. The evaluation results reveal that the proposed approach allows solving the RSA problem much more efficiently than previously proposed ILP-based methods and it can be applied even for realistic problem instances, contrary to previous ILP formulations., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Designing national IP/MPLS networks with flexgrid optical technology

  • Velasco Esteban, Luis Domingo
  • Wright, Paul
  • Lord, Andrew
  • Junyent Giralt, Gabriel
We propose a two-step procedure to design flexgrid-based national networks. Locations are first partitioned into a set of metro areas interconnected through a flexgrid optical network. Next, each network is designed separately. Optimal results show a future large (>200 nodes) flexgrid core network inter-connecting small (~10 nodes) metro regions., Peer Reviewed, Postprint (published version)