Mobility management for m-commerce requests in wireless cellular networks

Increasing number of sophisticated services provided by the current wireless communication systems have caused a significant transition from E-commerce to M-commerce. Enterprises have provided considerable new opportunities to promote their businesses accessible from small mobile devices such as personal digital assistant (PDA) or mobiles phones. These facilities are envisioned as the most convenient way of using M-commerce. Using such services from mobile phones or PDAs equipped with GSM/GPRS involve effective mobility management mechanisms in cellular networks—a popular architecture for wireless networks. Success of such systems will largely depend on the reliable connection for the roaming users. Consequently, Quality of Service (QoS) provision is one of the most challenging issues in the heterogeneous wireless network-based m-commerce systems. Such m-commerce systems enable users to roam between different wireless networks operators and geographical areas while providing interactive broadband services and seamless connectivity. This paper presents an analytical framework to model scarce channels in any cell for maximizing channel utilization and efficient handling of handover requests. Typical numerical experiments are presented to validate the analytical solution against simulation to study the effect of bursty traffic upon the performance of the cell in any cellular networks.     

Numerical analysis of the power saving with a bursty traffic model in LTE-Advanced networks

We analyze the power saving operation called Discontinuous Reception (DRX) with a novel bursty packet arrival model in 3GPP Long Term Evolution (LTE)-Advanced networks. Typical analytical studies on the power saving operations in wireless networks have been carried out under the assumption that an expectation of exponentially distributed packet arrival intervals stays unchanged. However, practical packet arrival rate may change depending on time or typical Internet services may incur bursty packet arrivals. In either case, we need to evaluate the performance of the DRX operation. For this purpose, we develop a more realistic traffic arrival model considering packets may arrive in a bursty manner under the DRX operation. We, then, analyze the performance of the DRX operation in terms of power saving efficiency and average queuing delay, respectively. The analytical results are validated via comparisons with simulation results.     

An integrated traffic model for multimedia wireless networks

Multimedia wireless networks are seen today as one of the key factors for the success of the global communication infrastructure in the near future. Such networks will have to handle a range of heterogeneous traffic classes with different QoS requirements. Their design, planning and control must be supported by suitable traffic models capable of dealing with a new set of constraints where QoS management and mobility play an important role.This paper proposes a traffic model for a cellular multimedia wireless network characterized by the integration of mobility and traffic management aspects. User mobility is modeled through a Markov renewal process, which allows for non-exponential cell residence times and may restrict the user mobility to existent paths in the system. A Markov-modulated fluid process is used to describe the changes in the bandwidth requirements of each mobile over the duration of its calls, including the periods where the mobile is inactive (without call).Based on the proposed model, the number of mobiles per class of traffic in a cell and the handoff processes are characterized. System performance results, such as new and handoff call blocking probabilities, for network planning are derived. Also, the distribution of the required capacity in a short time interval for network control is obtained. Simulations were carried out to validate the analytical results. The comparisons have shown that the integrated model may be regarded as a good basis to build useful teletraffic engineering tools for multimedia wireless networks.     

Above packet level admission control and bandwidth allocation for IEEE 802.16 wireless MAN

IEEE 802.16 wireless Metropolitan Area Network (MAN) is expected to revolutionize the broadband wireless access technology. Efficient resource management is essential in providing scalability in such large IEEE 802.16-based wireless network and Quality of Service (QoS) for multimedia applications (VoIP, MPEG, FTP, WWW) is usually achieved by appropriate classification of scheduling services and grant/request mechanism. In this paper, we firstly discuss the QoS issue in IEEE 802.16 wireless MANs and propose a dynamic admission control scheme for scheduling services defined in the 802.16 specification. The proposed scheme provides the highest priority for Unsolicited Grant Service (UGS) connections and maximizes the bandwidth utilization by employing bandwidth borrowing and degradation. We develop an approximate analytical model to evaluate the system performance by assuming that the traffic processes of all scheduling services are Poisson processes. In fact, the self-similarity of non-voice traffic makes its traffic process far from Poisson process and should be modeled by Poisson Pareto Burst Process (PPBP). Therefore, in the later part of the paper, we analyze upper bound blocking probabilities of all scheduling services above the packet level using PPBP model for fractal traffic and Gaussian model for aggregated traffic in large wireless network as well as using the Chernoff bound method. Based on the analytical results, we give another admission control and bandwidth allocation mechanism above the packet level so as to minimize the blocking probability of each type of service in IEEE 802.16 wireless MAN. Analytical and simulation results are obtained and compared to demonstrate the effectiveness of proposed schemes and validate our analytical models.     

