Throughput of DS‐CDMA/unslotted ALOHA radio networks with Markovian arrival processes

Previous works on the throughput analysis of the direct sequence‐code division multiple access/unslotted ALOHA radio network all used the Poisson arrival process (PAP). However, the interarrival times of PAP are independent, so it is not suited to model today's Internet and multimedia traffic, which have correlated interarrival times. We are motivated to use the Markovian arrival process (MAP), a more general input traffic model that captures the correlation of interarrival times. We are the first to analyze the throughput of the direct sequence‐code division multiple access/unslotted ALOHA radio network with MAP. We propose the use of MAP, which encompasses the PAP as a special case. The new MAP model basically generalizes the current traffic and queuing models of multimedia in wireless networks. Copyright © 2011 John Wiley & Sons, Ltd.     

An Analytical Approach to Obtain the Interdeparture Time Characteristics in a Multistage VoIP Network

In this paper, we investigate the evolution of the interarrival and interdeparture times between voice packets when they are proceeding through a number of network nodes. We model the arrival process in a node as the superposition of a single tagged stream and an independent background process that aggregates the remaining traffic sources. Because we assume that the load of a single voice stream is very low compared to the load of the aggregate traffic, we can represent the tagged voice packets as markers (packets with size zero). We will establish an expression for the probability generating function (pgf) of the interdeparture time of the voice packets after one stage and use this interdeparture-time pgf as the pgf of the interarrival time of the voice packets in the next stage, in order to assess the evolution of the interarrival-time characteristics throughout the network.     

Optimal channel assignment strategies for forced channel hopping in CDPD systems

To provide an acceptable call blocking probability in circuit-switched cellular networks, such as the Advanced Mobile Phone System (AMPS) networks, a significant fraction of the channel capacity in each cell is normally unused. This “free” capacity can be effectively used for packet data transmissions that yield to voice traffic when necessary. Cellular Digital Packet Data (CDPD) is a packet-switched data service which may share radio channels with the AMPS service on a secondary basis to tap this “free” capacity. The length of time that a CDPD stream can occupy a channel is greatly influenced by the channel assignment strategies of both the AMPS and the CDPD systems. This paper investigates these channel assignment strategies and their effects on the CDPD channel holding times, in comparison with the optimal channel assignment strategy that interrupts the CDPD service only when a new AMPS call finds no other idle channels in the cell site. One such optimal strategy is the cooperative strategy in which the CDPD and AMPS networks actively communicate with each other. It is shown that other optimal strategies exist without the need of communications between the two systems. The effects of AMPS traffic levels, number of channels, and number of CDPD streams at the cell site on the CDPD channel holding time and channel utilization are also considered. This revised version was published online in June 2006 with corrections to the Cover Date.     

Optimal channel assignment strategies for forced channel hopping in CDPD systems

To provide an acceptable call blocking probability in circuit-switched cellular networks, such as the Advanced Mobile Phone System (AMPS) networks, a significant fraction of the channel capacity in each cell is normally unused. This “free” capacity can be effectively used for packet data transmissions that yield to voice traffic when necessary. Cellular Digital Packet Data (CDPD) is a packet-switched data service which may share radio channels with the AMPS service on a secondary basis to tap this “free” capacity. The length of time that a CDPD stream can occupy a channel is greatly influenced by the channel assignment strategies of both the AMPS and the CDPD systems. This paper investigates these channel assignment strategies and their effects on the CDPD channel holding times, in comparison with the optimal channel assignment strategy that interrupts the CDPD service only when a new AMPS call finds no other idle channels in the cell site. One such optimal strategy is the cooperative strategy in which the CDPD and AMPS networks actively communicate with each other. It is shown that other optimal strategies exist without the need of communications between the two systems. The effects of AMPS traffic levels, number of channels, and number of CDPD streams at the cell site on the CDPD channel holding time and channel utilization are also considered. This revised version was published online in June 2006 with corrections to the Cover Date.     

