Optimized Design of Survivable MPLS over Optical Transport Networks. Optical Switching and Networking

In this paper we study different options for the survivability implementation in MPLS over Optical Transport Networks in terms of network resource usage and configuration cost. We investigate two approaches to the survivability deployment: single layer and multilayer survivability and present various methods for spare capacity allocation (SCA) to reroute disrupted traffic. The comparative analysis shows the influence of the traffic granularity on the survivability cost: for high bandwidth LSPs, close to the optical channel capacity, the multilayer survivability outperforms the single layer one, whereas for low bandwidth LSPs the single layer survivability is more cost-efficient. For the multilayer survivability we demonstrate that by mapping efficiently the spare capacity of the MPLS layer onto the resources of the optical layer one can achieve up to 22% savings in the total configuration cost and up to 37% in the optical layer cost. Further savings (up to 9 %) in the wavelength use can be obtained with the integrated approach to network configuration over the sequential one, however, at the increase in the optimization problem complexity. These results are based on a cost model with actual technology pricing and were obtained for networks targeted to a nationwide coverage

Performance evaluation of MPLS-enabled communications infrastructure for wide area monitoring systems

In order to obtain the transient power system measurement information, Wide Area Monitoring Systems (WAMS) should be able to collect Phasor Measurement Unit (PMU) data in a timely manner. Therefore along with the continual deployment of PMUs in Great Britain (GB) transmission system substations, a high performance communications infrastructure is becoming essential with regard to the establishment of reliable WAMS. This paper focuses mainly on evaluating the performance of the real-time WAMS communication infrastructure when Multi-Protocol Label Switching (MPLS) capability is added to a conventional IP network. Furthermore, PMU communications from geographically distributed substations to a Phasor Data Concentrator (PDC) are investigated over different transport protocols. Using OPNET Modeler, simulations are performed based on the existing WAMS infrastructure as installed on the GB transmission system. The simulation results are analyzed in detail in order to fully determine the different characteristics of communication delays between PMUs and PDC

Elliptic Feynman integrals and pure functions

We propose a variant of elliptic multiple polylogarithms that have at most logarithmic singularities in all variables and satisfy a differential equation without homogeneous term. We investigate several non-trivial elliptic two-loop Feynman integrals with up to three external legs and express them in terms of our functions. We observe that in all cases they evaluate to pure combinations of elliptic multiple polylogarithms of uniform weight. This is the first time that a notion of uniform weight is observed in the context of Feynman integrals that evaluate to elliptic polylogarithms.Comment: 47 page

Segment Routing: a Comprehensive Survey of Research Activities, Standardization Efforts and Implementation Results

Fixed and mobile telecom operators, enterprise network operators and cloud providers strive to face the challenging demands coming from the evolution of IP networks (e.g. huge bandwidth requirements, integration of billions of devices and millions of services in the cloud). Proposed in the early 2010s, Segment Routing (SR) architecture helps face these challenging demands, and it is currently being adopted and deployed. SR architecture is based on the concept of source routing and has interesting scalability properties, as it dramatically reduces the amount of state information to be configured in the core nodes to support complex services. SR architecture was first implemented with the MPLS dataplane and then, quite recently, with the IPv6 dataplane (SRv6). IPv6 SR architecture (SRv6) has been extended from the simple steering of packets across nodes to a general network programming approach, making it very suitable for use cases such as Service Function Chaining and Network Function Virtualization. In this paper we present a tutorial and a comprehensive survey on SR technology, analyzing standardization efforts, patents, research activities and implementation results. We start with an introduction on the motivations for Segment Routing and an overview of its evolution and standardization. Then, we provide a tutorial on Segment Routing technology, with a focus on the novel SRv6 solution. We discuss the standardization efforts and the patents providing details on the most important documents and mentioning other ongoing activities. We then thoroughly analyze research activities according to a taxonomy. We have identified 8 main categories during our analysis of the current state of play: Monitoring, Traffic Engineering, Failure Recovery, Centrally Controlled Architectures, Path Encoding, Network Programming, Performance Evaluation and Miscellaneous...Comment: SUBMITTED TO IEEE COMMUNICATIONS SURVEYS & TUTORIAL

PolyLogTools - Polylogs for the masses

We review recent developments in the study of multiple polylogarithms, including the Hopf algebra of the multiple polylogarithms and the symbol map, as well as the construction of single valued multiple polylogarithms and discuss an algorithm for finding fibration bases. We document how these algorithms are implemented in the Mathematica package PolyLogTools and show how it can be used to study the coproduct structure of polylogarithmic expressions and how to compute iterated parametric integrals over polylogarithmic expressions that show up in Feynman integal computations at low loop orders.Comment: Package URL: https://gitlab.com/pltteam/pl

