We report an empirical analysis of the responses of the supply and demand for secondary care to waiting list size and waiting times. Whereas previous empirical analyses have used data aggregated to area level, our analysis is novel in that it focuses on the supply responses of a single hospital...

Hintergrund: In Deutschland werden die Wartezeiten auf medizinische Dienstleistungen öffentlich und ordnungspolitisch immer wieder problematisiert. Dies gilt vor allem für den niedergelassenen Ärztebereich. In der vorliegenden Arbeit wird erstmalig der akutstationäre Sektor analysiert....

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

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

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

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

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

We develop a methodology for studying large deviations type questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...