Related papers: How user throughput depends on the traffic demand …
Geographic locations of cellular base stations sometimes can be well fitted with spatial homogeneous Poisson point processes. In this paper we make a complementary observation: In the presence of the log-normal shadowing of sufficiently…
A simple and accurate relationship is demonstrated that links the average shortest path, nodes, and edges in a complex network. This relationship takes advantage of the concept of link density and shows a large improvement in fitting…
We analyze a data-processing system with $n$ clients producing jobs which are processed in \textit{batches} by $m$ parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup…
A macroscopic model-based approach for estimation of the traffic state, specifically of the (total) density and flow of vehicles, is developed for the case of "mixed" traffic, i.e., traffic comprising both ordinary and connected vehicles.…
Results are presented for optimizing device-to-device communications in cellular networks, while maintaining spectral efficiency of the base-station-to-device downlink channel. We build upon established and tested stochastic geometry models…
We study in this paper the integration of elastic and streaming traffic on a same link in an IP network. We are specifically interested in the computation of the mean bit rate obtained by a data transfer. For this purpose, we consider that…
The manner epidemics occurs in a social network depends on various elements, with two of the most influential being the relationships among individuals in the population and the mechanism of transmission. In this paper, we assume that the…
This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of…
The typical cell is a key concept for stochastic-geometry based modeling in communication networks, as it provides a rigorous framework for describing properties of a serving zone associated with a component selected at random in a large…
We present an analytical method for computing the mean cover time of a random walk process on arbitrary, complex networks. The cover time is defined as the time a random walker requires to visit every node in the network at least once. This…
In heterogeneous networks (HetNets), load balancing among different tiers can be effectively achieved by a biased user association scheme with which each user chooses to associate with one base station (BS) based on the biased received…
The Poisson bipolar model considers user-base station pairs distributed at random on a flat domain, similar to matchsticks scattered onto a table. Though this is a simple and tractable setting in which to study dense networks, it doesn't…
Clustering is the propensity of nodes that share a common neighbour to be connected. It is ubiquitous in many networks but poses many modelling challenges. Clustering typically manifests itself by a higher than expected frequency of…
We develop a probabilistic framework for global modeling of the traffic over a computer network. This model integrates existing single-link (-flow) traffic models with the routing over the network to capture the global traffic behavior. It…
The throughput of a linear cellular uplink with a random number of users, different power control schemes, and cooperative base stations is considered in the large system limit where the number of cells is large for non fading Gaussian…
Percolation theory can be used to describe the structural properties of complex networks using the generating function formulation. This mapping assumes that the network is locally tree-like and does not contain short-range loops between…
Congestion in transport networks is a topic of theoretical interest and practical importance. In this paper we study the flow of vehicles in urban street networks. In particular, we use a cellular automata model to simulate the motion of…
We propose in this article an adaptation of the basic techniques of the deterministic network calculus theory to the road traffic flow theory. Network calculus is a theory based on min-plus algebra. It uses algebraic techniques to compute…
Consider the problem of a multi-user multiple access channel. While several multi-user coding techniques exist, in practical scenarios, not all users can be scheduled simultaneously. Thus, a key problem is which users to schedule in a given…
We introduce density dependence of the cell size in cellular-automaton models for traffic flow, which allows a more precise correspondence between real-world phenomena and what observed in simulation. Also, we give an explicit calibration…