Modeling variable user mobility with stochastic correlation concept

Analyzing stochastic behavior of user mobility is a basic study for traffic performance analysis in land–mobile cellular communications. Due to the heavy burden in simulation considering significant mobility parameters, many analytical models have been proposed as alternatives. However, analytical approach to figure out the stochastic behavior is so difficult that realistic features can hardly be reflected without simplification. As expected, the effect of variable user mobility (VUM) on traffic performance may not be reasonably analyzed with such simplified models, especially in a case of micro-cellular systems where traffic performance, such as handover rate, is more sensitively affected by user mobility. Thus we are motivated to investigate an improved alternative. This paper has focused on developing a VUM model. Considering VUM in mobility modeling, we figure out its effect on probability distributions of cell dwell time which is basic for traffic performance analysis in land–mobile cellular communications. A new concept on variable characteristics of user mobility called stochastic correlation is introduced for the analysis. Probability distribution of path length during a call is also studied using our model of VUM. We believe that our model with stochastic correlation could be applied to many performance modeling problems in land–mobile cellular systems with mobility sensitive traffic performance.     

Performance analysis for hierarchical resource allocation in multiplexed mobile packet data networks

The general packet radio service (GPRS) can be thought of as an overlay network above a Global Systems for Mobile (GSM) network. In cooperation with the GSM system, GPRS supports both voice and packet data services. Obviously, combining voice and data traffic implies the nature of contending with finite radio resources. The paper focuses on voice/data integrated GPRS downlink traffic and proposes two hierarchical resource allocation strategies by considering time slots and radio blocks simultaneously with two different TDMA frame configurations. The radio block based resource allocation can characterize the multiplexing scheme of the practical GPRS operation. The performance of the proposed strategies were evaluated analytically by multidimensional Markov chain and verified through intensive computer simulations. Based on both the analytical and simulation results, it showed that the proposed allocation strategies can offer high utilization of transmission resource, as well as low blocking probability to GPRS users. The results of the study provide not only a practical thinking for implementation but also a guideline for analysis.     

Scalable services via egress admission control

Allocating resources for multimedia traffic flows with real-time performance requirements is an important challenge for future packet networks. However, in large-scale networks, individually managing each traffic flow on each of its traversed routers has fundamental scalability limitations, in both the control plane's requirements for signaling, state management, and admission control, and the data plane's requirements for per-flow scheduling mechanisms. In this paper, we develop a scalable architecture and algorithm for quality-of-service management termed egress admission control. In our approach, resource management and admission control are performed only at egress routers, without any coordination among backbone nodes or per-flow management. Our key technique is to develop a framework for admission control under a general “black box” model, which allows for cross traffic that cannot be directly measured, and scheduling policies that may be ill-described across many network nodes. By monitoring and controlling egress routers' class-based arrival and service envelopes, we show how network services can be provisioned via scalable control at the network edge. We illustrate the performance of our approach with a set of simulation experiments using highly bursty traffic flows and find that despite our use of distributed admission control, our approach is able to accurately control the system's admissible region under a wide range of conditions     

Performance analysis of a threshold-based discrete-time queue using maximum entropy