User behavior modeling of voice communications: an empirical study

In this study, analysis and modeling of arrival and service processes are presented in a comprehensive fashion in order to determine statistical properties of voice traffic from end‐user perspective in accordance with the queueing theory. For the first time in the literature, we introduce a user centric approach and examine these services considering both flow directions of voice traffic, the uplink and the downlink as opposed to existing studies with the network centric approach. In our study, we use experimental data composed of actual phone calls collected from 2G/3G networks. To achieve this, we designed and implemented a data collection system for mobile users and compared the results by using data from an operational cellular network. In order to determine the time correlation of voice calls, Hurst parameter estimation methods are used. On the basis of the outcomes, independency of call arrivals is shown. Additionally, it is shown that calls acquired from user and network centric approaches are both Poisson distributed. Next, looking at the problem from service process perspective, thorough analyses are performed to determine mathematical models that can best characterize call holding times. Maximum likelihood estimation and expectation maximization algorithm are used, and it is shown that the optimum mathematical model for the characterization of call holding times is the lognormal distribution family. Copyright © 2014 John Wiley & Sons, Ltd.     

A call admission control for service differentiation and fairness management in WDM grooming networks

We investigate a call admission control (CAC) mechanism for providing fairness control and service differentiation in a WDM network with grooming capabilities. A WDM grooming network can handle different classes of traffic streams which differ in their bandwidth requirements. We assume that for each class, call interarrival and holding times are exponentially distributed. Using a Markov Decision Process approach, an optimal CAC policy is derived for providing fairness in the network. The Policy Iteration algorithm is used to numerically compute the optimal policy. Furthermore, we propose a heuristic decomposition algorithm with lower computational complexity and good performance. Simulation results compare the performance of our proposed policy with those of Complete Sharing and Complete Partitioning policies. Comparisons show that our proposed policy provides the best performance in most cases. Although this approach is motivated by WDM networks, it may be deployed to determine the optimal resource allocation in many problems in wireless and wired telecommunications systems.     

Evolving public safety communication systems by integrating WLAN and TETRA networks

This article contributes to the evolution of public safety communication systems by specifying a novel solution for integrating WLAN and Terrestrial Trunked Radio (TETRA) networks. The specified solution allows TETRA terminals to interface to the TETRA Switching and Management Infrastructure (SwMI) over a broadband WLAN radio access network, instead of the conventional narrowband TETRA radio network. These terminals are fully interoperable with conventional TETRA terminals and can employ all TETRA services, including group calls, short data messaging, packet data, and so forth. In addition, however, such terminals can support a range of brand new capabilities enabled by the WLAN, such as broadband data services, true concurrent voice and data services, simultaneous reception of many group calls, reduced call setup and voice transmission delays, improved voice quality, and so forth. The specified solution is solely based on IP multicast and Voice-over-IP (VoIP) technologies and thus fits ideally to the all-IP architecture being introduced by the MESA project for the next generation of public safety and disaster relief communication systems.     

Modeling call holding time distributions for CCS network design andperformance analysis

The message traffic offered to the CCS signaling network depends on and is modulated by the traffic characteristics of the circuit switched calls supported by the CCS network. Most previous analyses of CCS network engineering, performance evaluation and congestion control protocols generally assume an exponential holding time of circuit switched calls. Analysis of actual holding time distributions in conversations, facsimile and voice mail connections revealed that these distributions radically differ from the exponential distribution. Especially significant is the large proportion of very short calls in real traffic in comparison with the exponential distribution model. The diversity of calls (partial dialing, subscriber busy, no answer) and services results in a multi-component call mix, with even larger proportion of short time intervals between message-generating events. Very short call holding times can have a significant impact on the traffic stream presented to the CCS network: for calls with short holding times, the different CCS messages arrive relatively close to each other, and this manifests as burstiness in the CCS traffic stream     

Effect of AMC on fixed‐rate traffic with hard delay constraints in mobile broadband systems

