4,883 research outputs found
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
Energy-efficient traffic engineering
The energy consumption in telecommunication networks is expected to grow considerably, especially in core networks. In this chapter, optimization of energy consumption is approached from two directions. In a first study, multilayer traffic engineering (MLTE) is used to assign energy-efficient paths and logical topology to IP traffic. The relation with traditional capacity optimization is explained, and the MLTE strategy is applied for daily traffic variations. A second study considers the core network below the IP layer, giving a detailed power consumption model. Optical bypass is evaluated as a technique to achieve considerable power savings over per-hop opticalelectronicoptical regeneration.
Document type: Part of book or chapter of boo
Multilevel MDA-Lite Paris Traceroute
Since its introduction in 2006-2007, Paris Traceroute and its Multipath
Detection Algorithm (MDA) have been used to conduct well over a billion IP
level multipath route traces from platforms such as M-Lab. Unfortunately, the
MDA requires a large number of packets in order to trace an entire topology of
load balanced paths between a source and a destination, which makes it
undesirable for platforms that otherwise deploy Paris Traceroute, such as RIPE
Atlas. In this paper we present a major update to the Paris Traceroute tool.
Our contributions are: (1) MDA-Lite, an alternative to the MDA that
significantly cuts overhead while maintaining a low failure probability; (2)
Fakeroute, a simulator that enables validation of a multipath route tracing
tool's adherence to its claimed failure probability bounds; (3) multilevel
multipath route tracing, with, for the first time, a Traceroute tool that
provides a router-level view of multipath routes; and (4) surveys at both the
IP and router levels of multipath routing in the Internet, showing, among other
things, that load balancing topologies have increased in size well beyond what
has been previously reported as recently as 2016. The data and the software
underlying these results are publicly available.Comment: Preprint. To appear in Proc. ACM Internet Measurement Conference 201
Access and metro network convergence for flexible end-to-end network design
This paper reports on the architectural, protocol, physical layer, and integrated testbed demonstrations carried out by the DISCUS FP7 consortium in the area of access - metro network convergence. Our architecture modeling results show the vast potential for cost and power savings that node consolidation can bring. The architecture, however, also recognizes the limits of long-reach transmission for low-latency 5G services and proposes ways to address such shortcomings in future projects. The testbed results, which have been conducted end-to-end, across access - metro and core, and have targeted all the layers of the network from the application down to the physical layer, show the practical feasibility of the concepts proposed in the project
Recursive SDN for Carrier Networks
Control planes for global carrier networks should be programmable (so that
new functionality can be easily introduced) and scalable (so they can handle
the numerical scale and geographic scope of these networks). Neither
traditional control planes nor new SDN-based control planes meet both of these
goals. In this paper, we propose a framework for recursive routing computations
that combines the best of SDN (programmability) and traditional networks
(scalability through hierarchy) to achieve these two desired properties.
Through simulation on graphs of up to 10,000 nodes, we evaluate our design's
ability to support a variety of routing and traffic engineering solutions,
while incorporating a fast failure recovery mechanism
- âŠ