Results 241 to 250 of about 584,932 (288)
Some of the next articles are maybe not open access.
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
Asymptotic Analysis of Traffic Lights Performance Under Heavy Traffic Assumption
Methodology and Computing in Applied Probability, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Afanasyeva, Larisa +1 more
openaire +2 more sources
Queue Disciplines in Heavy Traffic
Mathematics of Operations Research, 1982A general method of analyzing the behavior in heavy traffic of queues with different impartial queue disciplines is described. There are many possible limiting waiting time distributions though all are mixtures of negative exponentials. The exponential distribution itself, however, shows a degree of robustness to departures from the “first come first ...
openaire +2 more sources
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
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
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
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
Heavy Traffic Analysis of Two Coupled Processors
Queueing Systems, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Knessl, Charles, Morrison, John A.
openaire +2 more sources
Heavy-traffic inventory—production systems
International Journal of Production Economics, 1992Abstract Multi-commodity inventory—production systems with two classes of customers are investigated in heavy-traffic conditions. For the single commodity case the deteriorating items are considered as well as non-deteriorating and optimization is carried out.
openaire +1 more source
Controlled queues in heavy traffic
Advances in Applied Probability, 1975This paper studies a controlled queueing system in which the decisionmaker may change servers according to rules which depend only on the queue length. It is proved that for a given control policy a properly normalised sequence of these controlled queue length processes converges weakly to a controlled diffusion process as the queueing systems approach
openaire +2 more sources

