相关论文: Mixture Models of Endhost Network Traffic

The real-world traffic networks undergo expansion through the installation of new sensors, implying that the traffic patterns continually evolve over time. Incrementally training a model on the newly added sensors would make the model…

We define a class of probability distributions that we call simplicial mixture models, inspired by simplicial complexes from algebraic topology. The parameters of these distributions represent their topology and we show that it is possible…

We propose a macroscopic modeling framework for a network of roads and multi-commodity traffic. The proposed framework is based on the Lighthill-Whitham-Richards kinematic wave theory; more precisely, on its discretization, the Cell…

We study a message passing model, applicable also to traffic problems. The model is implemented in a discrete lattice, where particles move towards their destination, with fluctuations around the minimal distance path. A repulsive…

The multivariate version of the Mixed Tempered Stable is proposed. It is a generalization of the Normal Variance Mean Mixtures. Characteristics of this new distribution and its capacity in fitting tails and capturing dependence structure…

Due to network operation and maintenance relying heavily on network traffic monitoring, traffic matrix analysis has been one of the most crucial issues for network management related tasks. However, it is challenging to reliably obtain the…

Experimental studies on vehicular traffic provide data on quantities like density, flux, and mean speed of the vehicles. However, the diagrams relating these variables (the fundamental and speed diagrams) show some peculiarities not yet…

Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite…

The need to reason about uncertainty in large, complex, and multi-modal datasets has become increasingly common across modern scientific environments. The ability to transform samples from one distribution $P$ to another distribution $Q$…

We investigate a probabilistic model for routeing of messages in relay-augmented multihop ad-hoc networks, where each transmitter sends one message to the origin. Given the (random) transmitter locations, we weight the family of random,…

We consider a finite collection of independent Hermitian heavy-tailed random matrices of growing dimension. Our model includes the L\'evy matrices proposed by Bouchaud and Cizeau, as well as sparse random matrices with O(1) non-zero entries…

Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such…

Global variational approximation methods in graphical models allow efficient approximate inference of complex posterior distributions by using a simpler model. The choice of the approximating model determines a tradeoff between the…

We consider nonparametric estimation of a mixed discrete-continuous distribution under anisotropic smoothness conditions and possibly increasing number of support points for the discrete part of the distribution. For these settings, we…

Traditional end-to-end congestion control mechanisms assume data transferring happens between each pair user. In contrast, in a P2P network, many peers may locally keep a copy of a specific data object. If the path between a pair of peers…

Traffic flow at low densities (free traffic) is characterized by a quasi-one-dimensional relation between traffic flow and vehicle density, while no such fundamental diagram exists for `synchronized' congested traffic flow. Instead, a…

In this paper we introduce a new parametric distribution, the Mixed Tempered Stable. It has the same structure of the Normal Variance Mean Mixtures but the normality assumption leaves place to a semi-heavy tailed distribution. We show that,…

We study the emergence of congestion patterns in urban networks by modeling vehicular interaction by means of a simple traffic rule and by using a set of measures inspired by the standard Betweenness Centrality (BC). We consider a…

A new statistical based model approach to characterize a user's behavior in an Internet access link is presented. The real patterns of Internet traffic in a heterogeneous Campus Network are studied. We find three clearly different patterns…

In this paper the chaotic properties of the TCP congestion avoidance mechanism are investigated. The analysis focuses on the origin of the complex behavior appearing in deterministic TCP/IP networks. From the traffic modeling point of view…