The provision of guaranteed QoS for various Internet traffic types has become a challenging problem for researchers. New Internet applications, mostly multimedia-based, require differentiated treatments under certain QoS constraints. Due to a rapid increase in these new services, Internet routers are facing serious traffic congestion problems. This paper presents an approximate analytical performance model in a discrete-time queue, based on closed form expressions using queue threshold, to control the congestion caused by the bursty Internet traffic. The methodology of maximum entropy (ME) has been used to characterize closed form expressions for the state and blocking probabilities. A discrete-time GGeo/GGeo/1/{N₁, N₂} censored queue with finite capacity, N₂, external compound Bernoulli traffic process and generalised geometric transmission times under a first come first serve (FCFS) rule and arrival first (AF) buffer management policy has been used for the solution process. To satisfy the low delay along with high throughput, a threshold, N₁, has been incorporated to slow the arrival process from mean arrival rate λ₁ to λ₂ once the instantaneous queue length has been reached, otherwise the source operates normally. This creates an implicit feedback from the queue to the arrival process. The system can be potentially used as a model for congestion control based on the Random Early Detection (RED) mechanism. Typical numerical experiments have been included to show the credibility of ME solution against simulation for various performance measures and to demonstrate the performance evaluation of the proposed analytical model.     

Quantitative analysis of location management and QoS in wireless networks

As a fundamental component in wireless networks, location management consists of two operations: location update and paging. These two supplementary operations enable the mobile user ubiquitous mobility. However, in case of failed location update, a significant consequence is the obsolete location identity in the network databases and thereafter the incapability in establishing the valid route for the potential call connection, which will seriously degrade the network quality-of-service (QoS). This issue is not theoretically studied in the literature. In this paper, we perform a quantitative analysis of the location management effect on QoS in the wireless networks. The metrics call blocking probability and the average number of blocked calls are introduced to reflect the QoS. For the sake of general applicability, the performance metrics are formulated with the relaxed tele-traffic parameters. Namely, the call inter-arrival time, cell residence time, location area residence time and location update inter-arrival time follow a general probability density function. The formulae are additionally specified in the static and several dynamic location management mechanisms. Numerical examples are presented to show the interaction between the performance metrics and location management schemes. The discussions on the sensitivity of tele-parameters are also given.     

Resource management policies in GPRS systems

In this paper we consider the problem of resource management in GSM/GPRS cellular networks offering not only mobile telephony services, but also data services for the wireless access to the Internet. In particular, we investigate channel allocation policies that can provide a good tradeoff between the QoS guaranteed to voice and data services end users, considering three different alternatives, and developing analytical techniques for the assessment of their relative merits. The first channel allocation policy, voice priority, gives priority to voice in the access to radio channels; we show that this policy cannot provide acceptable performance to data services, since when all the channels are busy with voice connections, data services perceive long intervals of service interruption. The second channel allocation policy is called R-reservation; it statically reserves a fixed number of channels to data services, thus drastically improving their performance, but subtracting resources from voice users, even when these are not needed for data, thus inducing an unnecessary performance degradation for voice services. The third channel allocation policy is called dynamic reservation; as the name implies, it dynamically allocates channels to data when necessary, using the information about the queue length of GPRS data units within the base station. A threshold on the queue length is used in order to decide when channels must be allocated to data. Numerical results show that the dynamic reservation channel allocation policy can provide effective performance tradeoffs for data and voice services, with the additional advantage of being easily managed through the setting of the threshold value.     

An adaptive medium access control scheme for mobile ad hoc networks under self-similar traffic

An important function of wireless networks is to support mobile computing. Mobile Ad hoc NETworks (MANETs) consist of a collection of mobile stations communicating with each other without the use of any pre-existent infrastructure. The self-organization characteristic of MANETs makes them suitable for many real-world applications where network topology changes frequently. As a result, the development of efficient MAC (Medium Access Control) protocols in MANETs is extremely challenging. Self-similar traffic with scale-invariant burstiness can generate bursty network loads and thus seriously degrade the system performance. This paper presents an adaptive MAC scheme which dynamically adjusts the increasing function and resetting mechanism of contention window based on the status of network loads. The performance of this scheme is investigated in comparison with the legacy DCF (Distributed Coordination Function) under self-similar traffic and different mobility models. The performance results reveal that the proposed scheme is able to achieve the higher throughput and energy efficiency as well as lower end-to-end delay and packet drop probability than the legacy DCF.     

Predictive channel reservation for handoff prioritization in wireless cellular networks

