Showing 11 - 20 of 2,749
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...
Persistent link: https://www.econbiz.de/10010324398
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...
Persistent link: https://www.econbiz.de/10010324772
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...
Persistent link: https://www.econbiz.de/10010324803
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...
Persistent link: https://www.econbiz.de/10010325009
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...
Persistent link: https://www.econbiz.de/10010325017
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...
Persistent link: https://www.econbiz.de/10010325252
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...
Persistent link: https://www.econbiz.de/10010325426
Goods are often allocated publically by means of queuing processes in developing countries.In such situations, which group of citizens should a corrupt government official favor? In addition,what should be the basis for this favoritism? To the best of our knowledge, these salient questionshave...
Persistent link: https://www.econbiz.de/10010325471
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...
Persistent link: https://www.econbiz.de/10010325503
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...
Persistent link: https://www.econbiz.de/10010325632