Interdomain lightpath provisioning in wavelegth switched optical networks

Author(s)

Alisson Soares Limeira Pontes

• Document type: Master's Dissertation
• Press: Campinas, SP.
• Institution: Universidade Estadual de Campinas (UNICAMP). Instituto de Computação
• Defense date: 2015-08-27

Examining board members

Nelson Luis Saldanha da Fonseca; Helio Waldman; Edmundo Roberto Mauro Madeira

• Advisor: Nelson Luis Saldanha da Fonseca

Abstract

Despite advances in provisioning intra-domain lightpaths in Wavelength Division Multiplexing (WDM) networks, efficient schemes for path computation and advertisement of optical resources in multi-domain mesh networks have not yet been fully established. Because they are subject to scalability constraints, optical domains need simple and efficient schemes. Most of the solutions presented in the literature do not support traffic engineering and are based on periodic flooding of control messages. This work presents three proposals for provisioning lightpaths in multi-domain WDM networks based on the Path Computation Element (PCE) architecture. Proposals are formed by a schema for advertising information about network link state combined with domain chain computation and end-to-end route computation schemes. It is considered that the network optical switches do not perform wavelength conversion. Thus, the route computation is subject to the problem of wavelength continuity constraints. The proposals also present wavelength assignment policies that provide balance in the distribution of optical paths. The gains made in the use of the proposals submitted are evaluated through simulations using the WDMSim networks simulator. The effectiveness of the first proposal was compared to an implementation of the OBGP protocol using the WDMSim simulator. The blocking probability generated by OBGP was up to 13 percentage points higher than the blocking probability of the proposal 1, while the control overhead generated by OBGP was up to 5 orders of magnitude greater than that generated by the first proposal. The effectiveness of the second solution was compared to the first solution using the WDMSim. It was shown that the blocking probability generated by the first proposal was up to 10 times greater than the blocking probability of the second proposal. The control overhead generated by the proposal 2 was very low for all load values considered, while for the solution 1 overloading grows with load increasing. The performance of the third approach is evaluated considering different parameters. The simulations performed confirm that the growth of signaling overhead to achieve several PCEs in the updating process goes against the pontencial decrease of blocking due to instability caused in TEDs. Thus, considering the three solutions presented, the second was the more efficient in terms of blocking probability (AU)

• FAPESP's process: 10/03020-4 - Inter-domain Dynamic Traffic Grooming in Mesh WDM networks.
• Grantee: Alisson Soares Limeira Pontes
• Support Opportunities: Scholarships in Brazil - Master