On the impact of aggregation on the performance of traffic aware routing

Abstract — This paper investigates the impact of traffic aggregation on the performance of routing algorithms that incorporate traffic information. The focus is on two main issues. Firstly, we explore the relationship between the average performance of the network and the level of granularity at which traffic can be assigned to routes. More specifically, we are interested in how average network performance improves as the ability of the routing protocol to split traffic arbitrarily across multiple paths increases. Secondly, we focus on the impact of traffic aggregation on short-term routing behavior. In particular, we explore the effects of traffic aggregation on traffic variability, which directly affects short-term routing performance. Our analysis is based on traffic traces collected from an operational network. The results of this study provide insights into the cost-performance trade-offs associated with deploying routing protocols that incorporate traffic awareness

How to avoid liability litigation in courts – Suggestions from a German example

The medical art is difficult, its results can not always be predicted. After looking at TV, patients know more or think they know more about medicine. They tend to assume faulty diagnostics or treatment by their physician, if the good result promised by the news-media or by the doctor himself has not been obtained

Multiobjective optimization of MPLS-IP networks with a variable neighborhood genetic algorithm

This paper presents a Genetic Algorithm for the optimization of multiple indices of Quality of Service of Multi Protocol Label Switching (MPLS) IP networks. The proposed algorithm, the Variable Neighborhood Multiobjective Genetic Algorithm (VN-MGA), is a Genetic Algorithm based on the NSGA-II, with the particular feature that solutions are encoded defining two different kinds of neighborhoods. The first neighborhood is defined by considering as decision variables the edges that form the routes to be followed by each request, whilst the second part of solution is kept constant. The second neighborhood is defined by considering the request sequence as decision variable, with the first part kept constant. Comparisons are performed with: (i) a VNS algorithm that performs a switch between the same two neighborhoods that are used in VN-MGA; and (ii) the results obtained with an integer linear programming solver, running a scalarized version of the multiobjective problem. The results indicate that the proposed VN-MGA outperforms the pure VNS algorithm, and provides a good approximation of the exact Pareto fronts obtained with Integer Linear Programming (ILP) approach, at a much smaller computational cost. Besides potential benefits of the application of the proposed approach to the optimization of packet routing in MPLS networks, this work raises the theoretical issue of the systematic application of variable encodings, which allow variable neighborhood searches, as generic operators inside general evolutionary computation algorithms. Codice rivista: E013138 Titolo rivista: APPLIED SOFT COMPUTING Issn: 1568-4946 Cordiali saluti CINECA - Servizio Gestione Rivist

UGR’16: A New Dataset for the Evaluation of Cyclostationarity-Based Network IDSs

The evaluation of algorithms and techniques to implement intrusion detection systems heavily rely on the existence of well designed datasets. In the last years, a lot of efforts have been done towards building these datasets. Yet, there is still room to improve. In this paper, a comprehensive review of existing datasets is first done, making emphasis on their main shortcomings. Then, we present a new dataset that is built with real traffic and up-to-date attacks. The main advantage of this dataset over previous ones is its usefulness for evaluating IDSs that consider long-term evolution and traffic periodicity. Models that consider differences in daytime/night or weekdays/weekends can also be trained and evaluated with it. We discuss all the requirements for a modern IDS evaluation dataset and analyze how the one presented here meets the different needs

Multiprotocol Lambda Switching: Combining MPLS Traffic Engineering Control with Optical Crossconnects

This article describes an approach to the design of control planes for optical crossconnects which leverages existing control plane techniques developed for MPLS traffic engineering. The proposed approach combines recent advances in MPLS traffic engineering control plane constructs with OXC technology to provide a framework for real-time provisioning of optical channels, foster development and deployment of a new class of OXCs, and allow the use of uniform semantics for network management and operations control in hybrid networks consisting of OXCs and label switching routers. The proposed approach is particularly advantageous for OXCs intended for data-centric optical internetworking systems