In wireless cellular networks, a roaming mobile station (MS) is expected to move from one cell to another. In order to ensure that ongoing calls are not dropped while the owner mobile stations roam among cells, handoff calls may be admitted with a higher priority than newly generated calls. Predictive channel reservation (or pre-reservation) schemes allow the reservation of a channel for an ongoing call in an adjacent cell before its owner MS moves into that cell, so that the call is sustained when the MS moves into the adjacent cell. Pre-reservations are made when the MS is within some distance of the new cell boundary. This distance determines the area in which the MS can make channel reservations. In this paper, we study the effect of the pre-reservation area size on handoff performance in wireless cellular networks. Our studies show that if the reserved channels are strictly mapped to the MSs that made the corresponding reservations, as we increase the pre-reservation area size, the system performance (in terms of the probability that the handoff calls are dropped) improves initially. However, beyond a certain point, the performance begins to degrade due to a large number of false reservations. The optimal pre-reservation area size is closely related to the traffic load of the network and the MSs’ mobility pattern (moving speed). We provide an analytical formulation that furthers understanding with regard to the perceived behavior in one-dimensional networks (in which all cells are along a line).With the objective of improving handoff performance and alleviating this sensitivity to the area size, we propose an adaptive channel pre-reservation scheme. Unlike prior pre-reservation methods, the key idea in our scheme is to send a channel pre-reservation request for a possible handoff call to a neighboring cell not only based on the position and orientation of the owner MS, but also as per its speed towards the target cell. The newly proposed scheme uses GPS measurements to determine when channel pre-reservation requests are to be made. Simulation results show that the adaptive channel pre-reservation scheme performs better in all typical scenarios than a previously proposed popular pre-reservation method that does not take mobility into account.     

A high-speed integrated services ATM/STM switch

A new, high-speed switch architecture which uses Asynchronous Transfer Mode (ATM) and Synchronous Transfer Moder (STM) to support integrated voice-data-video, multicasting, and virtual networking services is described. The switch employs autonomous processing units with local memory to store switching information and is built around a modified Banyan network with bit-parallel lines linking its node processors. The system is synchronous and time is slotted with slots organized into frames. Fixed-rate video and other real-time periodic traffic are handled via STM switching, while voice, data, datagrams, and other bursty traffic are ATM switched. Multicasting is realized by allocating dedicated STM bandwidth to real-time periodic sources and virtual ATM bandwidth to bursty sources. Virtual networking is achieved by putting an STM subnetwork into place over which authorized users communicate via ATM and/or STM. Analytic models to determine the switch's performance characteristics are developed and illustrated via examples. The results show that the switch has excellent delay vs. throughput performance for ATM traffic in the presence of STM traffic, and very low blocking-and-loss probability for STM circuit set-up requests in the presence of other traffic.     

Handoff performance analysis of PMIPv6-based distributed mobility management protocol-urban scenario

Mobility management allows the networks to track down a mobile user's location for sending datagrams and to retain the connection when the user changes its location points repeatedly. Whenever a node switches between one base station and another, the connectivity is maintained through a process called handoff management. For real-time traffic implementations in wireless network communications, handover performance is essential. A mobile node is blocked from transmitting and receiving a datagram for a longer time as the handover delay increases. Unacceptable handover delays are common in real-time communication services. To guarantee smooth connectivity and continuous provision of services, effective handoff methods are required. The handoff efficiency of network-based distributed mobility management (DMM) is studied extensively in this article, along with a comparison to PMIPv6. We specifically investigate how handover delay, session recovery, and packet loss are influenced by cell radius. From the analytical and simulation findings this paper concludes that network-based DMM performs better than PMIPv6.     

Delay analysis of downlink IP traffic on UMTS mobile networks

Since wireless networks which can carry high bit rates have become ubiquitous, mobile computing is no longer just spoken about. Mobile computing always implies access through a wireless network to an IP network such as the Internet. In order to understand the performance of such links, we propose an analytic model for the down link delay of IP traffic between the Mobile Gateway Server and the End User in a UMTS mobile network. Traffic arriving at the Gateway Server is considered to be bursty in nature and we use a Batch Markovian Arrival Process (BMAP) to model this arrival process. We model the wireless link itself as a modified multi-state Gilbert–Elliot Markov model which takes into account the number of interfering users and whether the channel experiences Ricean fading or not for what we consider a typical indoor, IP-centric environment. We also account in both the analytical model and the simulation for the Forward Error Correction provided by Turbo coding in UMTS to establish realistic packet retransmission rates. Finally we calibrate and verify the correctness of the model with a discrete event simulator.     

