Why (and How) Networks Should Run Themselves

The proliferation of networked devices, systems, and applications that we depend on every day makes managing networks more important than ever. The increasing security, availability, and performance demands of these applications suggest that these increasingly difficult network management problems be solved in real time, across a complex web of interacting protocols and systems. Alas, just as the importance of network management has increased, the network has grown so complex that it is seemingly unmanageable. In this new era, network management requires a fundamentally new approach. Instead of optimizations based on closed-form analysis of individual protocols, network operators need data-driven, machine-learning-based models of end-to-end and application performance based on high-level policy goals and a holistic view of the underlying components. Instead of anomaly detection algorithms that operate on offline analysis of network traces, operators need classification and detection algorithms that can make real-time, closed-loop decisions. Networks should learn to drive themselves. This paper explores this concept, discussing how we might attain this ambitious goal by more closely coupling measurement with real-time control and by relying on learning for inference and prediction about a networked application or system, as opposed to closed-form analysis of individual protocols

Modeling Overlapping and Heterogeneous Perception Variance in Stochastic User Equilibrium Problem with Weibit Route Choice Model

In this study, a new SUE model using the Weibull random error terms is proposed as an alternative to overcome the drawbacks of the multinomial logit (MNL) SUE model. A path-size weibit (PSW) model is developed to relax both independently and identically distributed assumptions, while retaining an analytical closed-form solution. Specifically, this route choice model handles route overlapping through the path-size factor and captures the route-specific perception variance through the Weibull distributed random error terms. Both constrained entropy-type and unconstrained equivalent MP formulations for the PSW-SUE are provided. In addition, model extensions to consider the demand elasticity and combined travel choice of the PSW-SUE model are also provided. Unlike the logit-based model, these model extensions incorporate the logarithmic expected perceived travel cost as the network level of service to determine the demand elasticity and travel choice. Qualitative properties of these minimization programs are given to establish equivalency and uniqueness conditions. Both path-based and link-based algorithms are developed for solving the proposed MP formulations. Numerical examples show that the proposed models can produce a compatible traffic flow pattern compared to the multinomial probit (MNP) SUE model, and these models can be implemented in a real-world transportation network

Fully automated urban traffic system

The replacement of the driver with an automatic system which could perform the functions of guiding and routing a vehicle with a human's capability of responding to changing traffic demands was discussed. The problem was divided into four technological areas; guidance, routing, computing, and communications. It was determined that the latter three areas being developed independent of any need for fully automated urban traffic. A guidance system that would meet system requirements was not being developed but was technically feasible

Machine learning for early detection of traffic congestion using public transport traffic data

The purpose of this project is to provide better knowledge of how the bus travel times is affected by congestion and other problems in the urban traffic environment. The main source of data for this study is second-level measurements coming from all buses in the Linköping region showing the location of each vehicle.The main goal of this thesis is to propose, implement, test and optimize a machine learning algorithm based on data collected from regional buses from Sweden so that it is able to perform predictions on the future state of the urban traffic.El objetivo principal de este proyecto es proponer, implementar, probar y optimizar un algoritmo de aprendizaje automático basado en datos recopilados de autobuses regionales de Suecia para que poder realizar predicciones sobre el estado futuro del tráfico urbano.L'objectiu principal d'aquest projecte és proposar, implementar, provar i optimitzar un algoritme de machine learning basat en dades recollides a partir d'autobusos regionals de Suècia de manera per poder realitzar prediccions sobre l'estat futur del trànsit urbà

Analysis of Uplink Scheduling for Haptic Communications

While new mechanisms and configurations of the 5G radio are offering step forward in delivery of ultra-reliable low latency communication services in general, and haptic communications in particular, they could inversely impact the remainder of traffic services. In this paper, we investigate the uplink access procedure, how different advances in this procedure enhance delivery of haptic communication, and how it affects the remainder of traffic services in the network. We model this impact as the remainder of service, using stochastic network calculus. Our results show how best the tradeoff between faster or more resource efficient uplink access can be made depending on the rate of haptic data, which is directly relevant to the application domain of haptic communication.Comment: 8 pages, 14 figures, conference pape