Complete Partitioning Schemes Research Articles

Power-based admission control for multiclass calls in QoS-sensitive CDMA networks

In this letter, we propose a power-based call admission control (CAC) scheme to accommodate multiclass traffic by directly extending the number-based CAC scheme in multicode CDMA networks, and develop some related mathematical properties. Against the conventional findings, we demonstrate that complete partitioning (CP) of the received signal power at a basestation for each traffic class can be an approach as useful as complete sharing (CS) in accommodating an appropriate number of users. The main advantage of CP scheme over CS scheme is its simplicity in resource management

Analysis of GSM/GPRS Cell with Multiple Data Service Classes

This paper is concerned with the performance modelling and evaluation of a General Packet Radio Service (GPRS) for a wireless Global System for Mobile telecommunication (GSM) cell involving both voice and multiple class data services under a complete partitioning scheme (CPS). The GPRS is modelled as a system of access and transfer queues in tandem having an external multiple class compound Poisson bursty traffic with geometrically distributed batches under first-come-first-served (FCFS) and generalised processor-sharing (PS) scheduling disciplines, respectively. The proposed queueing model is valid for both uplink and downlink connections and provides multiple class data services with different arrival rates, interarrival-time squared coefficients of variation (SCVs), file (burst) sizes and different PS discrimination service levels. Based on the principle of maximum entropy (ME), a product form approximation is characterised for the two queues in tandem, subject to queueing theoretic mean value constraints. The ME solution implies a decomposition of the system into individual single server building block queues, each of which can be analysed in isolation. Consequently, ME closed form expressions and simulation results for the aggregate state probability together with the marginal mean queue length and blocking probability are divised to assess the credibility of the ME solution and also to study the effect of external GPRS bursty traffic upon the performance of the wireless cell.

Optimal access control for broadband services: Stochastic knapsack with advance information

Suppose that call reservation requests of K different types arrive randomly at a single capacitated link where each in turn must be accepted or rejected. Each request requires an amount of bandwidth and a random duration, both depending on its type. An accepted call generates an immediate fixed revenue followed by a variable revenue per unit time. We assume that each call's requested duration is known when it arrives and that the state of the link is constantly monitored. The problem is to find a call acceptance policy that maximizes the long-run average revenue per unit time generated by the accepted calls. We propose and investigate threshold-type control policies that use the known duration of arriving calls as well as the current link status. Two main contributions result. First are interpretable analytical results for the case of K = 1 that can also be applied to the case of K > 1 using complete partitioning scheme. Second, we illustrate how to apply stochastic optimization techniques to compute optimal thresholds in the general case. We also include the results of initial simulation experiments.