Results 271 to 280 of about 65,792 (310)
Some of the next articles are maybe not open access.
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 +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
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
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 +1 more source
Traffic Technology International
Texan roads are under pressure. Tom Stone looks at how new research analyzes border controls for heavy vehicles, calculates permit revenues vs road repair costs and recommends ways to protect the state’s highways for the ...
openaire +1 more source
Texan roads are under pressure. Tom Stone looks at how new research analyzes border controls for heavy vehicles, calculates permit revenues vs road repair costs and recommends ways to protect the state’s highways for the ...
openaire +1 more source
A theory of traffic congestion at heavy bottleneckss
Journal of Physics A: Mathematical and Theoretical, 2008Spatiotemporal features and physics of vehicular traffic congestion occurring due to heavy highway bottlenecks caused for example by bad weather conditions or accidents are found based on simulations in the framework of three-phase traffic theory. A model of a heavy bottleneck is presented. Under a continuous non-limited increase in bottleneck strength,
openaire +1 more source
Heavy Traffic Analysis of Two Coupled Processors
Queueing Systems, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles Knessl, John A. Morrison
openaire +2 more sources
A multiclass Station with Markovian Feedback in Heavy Traffic
Mathematics of Operations Research, 1995This paper proves a heavy traffic limit theorem for a multiclass service station with Markovian feedback. This result generalizes the one proved by Reiman (Reiman, M. I. 1988. A multiclass feedback queue in heavy traffic. Adv. Appl. Probab. 20 179–207.). Our approach also significantly simplifies Reiman's original proof.
Jian Gang Dai 0001, Thomas G. Kurtz
openaire +2 more sources

