222 research outputs found

    Modeling and Analysis of Channel Holding Time and Handoff Rate for Packet Sessions in All-IP Cellular Networks

    Get PDF
    It is essential to model channel holding time (CHT), cell residence time (CRT), and handoff rate for performance analysis and algorithm evaluation in mobile cellular networks. The problem has been extensively studied in the past for circuit-switched (CS) cellular networks. However, little research has been done on packet-switched (PS) cellular networks. Unlike that a call occupies a dedicated channel during its whole lifetime in CS networks, an active session in PS networks occupies and releases channels iteratively due to discontinuous reception (DRX) mechanism. In this paper, we investigate the key quantities in PS cellular networks. We present a set of comprehensive new models to characterize the quantities and their relationship in PS networks. The models shed light on the relationship between CHT and CRT and handoff rate. The analytical results enable wide applicability in various scenarios and therefore have important theoretical significance. Moreover, the analytical results provide a quick way to evaluate traffic performance and system design in PS cellular networks without wide deployment, which can save cost and time

    STOCHASTIC MODELING AND TIME-TO-EVENT ANALYSIS OF VOIP TRAFFIC

    Get PDF
    Voice over IP (VoIP) systems are gaining increased popularity due to the cost effectiveness, ease of management, and enhanced features and capabilities. Both enterprises and carriers are deploying VoIP systems to replace their TDM-based legacy voice networks. However, the lack of engineering models for VoIP systems has been realized by many researchers, especially for large-scale networks. The purpose of traffic engineering is to minimize call blocking probability and maximize resource utilization. The current traffic engineering models are inherited from the legacy PSTN world, and these models fall short from capturing the characteristics of new traffic patterns. The objective of this research is to develop a traffic engineering model for modern VoIP networks. We studied the traffic on a large-scale VoIP network and collected several billions of call information. Our analysis shows that the traditional traffic engineering approach based on the Poisson call arrival process and exponential holding time fails to capture the modern telecommunication systems accurately. We developed a new framework for modeling call arrivals as a non-homogeneous Poisson process, and we further enhanced the model by providing a Gaussian approximation for the cases of heavy traffic condition on large-scale networks. In the second phase of the research, we followed a new time-to-event survival analysis approach to model call holding time as a generalized gamma distribution and we introduced a Call Cease Rate function to model the call durations. The modeling and statistical work of the Call Arrival model and the Call Holding Time model is constructed, verified and validated using hundreds of millions of real call information collected from an operational VoIP carrier network. The traffic data is a mixture of residential, business, and wireless traffic. Therefore, our proposed models can be applied to any modern telecommunication system. We also conducted sensitivity analysis of model parameters and performed statistical tests on the robustness of the models’ assumptions. We implemented the models in a new simulation-based traffic engineering system called VoIP Traffic Engineering Simulator (VSIM). Advanced statistical and stochastic techniques were used in building VSIM system. The core of VSIM is a simulation system that consists of two different simulation engines: the NHPP parametric simulation engine and the non-parametric simulation engine. In addition, VSIM provides several subsystems for traffic data collection, processing, statistical modeling, model parameter estimation, graph generation, and traffic prediction. VSIM is capable of extracting traffic data from a live VoIP network, processing and storing the extracted information, and then feeding it into one of the simulation engines which in turn provides resource optimization and quality of service reports

    Flow Level QoE of Video Streaming in Wireless Networks

    Full text link
    The Quality of Experience (QoE) of streaming service is often degraded by frequent playback interruptions. To mitigate the interruptions, the media player prefetches streaming contents before starting playback, at a cost of delay. We study the QoE of streaming from the perspective of flow dynamics. First, a framework is developed for QoE when streaming users join the network randomly and leave after downloading completion. We compute the distribution of prefetching delay using partial differential equations (PDEs), and the probability generating function of playout buffer starvations using ordinary differential equations (ODEs) for CBR streaming. Second, we extend our framework to characterize the throughput variation caused by opportunistic scheduling at the base station, and the playback variation of VBR streaming. Our study reveals that the flow dynamics is the fundamental reason of playback starvation. The QoE of streaming service is dominated by the first moments such as the average throughput of opportunistic scheduling and the mean playback rate. While the variances of throughput and playback rate have very limited impact on starvation behavior.Comment: 14 page

    Queueing Networks for Vertical Handover

    Get PDF
    PhDIt is widely expected that next-generation wireless communication systems will be heterogeneous, integrating a wide variety of wireless access networks. Of particular interest recently is a mix of cellular networks (GSM/GPRS and WCDMA) and wireless local area networks (WLANs) to provide complementary features in terms of coverage, capacity and mobility support. If cellular/ WLAN interworking is to be the basis for a heterogeneous network then the analysis of complex handover traffic rates in the system (especially vertical handover) is one of the most essential issues to be considered. This thesis describes the application of queueing-network theory to the modelling of this heterogeneous wireless overlay system. A network of queues (or queueing network) is a powerful mathematical tool in the performance evaluation of many large-scale engineering systems. It has been used in the modelling of hierarchically structured cellular wireless networks with much success, including queueing network modelling in the study of cellular/ WLAN interworking systems. In the process of queueing network modelling, obtaining the network topology of a system is usually the first step in the construction of a good model, but this topology analysis has never before been used in the handover traffic study in heterogeneous overlay wireless networks. In this thesis, a new topology scheme to facilitate the analysis of handover traffic is proposed. The structural similarity between hierarchical cellular structure and heterogeneous wireless overlay networks is also compared. By replacing the microcells with WLANs in a hierarchical structure, the interworking system is modelled as an open network of Erlang loss systems and with the new topology, the performance measures of blocking probabilities and dropping probabilities can be determined. Both homogeneous and non-homogeneous traffic have been considered, circuit switched and packet-switched. Example scenarios have been used to validate the models, the numerical results showing clear agreement with the known validation scenarios

    Monotonicity and error bounds for networks of Erlang loss queues

    Get PDF
    Networks of Erlang loss queues naturally arise when modelling finite communication systems without delays, among which, most notably are (i) classical circuit switch telephone networks (loss networks) and (ii) present-day wireless mobile networks. Performance measures of interest such as loss probabilities or throughputs can be obtained from the steady state distribution. However, while this steady state distribution has a closed product form expression in the first case (loss networks), it does not have one in the second case due to blocked (and lost) handovers. Product form approximations are therefore suggested. These approximations are obtained by a combined modification of both the state space (by a hypercubic expansion) and the transition rates (by extra redial rates). It will be shown that these product form approximations lead to (1) upper bounds for loss probabilities and \ud (2) analytic error bounds for the accuracy of the approximation for various performance measures.\ud The proofs of these results rely upon both monotonicity results and an analytic error bound method as based on Markov reward theory. This combination and its technicalities are of interest by themselves. The technical conditions are worked out and verified for two specific applications:\ud (1)• pure loss networks as under (2)• GSM networks with fixed channel allocation as under.\ud The results are of practical interest for computational simplifications and, particularly, to guarantee that blocking probabilities do not exceed a given threshold such as for network dimensioning

    Design and Analysis of the Key Management Mechanism in Evolved Multimedia Broadcast/Multicast Service

    Get PDF
    3GPP introduced the key management mechanism (KMM) in evolved multimedia broadcast/multicast service (eMBMS) to provide forward security and backward security for multicast contents. In this paper, we point out that KMM may lead to frequent rekeying and re-authentication issues due to eMBMS's characteristics: 1) massive group members; 2) dynamic group topology; and 3) unexpected wireless disconnections. Such issues expose extra load for both user equipment (UE) terminals and mobile operators. It seems prolonging the rekeying interval is an intuitive solution to minimizing the impact of the issues. However, a long rekeying interval is not considered the best operational solution due to revenue loss of content providers. This paper quantifies the tradeoff between the load of the UEs and the operators as well as the revenue loss of the content providers. Moreover, we emphasize how essential this rekeying interval has impacts on the problems. Using our proposed tradeoff model, the operators can specify a suitable rekeying interval to best balance the interest between the above three parties. The tradeoff model is validated by extensive simulations and is demonstrated to be an effective approach for the tradeoff analysis and optimization on eMBMS
    corecore