Empirical studies showed that many types of network traffic exhibit long-range dependence (LRD),i.e., burstiness on a wide variety of time-scales. Given that traffic streams are indeed endowed withLRD properties, a next question is: what is their impact on network performance? To assess...

We consider a queue fed by a large number, say n, of on-off sources with generally distributed on-and off-times. The queueing resources are scaled by n: the buffer is B=nb and link rate is C=nc.The model is versatile: it allows us to model both long range dependent traffic (by using heavy-tailed...

We consider an economy where most of the health care is publicly provided, and where there is waiting time for several types of treatments. Private health care without waiting time is an option for the patients in the public health queue. We show the effects of a tax (positive or negative) on...

This paper presents a profit-oriented shift scheduling approach for inbound contact centers. The focus is on systems in which multiple agent classes with different qualifications serve multiple customer classes with different needs. We assume that customers are impatient, abandon if they have to...

In this paper, we analyze the performance of call centers of financial service providers with two levels of support and a time-dependent overflow mechanism. Waiting calls from the front-office queue flow over to the back office, if a waiting-time limit is reached and at least one back-office...

This paper examines a stochastic model to determine optimal pricing, waiting time, output, and sizing decisions for service firms which compete on time in an uncertain environment. Sizing decisions concern optimal service capacity and maximum physical waiting room (with a given probability)....

This note develops a modelling approach for wireless networks driven byfluid traffic models. Introducing traffic sets that follow movement ofsubscribers, the wireless network with time-varying rates is transformedinto a stationary network at these traffic sets, which yields that thedistribution...

This paper deals with estimating small tail probabilities of thesteady-state waiting time in a GI/GI/1 queue withheavy-tailed (subexponential) service times. The problem ofestimating infinite horizon ruin probabilities in insurancerisk processes with heavy-tailed claims can be transformed into...

Queueing networks are studied with finite capacity constraints forclusters of stations. First, by an instructive tandemcluster example it is shown how a product-form modification methodfor networks with finite stations can be extended tonetworks with finite clusters. Next, a general result is...

In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is...