The adaptive modulation and coding (AMC) technique, which has been adopted by advanced mobile telecommunication systems, supports a flexible response to the random radio behaviour. As a result, the attained transmission rate over a wireless link is time varying. Hence, resource demands are not deterministic but fluctuating even for calls with constant bit rate service requirements. Consequently, constant bit rate calls are susceptible to a forced call termination because of insufficient resources not only in a target cell during inter‐cell handoffs but also in a serving cell during radio link deterioration. Furthermore, call blocking and dropping probabilities depend on radio propagation conditions among other factors and therefore they are dissimilar throughout a service area. The latter leads to unfairness problems. We analytically measure the impact of AMC on fixed‐rate service with hard delay constraints such as voice for different signal, mobility and traffic conditions. We consider a reference case (call requests are admitted into the system provided there are enough free resources) and two classes of admission control approaches: traditional (only inter‐cell handoffs are prioritised) and modified (all ongoing calls are prioritised). The reported results reveal conditions for which AMC affects voice call performance and can serve as guidelines on admission control design. Copyright © 2013 John Wiley & Sons, Ltd.     

基于排队理论的信道分配算法研究

针对蜂窝移动通信系统,基于排队理论提出了一种信道分配方案。该方案将信道分为2部分:语音信道和数据保护信道。预留数据保护信道用于补偿数据丢包率,同时对语音业务设置FIFO排队缓冲器,切换呼叫优先占用缓冲器以确保切换优先。当语音信道空闲时,数据业务可以占用语音信道,一旦有语音呼叫请求到来且无可用语音信道,数据业务应释放占用的语音信道,在数据缓存器中排队等待。仿真结果表明该方案不仅降低了新增呼叫阻塞率和切换掉话率,而且提升了数据业务的性能。     

Multimedia traffic characteristics in broadband networks

It is pertinent to develop a set of simple parameters that can best characterize the variability and the statistical correlations of the packet arrival process. These parameters are then used by the network to allocate its resources among the different users in order to avoid congestion and maintain a predefined quality of service (QOS) for each user. The traffic characterization and modeling of the real-time bursty traffic, mainly voice and video traffic sources, using statistical methods are described. It is shown that the variability of the variance of the sum of consecutive packet interarrival times leads to significant queuing delays and therefore is a major cause of congestion in broadband networks     

Output and delay process analysis for slotted CDMA wirelesscommunication networks with integrated voice/data transmission

This paper presents the output and delay process analysis of integrated voice/data slotted code division multiple access (CDMA) network systems with random access protocol for packet radio communications. The system model consists of a finite number of users, and each user can be a source of both voice traffic and data traffic. The allocation of codes to voice calls is given priority over that to data packets, while an admission control, which restricts the maximum number of codes available to voice sources, is considered for voice traffic so as not to monopolize the resource. Such codes allocated exclusively to voice calls are called voice codes. In addition, the system monitoring can distinguish between silent and talkspurt periods of voice sources, so that users with data packets can use the voice codes for transmission if the voice sources are silent. A discrete-time Markov process is used to model the system operation, and an exact analysis is presented to derive the moment generating functions of the probability distributions for packet departures of both voice and data traffic and for the data packet delay. For some cases with different numbers of voice codes, numerical results display the correlation coefficient of the voice and data packet departures and the coefficient of variation of the data packet delay as well as average performance measures, such as the throughput, the average delay of data packets, and the average blocking probability of voice calls     

Voice over ATM using AAL2 and bit dropping: performance and calladmission control

