Teletraffic Model Research Articles

Modelling Heavy Tailed Phenomena Using a LogNormal Distribution Having a Numerically Verifiable Infinite Variance

One-sided heavy tailed distributions have been used in many engineering applications, ranging from teletraffic modelling to financial engineering. In practice, the most interesting heavy tailed distributions are those having a finite mean and a diverging variance. The LogNormal distribution is sometimes discarded from modelling heavy tailed phenomena because it has a finite variance, even when it seems the most appropriate one to fit the data. In this work we provide for the first time a LogNormal distribution having a finite mean and a variance which converges to a well-defined infinite value. This is possible thanks to the use of Non-Standard Analysis. In particular, we have been able to obtain a Non-Standard LogNormal distribution, for which it is possible to numerically and experimentally verify whether the expected mean and variance of a set of generated pseudo-random numbers agree with the theoretical ones. Moreover, such a check would be much more cumbersome (and sometimes even impossible) when considering heavy tailed distributions in the traditional framework of standard analysis.

Network Traffic Modeling in a Wi-Fi System with Intelligent Soil Moisture Sensors (WSN) Using IoT Applications for Potato Crops and ARIMA and SARIMA Time Series

This article presents the results obtained by analyzing the data traffic that originated in a system with intelligent soil moisture sensors (Wireless Sensor Network—WSN) that transmit through a wireless network. This study sought to integrate smart agriculture and IoT (Internet of Things) applications in potato crops in various rural settings. Using these measurements, the data analysis was performed through the ARIMA (autoregressive integrated moving average model) and SARIMA (seasonal autoregressive integrated moving average model) time series following the Box–Jenkins methodology. GRETL (Gnu Regression, Econometrics and Time-series Library) free software was used to generate a teletraffic behavior prediction model in a larger-scale implementation. The main objective was the creation of a model that allows an analysis and simulation about the behavior of the main performance parameters that a medium-scale WSN system would have for the monitoring of a crop. Thanks to this analysis, it will be possible to determine the technical characteristics that a sensor deployment should have in a specific area and for a specific crop.

Long-range dependence and self-similarity of teletraffic with different protocols at the large time scale of day in the duration of 12 years: Autocorrelation modeling

Teletraffic (traffic in short) modeling is crucial in the analysis and design of the infrastructure of cyber-physical network systems from a view of traffic engineering. However, reports regarding traffic modeling at the large time scale of day in the duration of years are rarely seen. This paper addresses our finding in autocorrelation function modeling in the closed form of traffic at the time scale of day (daily traffic for short) in the duration of 12 years with different protocols. We shall show that the autocorrelation function of daily traffic takes the autocorrelation function form of the generalized Cauchy process based on studying the autocorrelation function modeling of daily traffic with real traffic data. Thus, the long-range dependence and local self-similarity of daily traffic are in general uncorrelated according to the theory of the generalized Cauchy process. In addition, we will exhibit that the concrete values of long-range dependence measure and local self-similarity one of daily traffic may relate to protocol types.

Blocking Probability Evaluation for Non-Hierarchical Overflow Loss Systems

Non-hierarchical overflow loss systems (NH-OLSs) with mutual overflow have applications in many telecommunications and service systems, e.g., cellular networks, video-on-demand, emergency healthcare, or cloud services. In this paper, we make fundamental contributions in teletraffic modeling for blocking probability evaluation in NH-OLSs. These are based on the development of the well-known decomposition methodology, which decomposes an NH-OLS into independent subsystems and applies a suitable node model to each subsystem. In particular, we provide new both theoretical and numerical results involving both new and existing approximation methods. We show that these results cover a broad range of NH-OLSs, including those with heterogeneous arrival processes, server group size, and/or routing, with both Poisson and non-Poisson arrivals of fresh requests. Our theoretical results include the first scalable asymptotic exactness results for NH-OLSs. Our new approximations include the first computationally efficient and fairly accurate approximation for NH-OLSs with both mutual overflow and non-Poisson input with asymptotic exactness properties.

Evaluation of teletraffic queueing model under Burr type XII service distribution

Tele-traffic is related to internet and other complex telecommunications systems. They include packet sizes, inter-arrival times, download times and transmission times, among others. Such times are followed by heavy tailed distribution. In this concern, the study of special type of M/G/1 queueing model with Burr type XII distribution is proposed for applications in tele-traffic. The limiting distribution, expected waiting time and expected busy period time are derived by using conventional technique. Finally the computational performances are carried out for evaluating this model.

