R. I. Wilkinson, "Theories for Toll Traffic Engineering in the U.S.A.," Bell System Tech. J., vol. 35, pp. 421-514, 1956.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficiently Providing Multiple Grades of Service with.. - Choudhury, Leung, Whitt (1994) (6 citations) (Correct)
....limit. Since the variance equals the mean in a Poisson distribution, the peakedness is 1 for a Poisson arrival process. For a more bursty arrival process, the peakedness is greater than 1, while for a less bursty arrival process, the peakedness is less than 1. Beginning with R. I. Wilkinson [25], several researchers have made the observation that the number of active requests in a finite capacity resource tends to have a truncated Pascal (or negative binomial) distribution for sources burstier than Poisson and a binomial distribution for sources smoother than Poisson, for any resource ....
R. I. Wilkinson, "Theories for Toll Traffic Engineering in the U.S.A.," Bell System Tech. J., vol. 35, pp. 421-514, 1956.
Burstiness Descriptors Of Traffic Streams: Indices Of.. - Jagerman, Melamed (1994) (4 citations) (Correct)
.... smoothness via its effect on an iid infinite server group with common service distribution B(x) usually the exponential distribution) and mean 1=B ( B is the service rate. The statistic of interest is the equilibrium expectation of S(t) the number of busy servers at time t. R. Wilkinson [17] had introduced the peakedness concept in teletraffic theory in order to characterize the action of superposition of overflow streams when offered to a secondary trunk group. The object was to compute the grade of service (blocking probability) in the context of his equivalent random method [8] ....
....in a single server system, with or without finite buffers, such as waiting times and blocking probabilities [3, 8] Let a = X =B , and note that Little s Law implies lim t 1 E[S(t) a. The peakedness functional, z X [B] maps the service time distribution, B(x) to the following scalar [17] z X [B] lim t 1 V ar[S(t) E[S(t) oe 2 S a : 4:1) For any service distribution, B(x) define B 0 (x) B(x=B ) so that B 0 (x) has unit service rate. Define further B (x) B 0 (x) to be a family of service time distribution functions, parameterized by 0. The peakedness ....
Wilkinson, R. (1956) "Theories of Toll Traffic Engineering in the U.S.A.," Bell System Technical Journal, Vol. 35, No. 2. 28
Stochastic Modeling Of Traffic Processes - Jagerman, Melamed, Willinger (1996) (19 citations) (Correct)
....all service times are mutually independent with common service distribution B(x) usually the exponential distribution) of mean 1=B ( B being the service rate) The peakedness descriptor of X is the equilibrium variance to mean ratio of S(t) the number of busy servers at time t. R. Wilkinson [96] had introduced the peakedness concept in teletraffic theory in order to characterize the action of superposition of overflow streams when offered to a secondary trunk group. The object was to compute the grade of service (blocking probability) in the context of his equivalent random method (see ....
....in a single server system, with or without finite buffers, such as waiting times and blocking probabilities [26, 48] Let a = X =B , and note that Little s Law implies lim t 1 E[S(t) a. The peakedness functional, z X [B] maps the service time distribution, B(x) to the following scalar [96] z X [B] lim t 1 V ar[S(t) E[S(t) oe 2 S a ; 31) where oe 2 S is the time equilibrium variance of the number of busy servers. For any service distribution, B(x) define B 0 (x) B(x=B ) so that B 0 (x) has unit service rate. Define further B (x) B 0 (x) to be a family of ....
[Article contains additional citation context not shown here]
Wilkinson, R., "Theories of Toll Traffic Engineering in the U.S.A.," Bell System Technical Journal 35:2 (1956), 421--514.
Local Area Network Traffic Characteristics, with Implications .. - Fowler, Leland (1991) (34 citations) (Correct)
....on the congestion management strategy. The first paradigm is based on many decades of experience with voice networks that provide Plain Old Telephone Service (POTS) Much literature exists on the theory of how humans initiate telephone calls, how long we talk, and so on. References [8] and [9] present these theoretical foundations. The POTS network is a connection oriented network, where calls are assigned constant bandwidth. The fundamental assumptions about this traffic verified by years of experience are: # Within an hour, traffic fluctuations can be predicted ....
R. I. Wilkinson, "Theories for Toll Traffic Engineering in the U.S.A.," Bell System Technical Journal, Vol. 35, No. 2, March 1956, pp. 421-514.
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