Asynchronous transfer mode (ATM) adaptation layer 2 (AAL2) has been designed for efficient transport of voice, fax, and voiceband data (VBD) traffic over an ATM virtual circuit. The protocol helps achieve low latency and high bandwidth efficiency while applying suitable compression methods on voice/VBD/fax calls and silence elimination on voice calls. We analyze the performance and capacity of an ATM multiplexer based on AAL2 adaptation. We assume that embedded adaptive differential pulse code modulation (ADPCM) is used to compress voice, and silence elimination is used to achieve statistical multiplexing gain. The embedded ADPCM coding scheme allows selective dropping of less significant bits of voice during congestion in the ATM/AAL2 multiplexer. We compare the call capacities of voice multiplexers with and without bit dropping (BD). The performance models and results presented are based on fairly general assumptions and can be used for traffic engineering and call admission control in land-line or wireless ATM systems for a variety of voice/voiceband compression algorithms. A generalized algorithm for call admission control is also described     

An application of Markovian arrival process (MAP) to modelingsuperposed ATM cell streams

First, we propose a new modeling method for superposed ATM traffic by the MMPP(2), which is a special case of the MAP(2). In this new method, we measure the mean and autocorrelation of cell interarrival times, and the histogram of the number of arrivals during measurement windows of fixed size. The MMPP(2) has interarrival times with a second-order hyper-exponential distribution with coefficient of variation c_ν > 1. However, superposed traffic is often observed to have c_ν < 1. To cover this situation, we extend the MMPP(2) to a MAP(3) by adding a new state with inter-state transition accompanied by an arrival. For the MAP(3) model, we take into account the second moment of the interarrival times. From numerical examples, we observe that both the proposed MMPP(2) and MAP(3) yields very good estimation of the cell loss ratio (CLR) for usual superpositions of voice and/or VBR video sources. However, when we have superpositions from CBR video sources together with other VBR sources, c _ν. is much less than 1, and the MAP(3) outperform the MMPP(2), as expected. The proposed MAP(3) well characterizes the cell scale component as well as the burst scale component of superposed traffic streams     

Hybrid channel assignment scheme for accommodating voice/datatraffic in DS-CDMA cellular systems

A hybrid channel assignment (HCA) scheme in direct sequence-code division multiple access (DS-CDMA) systems for accommodating integrated voice/data traffic is proposed and the required power levels of voice and data traffic are derived. These levels can be used to maintain the minimum required link qualities of all calls. In the proposed scheme, delay-sensitive voice traffic is accommodated in circuit mode and delay-nonsensitive data traffic is accommodated in packet mode. The capacity region is derived and it can be used for controlling voice call admission and scheduling data packets. The proposed scheme can achieve a high link efficiency with reduced control overhead by statistically multiplexing voice and data traffic     

A Homogeneous PCS network with Markov Call Arrival Process and Phase Type Cell Residence Time

In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow correlation of the interarrival times among new calls, among handoff calls, as well as between these two kinds of calls. The PCS network consists of homogeneous cells and each cell consists of a finite number of channels. Under the conditions that both cell's residence time and the requested call holding time possess the general phase type (PH) distribution, we obtain the distribution of the channel holding times, the new call blocking probability and the handoff call failure probability. Furthermore, we prove that the cell residence time is PH distribution if and only if the new call channel holding time is PH distribution; or the handoff call channel holding time is PH distribution; or the call channel holding time is PH distribution;provided that the requested call holding time is a PH distribution and the total call arrival process is a MAP. Also, we prove that the actual call holding time of a non-blocked new call is a mixture of PH distributions. We then developed the Markov process for describing the system and found the complexity of this Markov process. Finally, two interesting measures for the network users, i.e., the duration of new call blocking period and the duration of handoff call blocking period, are introduced; their distributions and the expectations are then obtained explicitly.     

Soft QoS in Call Admission Control for Wireless Personal Communications

In wireless multimedia communication systems, call admission control (CAC) is critical for simultaneously achieving a high resource utilization efficiency and maintaining quality-of-service (QoS) to mobile users. User mobility, heterogeneous nature of multimedia traffic, and limited radio spectrum pose significant challenges to CAC. QoS provisioning to both new calls and handoff calls comes with a cost of low resource utilization. This paper proposes a CAC policy for a wireless communication system supporting integrated voice and dataservices. In particular, soft QoS (or relaxed target QoS) is incorporated in the CAC policy to make compromises among different objectives.Numerical results are presented to demonstrate that (a) in dealing with the dilemma between QoS satisfaction and high resource utilization, how the resource utilization efficiency can be increased by introducing soft QoS; and (b) in accommodating different types of traffic, how the QoS of low priority traffic can be improved by specifying soft QoS to high priority traffic.     