Модели телетрафика на основе современной теории массового обслуживания

Модели телетрафика на основе современной теории массового обслуживания

On the Queue Length Distribution in BMAP Systems

Batch Markovian Arrival Process – BMAP – is a teletraffic model which combines high ability to imitate complexstatistical behaviour of network traces with relative simplicity in analysis and simulation. It is also a generalization of a wide class of Markovian processes, a class which in particular include the Poisson process, the compound Poisson process, the Markovmodulated Poisson process, the phase-type renewal process and others. In this paper we study the main queueing performance characteristic of a finite-buffer queue fed by the BMAP, namely the queue length distribution. In particular, we show a formula for the Laplace transform of the queue length distribution. The main benefit of this formula is that it may be used to obtain both transient and stationary characteristics. To demonstrate this, several numerical results are presented.

Selection of Plan of Experiment by Statistical Analysis of the Parameters of Teletraffic Model with Voice Services

Selection of Plan of Experiment by Statistical Analysis of the Parameters of Teletraffic Model with Voice Services

Quality of service differentiation in heterogeneous CDMA networks: a mathematical modelling approach

Next-generation cellular networks are expected to enable the coexistence of macro and small cells, and to support differentiated quality-of-service (QoS) of mobile applications. Under such conditions in the cell, due to a wide range of supported services and high dependencies on efficient vertical and horizontal handovers, appropriate management of handover traffic is very crucial. Furthermore, new emerging technologies, such as cloud radio access networks (C-RAN) and self-organizing networks (SON), provide good implementation and deployment opportunities for novel functions and services. We design a multi-threshold teletraffic model for heterogeneous code division multiple access (CDMA) networks that enable QoS differentiation of handover traffic when elastic and adaptive services are present. Facilitated by this model, it is possible to calculate important performance metrics for handover and new calls, such as call blocking probabilities, throughput, and radio resource utilization. This can be achieved by modelling the cellular CDMA system as a continuous-time Markov chain. After that, the determination of state probabilities in the cellular system can be performed via a recursive and efficient formula. We present the applicability framework for our proposed approach, that takes into account advances in C-RAN and SON technologies. We also evaluate the accuracy of our model using simulations and find it very satisfactory. Furthermore, experiments on commodity hardware show algorithm running times in the order of few hundreds of milliseconds, which makes it highly applicable for accurate cellular network dimensioning and radio resource management.

A teletraffic model for the Physical Downlink Control Channel in LTE

Recent advances in mobile handsets have led to new trends in mobile broadband data consumption, with a huge increase of signaling traffic generated by always-connected devices. Thus, a proper planning of control channels in mobile networks is necessary to avoid network capacity problems and provide an appropriate quality of service to the end user. A key issue in network planning is the availability of a complete and accurate system model. In this paper, an analytical performance model for the Long Term Evolution (LTE) Physical Downlink Control Channel (PDCCH) is constructed based on queuing theory. Unlike previous works, the proposed model considers important network features, such as link adaptation, and can be tuned with available network performance statistics. Model assessment is carried out by comparing performance estimates with request-level simulations and real performance measurements taken from a live LTE network. Results show that the proposed model can predict the PDCCH load distribution in a live network accurately.

Analisis Trafik Telekomunikasi Menggunakan Model Sistem Sharing

The fast progress in telecommunication, especially in data communication, makes anyone get the information they need easily. It also makes more traffic in the channel. The intensity of the traffic is one of the parameters that considered by the IT unit. In this paper, the intensity of the traffic in institution A is calculated using Sharing System Teletraffic Model. As the result, the arrival rate and service rate are 1,129,139 bits per second and 16.566.740 bits per second. Keywords — telecommunication traffic, sharing system, internet

Teletraffic Model for K-fold Multicast Network: Performance Evaluation with Buffer using M/M/n/n+q/N Kendal’s Notation

Teletraffic Model for K-fold Multicast Network: Performance Evaluation with Buffer using M/M/n/n+q/N Kendal’s Notation

Transportation mobility management

