10 citations found. Retrieving documents...
C. Courcoubetis and R. Weber, "Effective bandwidths for stationary sources," Prob. Eng. Inf. Sci. vol. 9, pp. 285 -- 296, 1995.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Distributing Layered Encoded Video through Caches - Kangasharju, Hartanto.. (2001)   (30 citations)  (Correct)

....(With a typical fixed frame rate of 25 frames per second, we have 6 9 4 ) # 25 frames sec. For VBR traffic the frame sizes : vary over time . For the case of VBR traffic with small or moderate variability, let 687 denote the (additive) effective bandwidth [14] [15], 16] 17] 18] of layer ) of video object . The additive effective bandwidth 6 7 can be obtained in a straight forward manner from the frame sizes : a limit on the probability of loss (i.e. buffer overflow, or equivalently delay bound ....

C. Courcoubetis and R. Weber, "Effective bandwidths for stationary sources," Probability in Engineering and Information Sciences, vol. 9, no. 2, pp. 285--294, 1995.


Stochastic system identification for ATM network traffic models - De Cock, De Moor (1998)   (1 citation)  (Correct)

....for measurement based CAC. The first approach is based on the effective bandwidth and the second one on the cell loss ratio. The effective bandwidth ff of a traffic stream is a concept that has been developed during the last years by several authors (see e.g. De Veciana and Walrand (1995) (Courcoubetis and Weber, 1995) and (Kelly, 1996) It is a measure for the use of bandwidth taking into account the varying statistical properties of ATM traffic. It reflects the effective usage of network resources. There is not yet a general accepted definition for the effective bandwidth, but the one described in (Kelly, ....

....is released. The cumulative distribution function and the autocorrelation function of the data are computed and based on these statistical functions a model (e.g. a CMPP) is identified. This model can then be used to compute the effective bandwidth ff of the aggregate traffic on the link. Courcoubetis and Weber (1995) give an expression for the effective bandwidth of a continuous time MMPP. This is easily adapted for a discrete time MMPP. The effective bandwidth of the traffic together with the source parameters S of the new user and of the users who are already sending traffic, will then result in the ....

Courcoubetis C. and Weber R. (1995) Effective bandwidths for stationary sources. Probability in Engineering and Informational Sciences 7, 285-296.


On the Large Deviations Behaviour of Acyclic.. - Bertsimas.. (1994)   (9 citations)  (Correct)

....large deviations theory, as we do in this paper. This approach is used in [dVW92] to estimate the tail probability of the queue length in a G G 1 queue. In that paper, a discrete time model was used in contrast to the continuous time model that we use in this paper. Similar results are obtained in [CW93]. The second approach is to use spectral decomposition techniques. This second approach is used in [EM93] to estimate the tail probability of the queue length in a queue with a deterministic server and Markov modulated arrival process. Results for the single queue case were first obtained in ....

C. Courcoubetis and R. Weber, Effective bandwidths for stationary sources, Preprint, 1993.


Statistical Multiplexing of Multiple Time-Scale Markov.. - Tse, Gallager, Tsitsiklis (1995)   (32 citations)  (Correct)

....fi 0 E fi ) is the steady state probability that the buffer is full. This can be related to the steady state cell loss probability p(ff; B) by noting that E(X 1 )p(ff; B) P 0 P( fi 0 E fi ) where P 0 is the peak arrival rate. It can be shown, using techniques similar to those in [dVW93] and [CW93], that in the large deviations regime, lim sup B 1;ff 0 1 B log p(B; ff) sup fi 0 lim sup B 1;ff 0 1 B log P(E fi ) Gamma inf fi 0 fi max (c 1 fi ) 4.11) This is essentially an example of Laplace s principle, that the probability of a rare event is of the same order of ....

C. Courcoubetis and R. Weber. Effective bandwidths for stationary sources. Preprint, 1993.


Admission Control for Statistical QoS: Theory and Practice - Knightly, Shroff (1999)   (38 citations)  (Correct)

....multiplexer. Our goals in this paper are threefold. First, we describe a broad set of admission control algorithms from the literature which we divide into the following five classes: 1) tests based on average and peak rate combinatorics [17, 35] 2) tests based on additive effective bandwidths [11, 15, 23, 26], 3) tests based on engineering the loss curve [2, 9, 14, 45] 4) tests based on maximum variance approaches [7, 27, 30] and (5) tests based on refinements of effective bandwidths using large deviations theory. Second, we perform a large number of experiments to evaluate the accuracy and ....

