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...

Von Lichtsignalsteuerungen, die vorrangig auf das lokale Verkehrsgeschehen vor Ort reagieren, sind einerseits positive verkehrliche Wirkungen zu erwarten. Eine ausgewogene ÖV-Beschleunigung gehören ebenso dazu wie eine flexible Kolonnenführung in Form dynamischer Grüner Wellen. Andererseits...

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...

This paper deals with a system where batch arrivals wait in a station until a server (a train) is available, at which moment it services all customers in waiting. This is an example of a bulk server, which has many applications in public transportation, telecommunications, computer resource...

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...