Today, the world has observed a remarkable growth in the use of transportation mobile communications for road safety. While a user in a vehicle moves to a new communication cell, a wireless terminal requests a handoff for new channel in the new cell. Due to that movement, some of the challenges issues are developed such as, the increase in traffic volumes and demand for high speed transportation mobile communications call for fast, seamless and high performance handoff in mobile communications network. When a wireless user in a vehicle moves from one base station cell to another, handoff protocols reroute the existing active connections in the new transportation cell. The future challenges in next generation high speed transportation mobile networks are to minimize the packet loss and to provide efficient use of the network resources while maintaining quality of service assurances. Therefore, the performance of efficient management and a successful handoff operation in transportation mobile networks become an important issue for road safety traffic. This work shows analytical handoff management for transportation users in a high speed mobile communications network. We demonstrate the performance of handoffs with mobility consideration using several metrics including the alteration of states prior to reaching a transportation mobility cell boundary, the speed of transportation mobile terminal, and the distance between a transportation mobile terminal and a transportation cell boundary. We illustrate the performance evaluation for the factor of transportation mobility with taking into account the high speed status of a mobile vehicle user. Numerical results of the transportation performance analysis and the probability of requiring a handoff are demonstrated using Maple. Figure 1 shows a shaped region of a cellular network and the cellular handoff model with mobility. In this abstract, we modeled the cellular handoff for multimedia users with taking the high speed mobility into account in wireless mobile networks. The performance results in terms of state probabilities and the probability that a mobile terminal reached a cell boundary were investigated. The mobilized analysis involved with number of issues such as the alternation of states before a mobile unit reached a cell boundary, the distance between the mobile terminal and a cell boundary and the speed of the vehicle. Based on the assumption of the alternation of states, there were four situations for a vehicle to reach a cell boundary. Performance results were accurately analyzed based on these four situations. It was clearly showing that for a vehicle that experienced the change of states, the outcome chance of reaching a cell boundary was proportional to the distance in between the mobile terminal and a cell boundary and inversely propositional to the speed of the vehicle.

Measuring QoS Metrics in Femto/Macro Cellular Networks with CAC Policy

Due to the growing importance of deploying femtocell technology in the current mobile network operators, data traffic processing and handover (HO) management in such networks are challenging issues. Consequently, due to the mobility of femto users between indoor and outdoor environments, the HO traffic interplay between macrocell and femtocells should be addressed, by determining accurate HO rate and actual channel holding time. Classical methods for data traffic process and HO management cannot directly apply in such network. In this paper, we propose an adaptive call admission control (CAC) policy based on a pre-reservation (PR) area as well as we employ the concept of adaptive reserved channel to accomplish quality of service (QoS) requirements for handover traffic requests. A teletraffic model based on queuing theory and Markov chains will allow us to evaluate and quantify QoS metrics performance of the proposed scheme. The numerical results reveal that the benefits of femtocell technology integration with the current macrocellular mobile networks, especially in reducing the traffic loads of macrocell in terms of minimizing blocking probability.

Backhaul metro cell-based guard channel in femto/macro cellular heterogeneous networks

The heterogeneous network (HetNet) deployed small cells technology in order to overcome the problems of holes "blind spots" coverage in 3G and 4G mobile networks. In this work, we propose a hierarchical HetNet layout comprises of three layers, macro, metro and femto cells. The metro cell is deployed as a backhaul layer in-between macro cell and femto cell layers and operates in a complementary fashion to fulfill handover (HO) traffic interplay between successive layers. Accordingly, the femto cell serves indoor traffic activity of femto users, while metro cell serves the outdoor traffic activities as well as the overflow traffic from femto cells. In addition, in order to reduce the failure probability of femto users handed over to metro cell, a guard channel scheme is employed to prioritize the HO call over new call requests. The highest layer in HetNet, macro cell only serves macro users and the overflowed traffic from the lower layer. Then, we develop a realistic teletraffic model in order to measure the QoS metrics of the proposed HetNet. The numerical results show the capability of HetNet with coexisting small cells to offload traffic from traditional macro cellular network in terms of reducing the blocking probability.

Performance metrics of a multirate resource sharing teletraffic model with finite sources under the threshold and bandwidth reservation policies

The authors propose a new multirate teletraffic loss model of a single link with certain capacity that accommodates different service-classes whose calls come from finite traffic sources. Calls compete for the available link bandwidth under the combination of the threshold (TH) and the bandwidth reservation (BR) policies. The TH policy can provide different quality of service among service-classes by limiting calls of each service-class up to a certain number, which is a predefined TH, which can be different for each service-class. The BR policy reserves part of the available link bandwidth to benefit calls of high bandwidth requirements. They show that the proposed model, without the BR policy, has a product form solution (PFS) and prove recursive formulas for the efficient calculation of the call-level performance metrics, such as time and call congestion probabilities as well as link utilisation. The combination of the TH and BR policies destroys the PFS of the model. However, they show that approximate but recursive formulas still exist for the efficient calculation of the call-level performance metrics. The accuracy of the proposed formulas is verified through simulation and found to be very satisfactory.