Traffic Engineering with Segment Routing: SDN-based Architectural Design and Open Source Implementation

Traffic Engineering (TE) in IP carrier networks is one of the functions that can benefit from the Software Defined Networking paradigm. By logically centralizing the control of the network, it is possible to "program" per-flow routing based on TE goals. Traditional per-flow routing requires a direct interaction between the SDN controller and each node that is involved in the traffic paths. Depending on the granularity and on the temporal properties of the flows, this can lead to scalability issues for the amount of routing state that needs to be maintained in core network nodes and for the required configuration traffic. On the other hand, Segment Routing (SR) is an emerging approach to routing that may simplify the route enforcement delegating all the configuration and per-flow state at the border of the network. In this work we propose an architecture that integrates the SDN paradigm with SR-based TE, for which we have provided an open source reference implementation. We have designed and implemented a simple TE/SR heuristic for flow allocation and we show and discuss experimental results.Comment: Extended version of poster paper accepted for EWSDN 2015 (version v4 - December 2015

Elliptic polylogarithms and iterated integrals on elliptic curves II: an application to the sunrise integral

We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure math- ematics and string theory. We then focus on the equal-mass and non-equal-mass sunrise integrals, and we develop a formalism that enables us to compute these Feynman integrals in terms of our iterated integrals on elliptic curves. The key idea is to use integration-by-parts identities to identify a set of integral kernels, whose precise form is determined by the branch points of the integral in question. These kernels allow us to express all iterated integrals on an elliptic curve in terms of them. The flexibility of our approach leads us to expect that it will be applicable to a large variety of integrals in high-energy physics.Comment: 22 page

Scale dependence and collinear subtraction terms for Higgs production in gluon fusion at N3LO

The full, explicit, scale dependence of the inclusive N3LO cross section for single Higgs hadroproduction is obtained by calculating the convolutions of collinear splitting kernels with lower-order partonic cross sections. We provide results for all convolutions of splitting kernels and lower-order partonic cross sections to the order in epsilon needed for the full N3LO computation, as well as their expansions around the soft limit. We also discuss the size of the total scale uncertainty at N3LO that can be anticipated with existing information.Comment: 27 pages, 8 figure, 1 table, 8 ancillary files. v2: added 4 references, changed labelling of contour plot

Macro-routing: a new hierarchical routing protocol

In a continually evolving Internet, tools such as quality of service routing must be used in order to accommodate user demands. QoS routing raises scalability issues within very large networks, which can he avoided by using hierarchical routing strategies. However, such strategies can lead to inaccurate path selection due to the aggregation process. To avoid such problems, we propose a hierarchical routing protocol, called macro-routing, which can distribute the route computation more efficiently throughout the network using mobile agents. It processes more detailed information than conventional hierarchical routing protocols, so is more likely to find the best path between source and destination. Also, by using mobile agents, more than one available path can be found. This provides a fast recovery mechanism, where no protocol restart is needed in a failure situation

A versatile maskless microscope projection photolithography system and its application in light-directed fabrication of DNA microarrays

We present a maskless microscope projection lithography system (MPLS), in which photomasks have been replaced by a Digital Micromirror Device type spatial light modulator (DMD, Texas Instruments). Employing video projector technology high resolution patterns, designed as bitmap images on the computer, are displayed using a micromirror array consisting of about 786000 tiny individually addressable tilting mirrors. The DMD, which is located in the image plane of an infinity corrected microscope, is projected onto a substrate placed in the focal plane of the microscope objective. With a 5x(0.25 NA) Fluar microscope objective, a fivefold reduction of the image to a total size of 9 mm2 and a minimum feature size of 3.5 microns is achieved. Our system can be used in the visible range as well as in the near UV (with a light intensity of up to 76 mW/cm2 around the 365 nm Hg-line). We developed an inexpensive and simple method to enable exact focusing and controlling of the image quality of the projected patterns. Our MPLS has originally been designed for the light-directed in situ synthesis of DNA microarrays. One requirement is a high UV intensity to keep the fabrication process reasonably short. Another demand is a sufficient contrast ratio over small distances (of about 5 microns). This is necessary to achieve a high density of features (i.e. separated sites on the substrate at which different DNA sequences are synthesized in parallel fashion) while at the same time the number of stray light induced DNA sequence errors is kept reasonably small. We demonstrate the performance of the apparatus in light-directed DNA chip synthesis and discuss its advantages and limitations.Comment: 12 pages, 9 figures, journal articl