....a delay bound violation, and by summing their respective probabilities. In this paper, we evaluate the test of [35] which we refer to as the Avg Peak test. 2. 2 Additive Effective Bandwidths Various effective bandwidth admission control tests have been proposed in the literature including [11, 15, 23, 26]. In such schemes, each flow independently reserves a particular bandwidth between its average and peak rate. This bandwidth, termed effective bandwidth, is a function of the required loss probability P l and the particular flow s stochastic properties (such as autocorrelation function, or peak ....

[Article contains additional citation context not shown here]

C. Courcoubetis and R. Weber, "Effective Bandwidths for Stationary Sources," Probability in Engineering and Informational Sciences, vol. 9, no. 2, pp. 285--294, 1995.


Performance Analysis and Pricing in Broadband Networks - Siris   Self-citation (Courcoubetis)   (Correct)

....buffer, we have the large buffer asymptotic. When the capacity and buffer per source are kept constant and we study the overflow probability when the size of the system (the link and the multiplexed sources) increases, we have the many sources asymptotic. According to the large buffer asymptotic [CW95, dVW95, EM93, KWC93, and the references therein] the logarithm of the overflow probability decreases linearly with the buffer size B, i.e. 1.1) where ffi is a positive constant which depends on the link capacity and the statistical properties of the multiplexed traffic. The large buffer ....

....in a buffer of size B which is served at rate C. traffic and their statistical properties) Asymptotic analysis is concerned with how the buffer overflow probability decays as some quantity increases. If this quantity is the size of the buffer, then we have the large buffer asymptotic [CW95, dVW95, EM93, KWC93] If the buffer per source and capacity per source are kept constant, and we are interested in how the overflow probability decays as the size of the system (the link and the multiplexed sources) increases, then we have the many sources asymptotic; this asymptotic regime has ....

[Article contains additional citation context not shown here]

C. Courcoubetis and R. Weber. Effective bandwidths for stationary sources. Prob. Eng. Inf. Sci., 9:285--296, 1995.


Using Asymptotic Techniques in Call Acceptance Management.. - Courcoubetis, Fouskas (1992)   Self-citation (Courcoubetis)   (Correct)

....Management for ATM networks C. Courcoubetis G. Fouskas Department of Computer Science, University of Crete and Institute of Computer Science, FORTH. Abstract We discuss the issue of providing effective Call Acceptance Management (CAM) for ATM networks in connection with the work presented in [1, 7, 8]. Two different approaches are described which can be used for CAM. The first approach is based on a fast estimation method for the spare capacity in the network. The second approach is based on an adaptive method for the calculation of the effective bandwidths of traffic sources. This method ....

....2, 5, 9] is that the effective bandwith calculation is based on a particular model of the traffic source. Hence, since in reality such models are fairly inacurate, any pre calculation of the effective bandwidth and hence of the acceptance region is of questionable value. The approach described in [8] is a remedy to the above problem since it allows the adaptive calculation of a good approximation of the effective bandwidth for a large number of types of traffic sources. It requires the estimation of the index of dispersion of the input process produced by a source. This is a well known ....

[Article contains additional citation context not shown here]

C. Courcoubetis and R. Weber, "Effective Bandwidths for Stationary Sources", sent for publication.


Effective Bandwidth Based Scheduling for Streaming Multimedia - Kang, Zakhor (2003)   (Correct)

No context found.

C. Courcoubetis and R. Weber, "Effective bandwidths for stationary sources," Prob. Eng. Inf. Sci. vol. 9, pp. 285 -- 296, 1995.


Distributing Layered Encoded Video through Caches - Kangasharju, Hartanto.. (2001)   (30 citations)  (Correct)

No context found.

C. Courcoubetis and R. Weber, "Effective bandwidths for stationary sources," Probability in Engineering and Information Sciences, vol. 9, no. 2, pp. 285--294, 1995.


Notes on Effective Bandwidths - Kelly (1996)   (106 citations)  (Correct)

No context found.

Courcoubetis, C. and Weber, R. (1995). Effective bandwidths for stationary sources. Prob. Eng. Inf. Sci., 9, 285-296.

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