Scalable BGP Prefix Selection for Effective Inter-domain Traffic Engineering

Inter-domain Traffic Engineering for multi-homed networks faces a scalability challenge, as the size of BGP routing table continue to grow. In this context, the choice of the best path must be made potentially for each destination prefix, requiring all available paths to be characterised (e.g., through measurements) and compared with each other. Fortunately, it is well-known that a few number of prefixes carry the larger part of the traffic. As a natural consequence, to engineer large volume of traffic only few prefixes need to be managed. Yet, traffic characteristics of a given prefix can greatly vary over time, and little is known on the dynamism of traffic at this aggregation level, including predicting the set of the most significant prefixes in the near future. %based on past observations. Sophisticated prediction methods won't scale in such context. In this paper, we study the relationship between prefix volume, stability, and predictability, based on recent traffic traces from nine different networks. Three simple and resource-efficient methods to select the prefixes associated with the most important foreseeable traffic volume are then proposed. Such proposed methods allow to select sets of prefixes with both excellent representativeness (volume coverage) and stability in time, for which the best routes are identified. The analysis carried out confirm the potential benefits of a route decision engine

Structural Analysis of Network Traffic Matrix via Relaxed Principal Component Pursuit

The network traffic matrix is widely used in network operation and management. It is therefore of crucial importance to analyze the components and the structure of the network traffic matrix, for which several mathematical approaches such as Principal Component Analysis (PCA) were proposed. In this paper, we first argue that PCA performs poorly for analyzing traffic matrix that is polluted by large volume anomalies, and then propose a new decomposition model for the network traffic matrix. According to this model, we carry out the structural analysis by decomposing the network traffic matrix into three sub-matrices, namely, the deterministic traffic, the anomaly traffic and the noise traffic matrix, which is similar to the Robust Principal Component Analysis (RPCA) problem previously studied in [13]. Based on the Relaxed Principal Component Pursuit (Relaxed PCP) method and the Accelerated Proximal Gradient (APG) algorithm, we present an iterative approach for decomposing a traffic matrix, and demonstrate its efficiency and flexibility by experimental results. Finally, we further discuss several features of the deterministic and noise traffic. Our study develops a novel method for the problem of structural analysis of the traffic matrix, which is robust against pollution of large volume anomalies.Comment: Accepted to Elsevier Computer Network

Monitoring Challenges and Approaches for P2P File-Sharing Systems

Since the release of Napster in 1999, P2P file-sharing has enjoyed a dramatic rise in popularity. A 2000 study by Plonka on the University of Wisconsin campus network found that file-sharing accounted for a comparable volume of traffic to HTTP, while a 2002 study by Saroiu et al. on the University of Washington campus network found that file-sharing accounted for more than treble the volume of Web traffic observed, thus affirming the significance of P2P in the context of Internet traffic. Empirical studies of P2P traffic are essential for supporting the design of next-generation P2P systems, informing the provisioning of network infrastructure and underpinning the policing of P2P systems. The latter is of particular significance as P2P file-sharing systems have been implicated in supporting criminal behaviour including copyright infringement and the distribution of illegal pornograph

Dynamic 3D Network Data Visualization

Monitoring network traffic has always been an arduous and tedious task because of the complexity and sheer volume of network data that is being consistently generated. In addition, network growth and new technologies are rapidly increasing these levels of complexity and volume. An effective technique in understanding and managing a large dataset, such as network traffic, is data visualization. There are several tools that attempt to turn network traffic into visual stimuli. Many of these do so in 2D space and those that are 3D lack the ability to display network patterns effectively. Existing 3D network visualization tools lack user interaction, dynamic generation, and intuitiveness. This project proposes a user-friendly 3D network visualization application that creates both dynamic and interactive visuals. This application was built using the Bablyon.js graphics framework and uses anonymized data collected from a campus network

A measure theoretic approach to traffic flow optimization on networks

We consider a class of optimal control problems for measure-valued nonlinear transport equations describing traffic flow problems on networks. The objective isto minimise/maximise macroscopic quantities, such as traffic volume or average speed,controlling few agents, for example smart traffic lights and automated cars. The measuretheoretic approach allows to study in a same setting local and nonlocal drivers interactionsand to consider the control variables as additional measures interacting with the driversdistribution. We also propose a gradient descent adjoint-based optimization method, ob-tained by deriving first-order optimality conditions for the control problem, and we providesome numerical experiments in the case of smart traffic lights for a 2-1 junction.Comment: 20 pages, 6 figure

