Inter-domain networking innovation on steroids: Empowering IXPs with SDN capabilities

While innovation in inter-domain routing has remained stagnant for over a decade, Internet Exchange Points (IXPs) are consolidating their role as economically advantageous interconnection points for reducing path latencies and exchanging ever increasing amounts of traffic. As such, IXPs appear as a natural place to foster network innovation and assess the benefits of Software-Defined Networking (SDN), a recent technological trend that has already boosted innovation within data-center networks. In this paper, we give a comprehensive overview of use cases for SDN at IXPs, which leverage the superior vantage point of an IXP to introduce advanced features like load-balancing and DDoS mitigation. We discuss the benefits of SDN solutions by analyzing real-world data from one of the largest IXPs. We also leverage insights into IXP operations to not only shape benefits for members but also for operators.This research is (in part) supported by European Union’s Horizon 2020 research and innovation programme under the ENDEAVOUR project (grant agreement 644960).This is the author accepted manuscript. The final version is available from IEEE via https://doi.org/ 10.1109/MCOM.2016.758827

Numerical and experimental studies of shallow cone penetration in clay

The fall-cone test is widely used in geotechnical practice to obtain rapid estimates of the undrained shear strength of cohesive soil, and as an index test to determine the liquid limit. This thesis is concerned with numerical modelling of the penetration of solids by conical indenters, and with interpretation of the numerical results in the context of the fall-cone test. Experimental studies of shallow cone penetration in clay are also reported, with the aim of verifying the numerical predictions. The practical significance of the results, in terms of the interpretation of fall-cone test results, is assessed. Results are reported from finite element analyses with the commercial codes ELFEN and Abaqus, in which an explicit dynamic approach was adopted for analysis of continuous cone indentation. Quasi-static analyses using an elastoplastic Tresca material model are used to obtain bearing capacity factors for shallow cone penetration, taking account of the material displaced, for various cone apex angles and adhesion factors. Further analyses are reported in which a simple extension of the Tresca material model, implemented as a user-defined material subroutine for Abaqus, is used to simulate viscous rate effects (known to be important in cohesive soils). Some analyses with the rate-dependent model are displacement-controlled, while others model the effect of rate-dependence on the dynamics of freefall cone indentation tests. Laboratory measurements of the forces required to indent clay samples in the laboratory are reported. Results from displacement-controlled tests with imposed step-changes in cone speed, and from freefall tests, confirm that the numerical rate-dependent strength model represents the observed behaviour well. Some results from experiments to observe plastic flow around conical indenters are also presented. Finally, additional numerical analyses are presented in which a critical state model of clay plasticity is used to study the variation of effective stress, strain and pore pressure around cones in indentation tests at various speeds

Counting the Solutions of Presburger Equations without Enumerating Them

peer reviewedThe Number Decision Diagram (NDD) has recently been proposed as a powerful representation system for sets of integer vectors. In particular, NDDs can be used for representing the sets of solutions of arbitrary Presburger formulas, or the set of reachable states of some systems using unbounded integer variables. In this paper, we address the problem of counting the number of distinct elements in a set of vectors represented as an NDD. We give an algorithm that is able to perform an exact count without enumerating explicitly the vectors, which makes it capable of handling very large sets. As an auxiliary result, we also develop an efficient projection method that allows to construct efficiently NDDs from quantified formulas, and thus makes it possible to apply our counting technique to sets specified by formulas. Our algorithms have been implemented in the verification tool LASH, and applied successfully to various counting problems.ARC - Actions de recherche concertée