A hash table based flooding alternative for optical networks control plane

Orientadores: Helio Waldman, Moises Renato Nunes RibeiroDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de ComputaçãoResumo: A infra-estrutura de transporte da internet está movendo-se para um modelo formado por roteadores de alta velocidade interconectados por um núcleo de redes ópticas inteligentes. A tecnologia WDM (Wavelength Division Multiplex) já está consolidada como meio de incrementar a capacidade de transmissão nessas redes porém, existem poucas propostas de planos de controles distribuídos capazes de lidar dinamicamente com as restrições de Qualidade de Serviço (QoS - Quality of Service) em grandes redes. Neste contexto, informações sobre os estados dos enlaces são constantemente divulgadas pela rede e o mecanismo de inundação se tornou ineficiente para lidar com a disseminação das informações. Este trabalho propõe e analisa uma estrutura sobreposta baseada em tabelas de dispersão distribuídas (DHT - Distributed Hash Table) para dispor informações em um espaço virtual. Uma rede sobreposta virtual endereçada por conteúdo (CAN - Content Addressable Network), com enlaces de longa distância para obter características de mundo pequeno, é utilizada para possibilitar o roteamento com baixa ocupação dos enlaces sem penalizar demasiadamente o atraso inserido. Avaliações analíticas ilustram o ganho de desempenho em grandes redes.Abstract: The transport layer structure of the Internet is moving towards a model of highspeed routers interconnected by intelligent optical core networks. A consensus has been reached on wavelength division multiplexing (WDM) as the way to increase the transmission capacity. However there are few proposals for distributed control planes under dynamic Quality of Service (QoS) constraints for large networks. In this context, resources availability must be frequently distributed and updated across the network; and flooding may no longer be the best strategy for information dissemination. This work proposes and assesses an overlay structure based on distributed hash tables (DHT) for information indexing over bi-dimensional virtual coordinated spaces. By adding long-distance interconnections to Content-Addressable Networks (CAN), the resulting small-world effect can reduce the number of hops per resource search. Analytical results indicate significant reduction in management traffic over the physical layer of large networks without penalizing to much the inserted delay.MestradoTelecomunicações e TelemáticaMestre em Engenharia Elétric

Resource Allocation for Periodic Traffic Demands in WDM Networks

Recent research has clearly established that holding-time-aware routing and wavelength assignment (RWA) schemes lead to significant improvements in resource utilization for scheduled traffic. By exploiting the knowledge of the demand holding times, this thesis proposes new traffic grooming techniques to achieve more efficient resource utilization with the goal of minimizing resources such as bandwidth, wavelength channels, transceivers, and energy consumption. This thesis also introduces a new model, the segmented sliding window model, where a demand may be decomposed into two or more components and each component can be sent separately. This technique is suitable for applications where continuous data transmission is not strictly required such as large file transfers for grid computing. Integer linear program (ILP) formulations and an efficient heuristic are put forward for resource allocation under the proposed segmented sliding window model. It is shown that the proposed model can lead to significantly higher throughput, even over existing holding-time-aware models

Loss-free architectures in optical burst switched networks for a reliable and dynamic optical layer

For the last three decades, the optical fiber has been a quite systematic response to dimensioning issues in the Internet. Originally restricted to long haul networks, the optical network has gradually descended the network hierarchy to discard the bottlenecks. In the 90's, metropolitan networks became optical. Today, optical fibers are deployed in access networks and reach the users. In a near future, besides wireless access and local area networks, all networks in the network hierarchy may be made of fibers, in order to support current services (HDTV) and the emergence of new applications (3D-TV newly commercialized in USA). The deployment of such greedy applications will initiate an upward upgrade. The first step may be the Metropolitan Area Networks (MANs), not only because of the traffic growth, but also because of the variety of served applications, each with a specific traffic profile. The current optical layer is of mitigated efficiency, dealing with unforeseen events. The lack of reactivity is mainly due to the slow switching devices: any on-line decision of the optical layer is delayed by the configuration of the. devices. When the optical network has been extended in the MANs, a lot of efforts has been deployed to improve the reactivity of the optical layer. The Optical Circuit Switching paradigm (OCS) has been improved but it ultimately relies on off-line configuration of the optical devices. Optical Burst Switching (OBS) can be viewed as a highly flexible evolution of OCS, that operates five order of magnitude faster. Within this 'architecture, the loss-free guaranty can be abandoned in order to improve the reactivity of the optical layer. Indeed, reliability and reactivity appear as antagonists properties and getting closer to either of them mitigates the other. This thesis aims at proposing a solution to achieve reliable transmission over a dynamic optical layer. Focusing on OBS networks, our objective is to solve the contention issue without mitigating the reactivity. After the consideration of contention avoidance mechanisms with routing constraints similar as in OCS networks, we investigate the reactive solutions that intend to solve the contentions. None of the available contention resolution scheme can ensure the 100% efficiency that leads to loss-free transmission. An attractive solution is the recourse to electrical buffering, but it is notoriously disregarded because (1) it may highly impact the delays and (2) loss can occur due to buffer overflows. The efficiency of translucent architectures thus highly depends on the buffer availability, that can be improved by reducing the time spent in the buffers and the contention rate. We show that traffic grooming can highly reduce the emission delay, and consequently the buffer occupancy. In a first architecture, traffic grooming is enabled by a translucent core node architecture, capable to re-aggregate incoming bursts. The re-aggregation is mandatory to "de-groom" the bursts in the core network (i.e., to demultiplex the content of a burst). On the one hand, the re-aggregation highly reduces the loss probability, but on the other hand, it absorbs the benefits of traffic grooming. Finally, dynamic access to re-aggregation for contention resolution, despite the significant reduction of the contention rate, dramatically impacts the end-to-end delay and the memory requirement. We thus propose a second architecture, called CAROBS, that exploits traffic grooming in the optical domain. This framework is fully dynamic and can be used jointly with our translucent architecture that performs re-aggregation. As the (de)grooming operations do not involve re-aggregation, the translucent module can be restricted to contention resolution. As a result, the volume of data submitted to re-aggregation is drastically reduced and loss-free transmission can be reached with the same reactivity, end-to-end delay and memory requirement as a native OBS networ