Performance of GSM networks with general packet radio services

Recently, most of the mobile network providers start to introduce general packet radio service (GPRS) in their existing GSM networks. GPRS is the technology that will enable more efficient Internet applications to run on mobile networks even before the installation of 3G systems. However, it is not yet clearly understood, how the new data services will affect the overall network performance. This paper provides a framework for analytical performance evaluation of a single GSM/GPRS cell based on a multidimensional Markov chain model. Important performance measures like new call and handover blocking probabilities, moments of the blocking period distributions, achievable average data rates and resource utilization are determined. Introducing a new connection admission control (CAC) algorithm, different partitioning strategies between GSM and GPRS resources are investigated. Finally, the influence of typical GPRS applications like Internet browsing on traditional GSM services has been studied.     

Communication Delay in Wormhole-Switched Tori Networks under Bursty Workloads

Workloads generated by the real-world parallel applications that are executed on a multicomputer have a strong effect on the performance of its interconnection network—the hardware fabric supporting communication among individual processors. Existing multicomputer networks have been primarily designed and analysed under the assumption that the workload follows the non-bursty Poisson arrival process. As a step towards obtaining a clear understanding of network performance under various workloads, this paper presents a new analytical model for computing message latency in wormhole switched torus networks in the presence of bursty traffic, based on the well-known Markov-Modulated Poisson Process (MMPP). In order to derive the model, the approach for accurately capturing the properties of the composite MMPPs is applied to characterize traffic on network channels. Moreover, a general method has been proposed for calculating the probability of virtual channel occupancy when the traffic on network channels follows a multi-state MMPP process. Simulation experiments reveal that the model exhibits a good degree of accuracy.     

Performance analysis of the general packet radio service

This paper presents an efficient and accurate analytical model for the radio interface of the general packet radio service (GPRS) in a GSM network. The model is utilized for investigating how many packet data channels should be allocated for GPRS under a given amount of traffic in order to guarantee appropriate quality of service. The presented model constitutes a continuous-time Markov chain. The Markov model represents the sharing of radio channels by circuit switched GSM connections and packet switched GPRS sessions under a dynamic channel allocation scheme. In contrast to previous work, the Markov model explicitly represents the mobility of users by taking into account arrivals of new GSM and GPRS users as well as handovers from neighboring cells. Furthermore, we take into account TCP flow control for the GPRS data packets. To validate the simplifications necessary for making the Markov model amenable to numerical solution, we provide a comparison of the results of the Markov model with a detailed simulator on the network level.     

基于车辆载带中继的路边单元突发业务分组调度最优策略

高速公路车联网场景中,路边单元(Roadside units,RSUs)可作为多种周边监测数据的汇入网关,其业务具有突发特性,且可通过移动车辆以"存储—载带—转发"方式传输到与骨干网络互联的RSU.针对RSU间业务传输问题,源RSU可根据实时业务到达率按需匹配资源,以应对业务突发性对分组端到端时延的影响.本文首先针对R...     

Modelling and analysis of pipelined circuit switching in interconnection networks with bursty traffic and hot-spot destinations

Pipelined circuit switching (PCS) that combines the advantages of both circuit switching and wormhole switching is an efficient method for passing messages in interconnection networks. Analytical modelling is a cost-effective tool and plays an important role in achieving a clear understanding of the network performance. However, most of the existing models for PCS are unable to capture the realistic nature of message behaviours generated by real-world applications, which have a significant impact on the design and performance of communication networks. This paper presents a new analytical model for PCS in interconnection networks in the presence of bursty and correlated message arrivals coupled with hot-spot destinations, which can capture the bursty message arrival process and non-uniform distribution of message destinations. Such a traffic pattern has been found in many practical communication environments. The accuracy of the proposed analytical model is validated through extensive simulation experiments. The model is then applied to investigate the effects of the bursty message arrivals and hot-spot destinations on the performance of interconnection networks with PCS.