27 research outputs found

    Optical Network as a Service for Service Function Chaining across Datacenters

    Get PDF
    We present the SPN OS, a Network-as-a-Service orchestration platform for NFV/SDN integrated service provisioning across multiple datacenters over packet/optical networks. Our prototype showcases template-driven service function chaining and high-level network programming-based optical networking. We present the SPN OS, a Network-as-a-Service orchestration platform for NFV/SDN integrated service provisioning across multiple datacenters over packet/optical networks. Our prototype showcases template-driven service function chaining and high-level network programming-based optical networking

    Efficient PCE-Based Survivable Path Computation in Multi-Domain Networks

    Get PDF
    Abstract-We consider the problem of finding end-toend shortest disjoint paths for a given sequence of domains in multi-domain networks. A Path Computation Element (PCE) serves as a computing entity in each domain, specializing in path computation and optimization. We propose a novel PCE-based scheme that computes the shortest path over multiple domains in the forward direction and computes the disjoint path in the backward direction. The proposed scheme has linear-time computation and message overhead in regard to the number of border nodes. Simulation results show that our proposed scheme can result in an optimal solution, while significantly reducing computation time compared to existing algorithms

    High-Cardinality Hybrid Shaping for 4D Modulation Formats in Optical Communications Optimized via End-to-End Learning

    Get PDF
    In this paper we carry out a joint optimization of probabilistic (PS) and geometric shaping (GS) for four-dimensional (4D) modulation formats in long-haul coherent wavelength division multiplexed (WDM) optical fiber communications using an auto-encoder framework. We propose a 4D 10 bits/symbol constellation which we obtained via end-to-end deep learning over the split-step Fourier model of the fiber channel. The constellation achieved 13.6% reach increase at a data rate of approximately 400 Gbits/second in comparison to the ubiquitously employed polarization multiplexed 32-QAM format at a forward error correction overhead of 20%.Comment: 5 pages, 3 figure

    Software-Programmed Optical Networking with Integrated NFV Service Provisioning

    Get PDF
    We showcase demonstrations of “program & compile” styled optical networking as well as open platforms & standards based NFV service provisioning using a proof-of-concept implementation of the Software-Programmed Networking Operating System (SPN OS). We showcase demonstrations of “program & compile” styled optical networking as well as open platforms & standards based NFV service provisioning using a proof-of-concept implementation of the Software-Programmed Networking Operating System (SPN OS)

    Heuristic and optimal techniques for light-trail assignment in optical ring WDM networks

    No full text
    In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1−4,7,10] to WDM ring networks to facilitate IP centric dynamic communication at the optical layer. A light-trail is a generalization of a lightpath such that multiple nodes can take part in communication along the path without the need for optical switching. A light-trail represents an opportunistic medium in which multiple spatially distributed sub-lambda flows can be groomed despite without the need for optical switching. A light-trail is analogous to an optical bus such that multiple connections between source–destination pairs can be provisioned under the constraint that no two connections have overlapping time-intervals. This enables traffic grooming at the optical layer. In this paper we first describe a constrained optimization procedure for assigning light-trails in WDM ring networks. We then show five heuristic algorithms that solve the light-trail assignment problem in polynomial time. The heuristic algorithms are based on dynamic (unknown traffic) and static (known traffic) approaches. A simulation study compares the performance of ILP and heuristic algorithms.© Elsevie

    Implementation of Burstponder Card for Ethernet Grooming in Light-trail WDM Networks

    No full text
    A light-trail is a generalization of a lightpath such that multiple nodes can take part in communication along the path. A light-trail is a good candidate for optical layer traffic grooming. In this paper we investigate the grooming aspect of light-trails from a sub-system perspective. We introduce a new sub-system called burstponder card that enables efficient grooming of traffic in a light-trail. We describe the implementation of the burstponder card using FPGA and burst-mode optics. We show experiment results on efficiency and latency for a 4-node light-trail network demonstrating it as an effective solution for optical grooming.© IEE
    corecore