Radio Resource Allocation for Scalable Video Services Over Wireless Cellular Networks

Good quality video services always require higher bandwidth. Hence, to provide the video services e.g., multicast/broadcast services (MBSs) and unicast services along with the existing voice, internet, and other background traffic services over the wireless cellular networks, it is required to efficiently manage the wireless resources in order to reduce the overall forced call termination probability, to maximize the overall service quality, and to maximize the revenue. Fixed bandwidth allocation for the MBS sessions either reduces the quality of the MBS videos and bandwidth utilization or increases the overall forced call termination probability and of course the handover call dropping probability as well. Scalable video coding (SVC) technique allows the variable bit rate allocation for the video services. In this paper, we propose a bandwidth allocation scheme that efficiently allocates bandwidth among the MBS sessions and the non-MBS traffic calls (e.g., voice, unicast, internet, and other background traffic). The proposed scheme reduces the bandwidth allocation for the MBS sessions during the congested traffic condition only to accommodate more calls in the system. Instead of allocating fixed bandwidths for the MBS sessions and the non-MBS traffic, our scheme allocates variable bandwidths for them. However, the minimum quality of the videos is guaranteed by allocating minimum bandwidth for them. Using the mathematical and numerical analyses, we show that the proposed scheme maximizes the bandwidth utilization and significantly reduces the overall forced call termination probability as well as the handover call dropping probability.     

On the impact of IEEE 802.11 MAC on traffic characteristics

IEEE 802.11 medium access control (MAC) is gaining widespread popularity as a layer-2 protocol for wireless local-area networks. While efforts have been made previously to evaluate the performance of various protocols in wireless networks and to evaluate the capacity of wireless networks, very little is understood or known about the traffic characteristics of wireless networks. In this paper, we address this issue and first develop an analytic model to characterize the interarrival time distribution of traffic in wireless networks with fixed base stations or ad hoc networks using the 802.11 MAC. Our analytic model and supporting simulation results show that the 802.11 MAC can induce pacing in the traffic and the resulting interarrival times are best characterized by a multimodal distribution. This is a sharp departure from behavior in wired networks and can significantly alter the second order characteristics of the traffic, which forms the second part of our study. Through simulations, we show that while the traffic patterns at the individual sources are more consistent with long-range dependence and self-similarity, in contrast to wired networks, the aggregate traffic is not self-similar. The aggregate traffic is better classified as a multifractal process and we conjecture that the various peaks of the multimodal interarrival time distribution have a direct contribution to the differing scaling exponents at various timescales.     

Voice/Data Integrated Wireless Channel Access in Third Generation Digital Cellular Networks: The Performance of Bursty Data Generated by Interactive Applications

Mobile wireless communications, which includecellular telephones, land mobile radio, and personalcommunications systems, have experienced enormous growthover the last decade. Data services represent a critical component of future wirelesscommunications, but have received little attention sofar. While some attention has been given to specializedmobile data networks, less has been directed at the ongoing design of data services in evolvingthird generation digital cellular wireless networks. Inthis work we present the results of a simulation studythat explores the performance of a Reservation Random Access (RRA) scheme for transmittingdata packets over a common radio broadcast channel in acellular radio environment. In addition to voicetraffic, we consider data packet traffic generated by interactive applications. It is expected thatsuch applications will be very important in thirdgeneration wireless access mobile communication systems.Through an extensive simulation study of the data message delay distribution, we show that theproposed RRA scheme, originally designed under thePoisson data message arrival process assumption, canalso efficiently operate and be optimized under theextremely bursty data message arrival processcharacterized by independent, identically distributed,Pareto message interarrival times.