Results 101 to 110 of about 1,896,388 (144)
Some of the next articles are maybe not open access.
Queueing Simulation in Heavy Traffic
Mathematics of Operations Research, 1992The heavy traffic behavior of a number of standard queueing simulation procedures like sample averaging and regenerative simulation is studied. In particular, limit theorems based upon Brownian approximations are given in a double limit with both the sample size t tending to infinity and the traffic intensity ρ tending to one.
openaire +2 more sources
Storage-Limited Queues in Heavy Traffic
Probability in the Engineering and Informational Sciences, 1991This paper models primary computer storage in the context of a general (GI/GI/l) queueing system. Queued items are described by sizes, or storage requirements, as well as by arrival and service times; the sum of the sizes of the items in the system is the occupied storage.
Coffman, E. G. jun. +2 more
openaire +1 more source
Scheduling in polling systems in heavy traffic
ACM SIGMETRICS Performance Evaluation Review, 2013We consider the classical cyclic polling model with Poisson arrivals and with gated service at all queues, but where the local scheduling policies are not necessarily First-Come- First-Served (FCFS). More precisely, we study the waitingtime performance of polling models where the local service order is Last-Come-First-Served (LCFS), Random-Orderof ...
R. Bekker (Rene) +4 more
openaire +4 more sources
Queue Management for the Heavy-Tailed Traffics
2010 International Conference on Broadband, Wireless Computing, Communication and Applications, 2010The purpose of this research is to design the new queueing algorithm effectively controlling the heavy-tailed traffics based on the comparison between the performance of the passive queue algorithm and that of the active queue algorithm. We adopted the tail-drop algorithm for PQM and the Random Early Detection (RED) for AQM, and conducted the ...
openaire +3 more sources
Service Systems in Heavy Traffic
Theory of Probability & Its Applications, 1963Let $\eta _n $ be the waiting time of the n-th customer arriving at a service line. It is proved that under certain conditions the distribution of $\delta \eta _n $ tends to a negative exponential distribution as $\delta \to 0$, and $n\delta ^2 \to \infty $, where $\delta = {{({\bf M}\tau - {\bf M}\chi )} / {M\tau ;}}{\bf M}\tau $ and ${\bf M}\chi ...
openaire +1 more source
Efficient simulation of queues in heavy traffic
ACM Transactions on Modeling and Computer Simulation, 2003When simulating queues in heavy traffic, estimators of quantities such as average delay in queue d converge slowly to their true values. This problem is exacerbated when interarrival and service distributions are irregular.
Chia-Li Wang, Ronald W. Wolff
openaire +2 more sources
2011
Previous chapters looked at SOAP performance through various optimisations, which included grouping messages (so to reduce the number of message) as well as smartly routing messages (so to reduce the routing path to destination). This chapter (as well as the next chapter) look at the performance of Web services on the server side.
Zahir Tari +3 more
openaire +1 more source
Previous chapters looked at SOAP performance through various optimisations, which included grouping messages (so to reduce the number of message) as well as smartly routing messages (so to reduce the routing path to destination). This chapter (as well as the next chapter) look at the performance of Web services on the server side.
Zahir Tari +3 more
openaire +1 more source
The Probability of Loss of Calls in Heavy Traffic
Theory of Probability & Its Applications, 1964The full availability group of trunks with an arbitrary distribution of the inter-arrival times and a negative exponential holding time distribution is considered. The possibility of evaluating the probability of loss of calls by Erlang’s formula, as a first approximation, is established under very general conditions on streams with high intensity ...
Viskov, O. V., Prokhorov, Yu. V.
openaire +2 more sources
Heavy-Traffic Behavior of the MaxWeight Algorithm in a Switch with Uniform Traffic
ACM SIGMETRICS Performance Evaluation Review, 2015We consider a switch with uniform traffic operating under the MaxWeight scheduling algorithm. This traffic pattern is interesting to study in the heavy-traffic regime since the queue lengths exhibit a multi-dimensional state-space collapse. We use a Lyapunov-type drift technique to characterize the heavy-traffic behavior of the expectation
Siva Theja Maguluri, R. Srikant 0001
openaire +2 more sources
On–off fluid models in heavy traffic environment
Queueing Systems, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Krzysztof Debicki, Zbigniew Palmowski
openaire +2 more sources