Characteristics of Vehicular Traffic Flow at a Roundabout

We construct a stochastic cellular automata model for the description of vehicular traffic at a roundabout designed at the intersection of two perpendicular streets. The vehicular traffic is controlled by a self-organized scheme in which traffic lights are absent. This controlling method incorporates a yield-at-entry strategy for the approaching vehicles to the circulating traffic flow in the roundabout. Vehicular dynamics is simulated within the framework of the probabilistic cellular automata and the delay experienced by the traffic at each individual street is evaluated for specified time intervals. We discuss the impact of the geometrical properties of the roundabout on the total delay. We compare our results with traffic-light signalisation schemes, and obtain the critical traffic volume over which the intersection is optimally controlled through traffic light signalisation schemes.Comment: 10 pages, 17 eps figures. arXiv admin note: text overlap with arXiv:cond-mat/040107

Euclidean versus hyperbolic congestion in idealized versus experimental networks

This paper proposes a mathematical justification of the phenomenon of extreme congestion at a very limited number of nodes in very large networks. It is argued that this phenomenon occurs as a combination of the negative curvature property of the network together with minimum length routing. More specifically, it is shown that, in a large n-dimensional hyperbolic ball B of radius R viewed as a roughly similar model of a Gromov hyperbolic network, the proportion of traffic paths transiting through a small ball near the center is independent of the radius R whereas, in a Euclidean ball, the same proportion scales as 1/R^{n-1}. This discrepancy persists for the traffic load, which at the center of the hyperbolic ball scales as the square of the volume, whereas the same traffic load scales as the volume to the power (n+1)/n in the Euclidean ball. This provides a theoretical justification of the experimental exponent discrepancy observed by Narayan and Saniee between traffic loads in Gromov-hyperbolic networks from the Rocketfuel data base and synthetic Euclidean lattice networks. It is further conjectured that for networks that do not enjoy the obvious symmetry of hyperbolic and Euclidean balls, the point of maximum traffic is near the center of mass of the network.Comment: 23 pages, 4 figure

Pilots' use of a traffic alert and collision-avoidance system (TCAS 2) in simulated air carrier operations. Volume 2: Appendices

Pilots' use of and responses to a traffic alert and collision-avoidance system (TCAS 2) in simulated air carrier line operations are discribed in Volume 1. TCAS 2 monitors the positions of nearby aircraft by means of transponder interrogation, and it commands a climb or descent which conflicting aircraft are projected to reach an unsafe closest point-of-approach within 20 to 25 seconds. A different level of information about the location of other air traffic was presented to each of three groups of flight crews during their execution of eight simulated air carrier flights. A fourth group of pilots flew the same segments without TCAS 2 equipment. Traffic conflicts were generated at intervals during the flights; many of the conflict aircraft were visible to the flight crews. The TCAS equipment successfully ameliorated the seriousness of all conflicts; three of four non-TCAS crews had hazardous encounters. Response times to TCAS maneuver commands did not differ as a function of the amount of information provided, nor did response accuracy. Differences in flight experience did not appear to contribute to the small performance differences observed. Pilots used the displays of conflicting traffic to maneuver to avoid unseen traffic before maneuver advisories were issued by the TCAS equipment. The results indicate: (1) that pilots utilize TCAS effectively within the response times allocated by the TCAS logic, and (2) that TCAS 2 is an effective collision avoidance device. Volume 2 contains the appendices referenced in Volume 1, providing details of the experiment and the results, and the text of two reports written in support of the program

Automatic Estimation of the Exposure to Lateral Collision in Signalized Intersections using Video Sensors

Intersections constitute one of the most dangerous elements in road systems. Traffic signals remain the most common way to control traffic at high-volume intersections and offer many opportunities to apply intelligent transportation systems to make traffic more efficient and safe. This paper describes an automated method to estimate the temporal exposure of road users crossing the conflict zone to lateral collision with road users originating from a different approach. This component is part of a larger system relying on video sensors to provide queue lengths and spatial occupancy that are used for real time traffic control and monitoring. The method is evaluated on data collected during a real world experiment