A Performance Analysis Framework for WiFi/WiMAX Heterogeneous Metropolitan Networks Based on Cross-Layer Design

The communication between network nodes within different protocol domains is often regarded simply as a black box with unknown configuration conditions in the path. We address network heterogeneity using a white box approach and focus on its interconnection processes. To achieve this purpose, a Performance Analysis Framework (PAF) is proposed which is composed of the formalization of the latter using process algebra (PA) and the corresponding teletraffic performance models. In this contribution, we target the IEEE 802.16 and IEEE 802.11 protocols. For the teletraffic models, we extend previous models for such scenario with the inclusion of the following protocol operational parameters (metrics): bit error rate (BER), packet error ratio (PER), and packet length (pl). From the framework teletraffic models, the optimal packet length (OPL), end to end throughput, delay, and packet loss are obtained. The PAF outperforms previous modeling solutions in terms of delay and throughput relative to NS3 simulation results.

Joint Connection Level and Packet Level Analysis of Cognitive Radio Networks with VoIP Traffic

In this paper, a novel joint connection-level and packet-level analytical model for the performance evaluation of cognitive radio networks (CRNs) under VoIP traffic is proposed and developed. The proposed teletraffic model captures the most relevant features of both CRNs (i.e., unreliable spectrum sensing, primary users' activity detection) and VoIP traffic (i.e., ON/OFF activity processes for individual VoIP sessions, periodic packet generation of individual VoIP sessions in the ON state). In addition, our mathematical model captures relevant aspects of multiuser VoIP-based networks such as the use of packet buffering, adaptive modulation coding, proportional fair sharing scheduling for secondary users with different link qualities, and call admission control (CAC). Our mathematical analysis is based on the time-scale decomposition technique and employs conventional discrete time Markov chain tools. However, the most important feature of our mathematical formulation is the introduction of the so called cross-level analysis methodology used here to link packet-level and connection-level analyses. This proposed methodology allows to use time-scale decomposition technique when it is no longer possible to perform the connection level analysis in an independent manner from the packet level analysis (i.e., when connection level statistics depend on packet level parameters).

Application of teletraffic engineering modelling techniques for studying smart lighting systems for energy saving

Limited natural energy resources compel humankind to search for efficient utilization of energy, and thus increasing number of fluorescent lamps are adopted for lighting systems. However, previous study showed that there exists a tradeoff between energy saving and lifespan for fluorescent lamps. Consequently, it becomes an important topic on how to design an efficient and effective automatic control algorithm in illuminating engineering. This problem has been traditionally studied by conducting surveys and experiments, which are unavoidably costly and rather time-consuming. This paper presents a novel application of teletraffic engineering modelling techniques in studying automatic lighting control systems. A queuing model is proposed to study typical lighting systems and a simple closed-loop algorithm is illustrated to effectively adapt the system control parameters. Through computer simulation, it is shown that the proposed method provides an alternative way of studying lighting systems in a cost-effective manner, while providing adequate accuracy.

SUPPORTING DISTRESS SIGNALS OVER LOW EARTH ORBIT MOBILE SATELLITE SYSTEMS FOR EMERGENCY INFORMATION ACQUISITION

Low earth orbit (LEO) satellite systems allow a broad range of services to be provided using small, lightweight, cellular-like portable telephones. Exploiting LEO satellites to support distress signals for aircrafts, ships and international travelers is explored in the current paper. A multi-service priority-oriented algorithm is proposed for handling voice, data and emergency signals over LEO satellites. The emergency signal is privileged with service priority so that rescue operation can be carried out as soon as possible. The priority mechanism includes channel reservation as well as joining a queue if no free channel is available as long as the request is roaming in the handover area. In addition, a simplified but efficient approach is suggested for locating the object of an imminent danger situation. As LEO satellites are non-geostationary, the visible period of each spot-beam is small. Consequently, a teletraffic model, that accommodates the mobility of spot-beams as well as the resulting handover rate, is developed in order to gauge the performance of the proposed algorithm. Numerical results for access denying and service-dropping rates are presented for nominal system parameters.