R. Wolff. Poisson arrivals see time averages. Operations Research, 30(2):223--231, 1982.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Performance Analysis of Reservation Media Access Protocol.. - Cao, Sun, Trivedi (2003) (1 citation) (Correct)
....and optimization than measures on lower levels) I) LLC frame blocking probability, P b and (II) LLC frame delay, # . We also give expression for steady state system utilization, U . A. LLC frame blocking probability, P The well known PASTA (Poisson Arrivals See Time Average) property [23] does not hold because of the MMPP arrival process. We can show ( 6] Section 3.2) that P b can be given as b = 1 (8) # is the average arrival rate of LLC frames and is given as and the term is the probability that an LLC frame is accepted to the MS buffer in marking ....
R. W. Wolff. Poisson arrivals see time average. Operations Research, 30:223--231, 1982.
The Effect of Layer-2 Store-and-Forward Devices on Per-Hop .. - Prasad, Dovrolis, Mah (2003) (1 citation) (Correct)
....us assume that probing packets arrive at each link as a Poisson process . Even though this is a crude assumption, our objective here is simply to illustrate that measuring a queueing free RTT can be quite hard in loaded paths. Based on the Poisson Arrivals See Time Averages (PASTA) property [28], the probability that a probing packet will not experience any queueing at a link i is 1 # i , where # i is the fraction of time that the link i is busy, or equivalently, the utilization of link i. Consequently, the probability that a probing packet will not experience any queueing delay at ....
R. Wolff, "Poisson Arrivals See Time Averages," Operations Research, vol. 30, no. 2, pp. 223--231, 1982.
A Scalable and Lightweight QoS Monitoring Technique.. - Aida, Miyoshi, Ishibashi (2003) (Correct)
....experience. If and only if we can assume that active monitoring measures the time average of network performance and that the user traffic is Poissonian, then the performance experienced by the users and the actively measured performance will be the same. This well known property is called PASTA [25]. It is known, however, that current Internet traffic exhibits bursty properties and does not generally have Poisson arrivals [19] In that case, an average user experiences worse performance than the time average performance measured by active monitoring. b) Passive measurement is mainly used to ....
....is still assumed to be independent of the sampling process N . Now, consider the case where (V (t) a k (t) depends on N(s) s t for t 0. In this case, if N is Poisson and (t) a k (t) t#0 is jointly ergodic with N , we can verify the following by using the Poisson calculus [11] see also [25]) 0 )#C a k (0 ) N [a k (0 ) where V (0 ) lim 0 V (t) and a k (0 ) lim 0 a k (t) The corresponding estimator is given by (Tn )#C a k (T n n=1 a k (T n . 12) IV. IMPLEMENTATION Since the traffic is not fluid in practice, we have to consider the ....
R.W. Wolff. Poisson arrivals see time averages. Oper. Res., 30 (1982) 223--231.
Scheduling Strategies and Long-Range Dependence - Anantharam (1999) (14 citations) (Correct)
....the stationary residual time distribution of the typical session duration. In particular this is a regularly varying distribution with infinite mean. Let S have the distribution of the stationary sojourn time of a typical session. Because Poisson arrivals see time averages (PASTA) see [4] [25], this distribution is the same as that of a marked session that, at time 0, enters the stationary system. By the nonpreemptive nature of the service discipline, this marked session will certainly have to wait for the completion of the session currently under service before it can even begin to ....
R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982) 223--231.
Computing Blocking Probabilities in Multi-Class.. - Ramesh, Rouskas, Perros (2001) (4 citations) (Correct)
.... the Multi Class Case Since the arrival rate of calls of each class on each route is Poisson, the blocking probability, Q ij , of a call of class r using route (i; j) is just the fraction of time that there is no wavelength that is free on all hops along route (i; j) see the PASTA theorem in [27]) Thus, we have: ij = lim I fF ij (t) 0g dt (14) where I fF ij ( 0g = 1; if F ij ( 0 0; otherwise (15) As can be seen, the blocking probability is class independent. Next, we focus on the call blocking probabilities in the modified model. The arrival process of calls of class ....
R. W. Wolff. Poisson arrivals see time averages. Operations Research, 30(2):223--231, 1982.
Analysis of Measured Single-Hop Delay from an.. - Papagiannaki.. (2002) (25 citations) (Correct)
....packets in set1,andset2 constitute 0.5 , 2.4 of the total packets on links out1,andout2 respectively. Although this subset results from a single input port, it will be equivalent to a pure random sampling if the matched packets on the output link are geometrically distributed and independent [11]. We first analyze the distribution of the distance between matched packets in terms of packet counts. We find that it fits a Weibull distribution . Figure 3 shows the Quantile Quantile plot The probability density function of a Weibull distribution is given by ##### 0 7803 7476 2 02 17.00 ....
R. W. Wolff, "Poisson arrivals see time average," Operations Research, vol. 30, pp. 223--231, 1982.
Availability, Usage, and Deployment Characteristics of the - Domain Name System (2004) (Correct)
No context found.
R. Wolff. Poisson arrivals see time averages. Operations Research, 30(2):223--231, 1982.
Availability, Usage, and Deployment Characteristics of the - Domain Name System (Correct)
No context found.
R. Wolff. Poisson arrivals see time averages. Operations Research, 30(2):223--231, 1982.
Analysis of a Hysteretic Overload Control - Roughan And Pearce (1999) (Correct)
No context found.
R. Wolff, "Poisson arrivals see time averages," Opns. Res., vol. 30, pp. 223--231, 1982.
A Comparison of Poisson and Uniform Sampling for Active.. - Roughan (Correct)
No context found.
R. Wolff, "Poisson arrivals see time averages," Operations Research, vol. 30, pp. 223--231, 1982.
Fundamental Bounds on the Accuracy of Network Performance.. - Roughan (2005) (Correct)
No context found.
R. Wolff, "Poisson arrivals see time averages," Opns. Res., vol. 30, pp. 223--231, 1982.
Poisson versus periodic path probing (or, does PASTA matter?) - Muhammad Mukarram Bin (2005) (Correct)
No context found.
R. Wolff, "Poisson Arrivals See Time Averages," Operations Research, vol. 30, no. 2, pp. 223--231, 1982.
Argus: Bandwidth Management in Sensor Networks - Ee (Correct)
No context found.
R.L. Wolff, Poisson Arrivals See Time Averages, Operations Research 30, 223-231
Polling Systems With Synchronization - Constraints Khamisy Asad (Correct)
No context found.
Ronald W. Wolff, "Poisson Arrivals See Time Averages", Operrations Research, Vol. 30, No. 2, March-April 1982.
Discrete Time Queues with Delayed Information - Altman, Kofman, Yechiali (1994) (1 citation) (Correct)
No context found.
R. W. Wolff, "Poisson arrivals see time averages", Operations Research 30, pp. 223-231, 1982. 18
Performance Analysis of an ATM MUX with a New Space.. - Bang, Ansari, Tekinay (2002) (Correct)
No context found.
B. Wolff, "Poisson arrivals see time averages," Operational Research, vol. 30, no. 2, pp. 223--231, Apr. 1982.
Single-Hop Probing Asymptotics in Available Bandwidth.. - Liu, Ravindran, Liu.. (2004) (1 citation) (Correct)
No context found.
R. Wolff, "Poisson Arrivals See Time Averages," Operations Research, 30(2):223--231, 1982.
Analysis of Measured Single-Hop Delay from an.. - Papagiannaki.. (2002) (25 citations) (Correct)
No context found.
R. W. Wolff, "Poisson arrivals see time average," Operations Research, vol. 30, pp. 223--231, 1982.
Analysis of a Hysteretic Overload Control - Roughan And Pearce (1999) (Correct)
No context found.
R. Wolff, "Poisson arrivals see time averages," Opns. Res., vol. 30, pp. 223--231, 1982.
An Application of Martingales to Queueing Theory - Roughan (1995) (Correct)
No context found.
R.W. Wolff, (1982), Poisson arrivals see time averages. Operations Research, 30, 223--231.
Dynamics of Hot-Potato Routing in IP Networks - Teixeira, Shaikh, Griffin.. (2004) (9 citations) (Correct)
No context found.
R. Wolff, "Poisson arrivals see time averages," Operations Research, vol. 30, no. 2, pp. 223--231, 1982.
Computing Blocking Probabilities in Multiclass.. - Ramesh, Rouskas, Perros (2002) (4 citations) (Correct)
No context found.
R. W. Wolff, "Poisson arrivals see time averages," Operations Res., vol. 30, no. 2, pp. 223--231, 1982.
Analysis of Measured Single-Hop Delay from an.. - Papagiannaki.. (2002) (25 citations) (Correct)
No context found.
R. W. Wolff, "Poisson arrivals see time average," Operations Research, vol. 30, pp. 223--231, 1982.
Provisioning IP Backbone Networks Based on Measurements - Papagiannaki (2003) (Correct)
No context found.
R. W. Wolff, "Poisson Arrivals See Time Average," Operations Research, vol. 30, pp. 223--231, 1982.
Dynamics of Hot-Potato Routing in IP Networks - Teixeira, Shaikh, Griffin.. (2004) (9 citations) (Correct)
No context found.
R. Wolff, "Poisson arrivals see time averages," Operations Research, vol. 30, no. 2, pp. 223--231, 1982.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC