Queueing Systems - Vol. 1: Theory

Performance modeling of congestion control and resource allocation under heterogeneous network traffic : modeling and analysis of active queue management mechanism in the presence of poisson and bursty traffic arrival processes

We consider a G/M/1 queue with restricted accessibility in the sense that the maximal workload is bounded by 1 If the current workload Vt of the queue plus the service time of an arriving customer exceeds 1, only 1-Vt of the service requirement is accepted We are interested in the distribution of the idle period, which can be interpreted as the deficit ruin for a risk reserve process Rt in the compound Poisson risk model For this risk process a special dividend strategy applies, where the insurance company pays out all the income whenever Rt reaches level 1 In the queueing context we further introduce a set-up time a 2e [0, 1] After every idle period, when the queue is empty, an arriving customer has to wait for a time units until the server is ready to serve the customer

background

/pdf/idle-periods-for-the-finite-g-m-1-queue-and-the-deficit-at-5ei1ptnizl.pdf

Idle periods for the finite G/M/1 queue and the deficit at ruin for a cash risk model with constant dividend barrier

Mobile systems and particularly UMTS are growing fast. These systems convey data based services in addition to customary voice services. Quality of service is a function of data rate, delay and signal to noise plus interference ratio in these systems. In this Chapter first the author pays attention to UMTS and its QoS architecture, then to service categorization due to QoS. Afterwards he reviews some QoS parameters. Then he studies Layer 2 QoS parameters and general concepts about Transport channels. Then he review TCP effects on the throughput in the air interface. he introduces HSDPA in the next section. Finally he pays attention to data traffic models and their effects on the system capacity and Erlang capacity and delay in the system.

Quality of Service in UMTS Mobile Systems

IEEE 802.16-2009 specifies two fast handover mechanisms, fast base station switching and macro diversity handover, to streamline communication for a mobile station (MS). Both operate with a diversity set that lists base stations among which an MS can move its connection readily. In view that an unduly chosen diversity set may cause prohibitive cost, we provide means to prevent the diversity set from including base stations that are less likely to serve the MS in the near future. Inspired from the working-set model, our approach develops predictive handover using numerical extrapolation to accommodate temporal locality of the MS. While a joint entry-replacement strategy is exercised to evict least-preferred entries in the diversity set, its capacity is reviewed and tuned periodically allowing for reasonable space demand. Simulation results show that our approach, compared with the counterpart scheme, reduces handover executions by over 48 percent, handover delay by over 51 percent, and diversity-set space requirement by up to 17.9 percent on average. As another salient strength, our approach conforms fully to the standard, keeping current protocols on the MS side operable without modification. Qualitative and quantitative performance discussions indicate the usefulness of our approach in pragmatic settings.

/pdf/enhanced-fast-base-station-switching-15w3cbpy2u.pdf

Enhanced Fast Base Station Switching

We consider an extended form of the MX/M/c queue with two types of server groups: Static as well as dynamic (which turn on/off in a state-dependent manner) servers. The two server groups may have homogenous or non-homogenous service rates. The model is further extended to feature setup and delayed-off times, finite capacity, and k staffing levels. This class of queues is solved via the difference equations approach, which addresses narratives in the literature and achieves higher numerical efficiency than the direct method. While the model of this queueing system is not new, the methodology for solving it is. Comparisons between our model and classic queues are provided followed by concluding remarks, including a summary of key observations.

Queueing Systems - Vol. 1: Theory

Citations

Performance modeling of congestion control and resource allocation under heterogeneous network traffic : modeling and analysis of active queue management mechanism in the presence of poisson and bursty traffic arrival processes

Idle periods for the finite G/M/1 queue and the deficit at ruin for a cash risk model with constant dividend barrier

Quality of Service in UMTS Mobile Systems

Enhanced Fast Base Station Switching

Difference Equations Approach for Multi-Server Queueing Models with Removable Servers

Related Papers (5)

Theory, Volume 1, Queueing Systems

Queueing systems, Vol. I: Theory

Fundamentals of queueing theory

Introduction to matrix analytic methods in stochastic modeling

Queueing Systems, Vol. II: Computer Applications.