Modeling Teletraffic Arrivals by a Poisson Cluster Process

Modeling Teletraffic Arrivals by a Poisson Cluster Proces

Catalog Dynamics: Impact of Content Publishing and Perishing on the Performance of a LRU Cache

The Internet heavily relies on Content Distribution Networks and transparent caches to cope with the ever-increasing traffic demand of users. Content, however, is essentially versatile: once published at a given time, its popularity vanishes over time. All requests for a given document are then concentrated between the publishing time and an effective perishing time. In this paper, we propose a new model for the arrival of content requests, which takes into account the dynamical nature of the content catalog. Based on two large traffic traces collected on the Orange network, we use the semi-experimental method and determine invariants of the content request process. This allows us to define a simple mathematical model for content requests; by extending the so-called "Che approximation", we then compute the performance of a LRU cache fed with such a request process, expressed by its hit ratio. We numerically validate the good accuracy of our model by comparison to trace-based simulation.Comment: 13 Pages, 9 figures. Full version of the article submitted to the ITC 2014 conference. Small corrections in the appendix from the previous versio

Performance Evaluation in Single or Multi-Cluster C-RAN Supporting Quasi-Random Traffic

In this paper, a cloud radio access network (C-RAN) is considered where the remote radio heads (RRHs) are separated from the baseband units (BBUs). The RRHs in the C-RAN are grouped in different clusters according to their capacity while the BBUs form a centralized pool of computational resource units. Each RRH services a finite number of mobile users, i.e., the call arrival process is the quasi-random process. A new call of a single service-class requires a radio and a computational resource unit in order to be accepted in the C-RAN for a generally distributed service time. If these resource units are unavailable, then the call is blocked and lost. To analyze the multi-cluster C-RAN, we model it as a single-rate loss system, show that a product form solution exists for the steady state probabilities and propose a convolution algorithm for the accurate determination of congestion probabilities. The accuracy of this algorithm is verified via simulation. The proposed model generalizes our recent model where the RRHs in the C-RAN are grouped in a single cluster and each RRH accommodates quasi-random traffic

Performance analysis of handoff resource allocation strategies through the state-dependent rejection scheme

The state-dependent rejection scheme (SRS) provides a common framework for analysing existing handoff schemes and for designing new ones easily. Designing new schemes is made simple by determining the appropriate set of state-dependent probabilities. The Markov analysis of SRS is simple and useful for drawing initial conclusions on handoff strategies. The analysis and simulations carried out here demonstrate the capability of SRS to adapt to different mobility and load scenarios and to achieve good performance while targeting quality of service performance metrics.Peer Reviewe

Reduced long-range dependence combining Poisson bursts with on--off sources

A workload model using the infinite source Poisson model for bursts is combined with the on--off model for within burst activity. Burst durations and on--off durations are assumed to have heavy-tailed distributions with infinite variance and finite mean. Since the number of bursts is random, one can consider limiting results based on "random centering" of a random sum for the total workload from all sources. Convergence results are shown to depend on the tail indices of both the on--off durations and the lifetimes distributions. Moreover, the results can be separated into cases depending on those tail indices. In one case where all distributions are heavy tailed it is shown that the limiting result is Brownian motion. In another case, convergence to fractional Brownian motion is shown, where the Hurst parameter depends on the heavy-tail indices of the distribution of the on, off and burst durations.Comment: Published in at http://dx.doi.org/10.1214/09-BJPS105 the Brazilian Journal of Probability and Statistics (http://www.imstat.org/bjps/) by the Brazilian Statistical Association/Institute of Mathematical Statistics (http://www.redeabe.org.br/

An analytical framework in LEO mobile satellite systems servicing batched Poisson traffic

The authors consider a low earth orbit (LEO) mobile satellite system (MSS) that accepts new and handover calls of multirate service-classes. New calls arrive in the system as batches, following the batched Poisson process. A batch has a generally distributed number of calls. Each call is treated separately from the others and its acceptance is decided according to the availability of the requested number of channels. Handover calls follow also a batched Poisson process. All calls compete for the available channels under the complete sharing policy. By considering the LEO-MSS as a multirate loss system with ‘satellite-fixed’ cells, it can be analysed via a multi-dimensional Markov chain, which yields to a product form solution (PFS) for the steady-state distribution. Based on the PFS, they propose a recursive and yet efficient formula for the determination of the channel occupancy distribution, and consequently, for the calculation of various performance measures including call blocking and handover failure probabilities. The latter are much higher compared to the corresponding probabilities in the case of the classical (and less bursty) Poisson process. Simulation results verify the accuracy of the proposed formulas. Furthermore, they discuss the applicability of the proposed model in software-defined LEO-MSS

Discrete event simulation of wireless cellular networks

Postprint (published version

Optimal Caching and Routing in Hybrid Networks

Hybrid networks consisting of MANET nodes and cellular infrastructure have been recently proposed to improve the performance of military networks. Prior work has demonstrated the benefits of in-network content caching in a wired, Internet context. We investigate the problem of developing optimal routing and caching policies in a hybrid network supporting in-network caching with the goal of minimizing overall content-access delay. Here, needed content may always be accessed at a back-end server via the cellular infrastructure; alternatively, content may also be accessed via cache-equipped "cluster" nodes within the MANET. To access content, MANET nodes must thus decide whether to route to in-MANET cluster nodes or to back-end servers via the cellular infrastructure; the in-MANET cluster nodes must additionally decide which content to cache. We model the cellular path as either i) a congestion-insensitive fixed-delay path or ii) a congestion-sensitive path modeled as an M/M/1 queue. We demonstrate that under the assumption of stationary, independent requests, it is optimal to adopt static caching (i.e., to keep a cache's content fixed over time) based on content popularity. We also show that it is optimal to route to in-MANET caches for content cached there, but to route requests for remaining content via the cellular infrastructure for the congestion-insensitive case and to split traffic between the in-MANET caches and cellular infrastructure for the congestion-sensitive case. We develop a simple distributed algorithm for the joint routing/caching problem and demonstrate its efficacy via simulation.Comment: submitted to Milcom 201