{ This paper evaluates the use of packet scheduling to provide multiple service classes for bursty data traac. In particular, we study the performance of the weighted fair queueing algorithm by simulating various scenarios in a packet cellular wireless network similar to an EDGE system. The results show that, due to the burstiness of data traac, traditional work-conserving packet scheduling alg...

The Madrid Conference on Queueing Theory (MCQT) aims to be a meeting place where scientists and technicians in the field will find a discussion forum to promote research, encourage interaction and exchange ideas. The conference is open to all trends including the development of the theory, methodology advances, computational aspects and applications of Queueing Theory. Papers submitted for this...

We investigate stability of scheduling policies in queueing systems. To this day no algorithmic characterization exists for checking stability of a given policy in a given queueing system. In this paper we introduce a certain generalized priority policy and prove that the stability of this policy is algorithmically undecidable. We also prove that stability of a homogeneous random walk in d+ is ...

AbstTactThe ATM Forum is currently discussing the need for a new best-effort service called UBR+, which ie, an enhancement to the existing UBR service, to supporit data traffic. The objective of the UBR+ service is to provide each user with a minimum service rate guarantee and a fair access to any excess available bandwidth. In this paper, we present a new efficient scheme for supporting this s...

In this work, it has been demonstrated through experiments that Long Range Dependence (LRD) in internet traffic is indeed affecting the queueing performance. Queueing performance is being degraded as the self-similarity of the packet arrival process increases. Here, the link buffer capacity and queueing delay exhibits super-linear relationship. This in turn has led to the proposal of resource p...

This paper deals with finite-population, single and multi-server queueing systems with two classes of vacation mechanisms : station vacation and server vacation. In the first one, all the servers take vacation simultaneously whenever the system becomes empty, and they also return to the system at the same time, i.e., station vacation is group vacation for all servers. For the second class of va...

Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we present a new software package, called the Improved Approximate Mean Value Analysis Library (IAMVAL), which can be easily integrated into existing commercial and research queueing network analysis packages. The IAMVAL packages inc...

This paper presents a new approach to real-time system scheduling. The approach, called real-time queueing theory, includes customer timing requirements into queueing models. With real-time queueing models, one is able to explicitly characterize the dynamic behavior of the customer lead-tame profile process where lead-time = deadline minus current time. In spite of the injinite dimensionality o...

We propose a method for the control of multi-class queueing networks over a finite time horizon. We approximate the multi-class queueing network by a fluid network and formulate a fluid optimization problem which we solve as a separated continuous linear program. The optimal fluid solution partitions the time horizon to intervals in which constant fluid flow rates are maintained. We then use a ...

In this paper we propose a new statistical model for multi-scale traffic, and present an exact queueing analysis for the model. The model is based on the central moments and the marginal distributions of the cumulative traffic loads in different time scales. Only the first two moments are needed to characterize the traffic process, which greatly simplifies the representation and estimation. The...