A.I. Elwalid and D. Mitra, "Analysis approximations and admission control of a multi-service multiplexing system with priorities," in Proceedings of IEEE INFOCOM'95, 1995, pp. 463--472.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... this problem, the authors introduced an improvement by taking the minimum of 4 and the Gaussian approximation of the probability by which the input rate exceeds the output channel capacity (for details refer to the original paper [8] In the same spirit, a new approximation is proposed in [9]. The factor a 0 hOE 0 ; 1i is replaced by a new factor L 0 obtained from a bufferless model by using large deviation theory, leading to G(x) L 0 e z0x ; 5) where the factor L 0 is actually the Chernoff s large deviation approximation to the probability that the instantaneous input rate ....

....for the aggregate and individual CLRs. We present in the following a sample of figures representing the cell loss probability as a function of the buffer size. In these figures, our results are compared to those obtained from a simulation and to those obtained from approximation (5) proposed in [9]. Figure 1 shows the cell loss probability against the buffer size for a superposition of 100 independent on off sources with exponentially distributed on and off periods. The peak bitrate is 2 Mbits s, the mean bitrate 0 1 2 3 4 5 6 7 8 9 10 x 10 4 10 5 10 4 10 3 10 2 10 1 10 ....

A. I. Elwalid and D. Mitra, "Analysis, approximations and admission control of multi-service multiplexing system with priorities," in IEEE Infocom'95, pp. 463--472, 1995.

....traffic sources case, as shown in [4] z 0 (C) can be obtained as the largest negative solution of a non linear equation, which can be solved numerically. The determination of the constant A(C) proves, however, much more difficult. Many approximations of A(C) have been proposed [1] 7] [8], 9] The tighter the approximation of A(C) to the intercept of the exact cell loss probability, the better is the approximation of G(x) and thus of the required bandwidth. In this paper, we address the determination of a new tight approximation of the intercept 3 A(C) This approximation is ....

.... authors introduced an improvement by taking the minimum of this approximation and the Gaussian approximation of the probability that the input rate exceeds the output channel capacity (for details refer to the original paper [9] or see [11] In the same spirit, a new approximation is proposed in [8]. The factor a 0 hOE 0 ; 1i is replaced by a new factor L 0 obtained from a bufferless model by using large deviation theory, leading to G(x) L 0 e z0 x : 6) L 0 is actually the Chernoff s large deviation approximation to the probability that the instantaneous input rate exceeds the channel ....

[Article contains additional citation context not shown here]

A. I. Elwalid and D. Mitra, "Analysis, approximations and admission control of multi-service multiplexing system with priorities," in IEEE Infocom'95, pp. 463--472, 1995.

....Related work is reported in [17, 18] Among the main contributions of the work in this paper we consider: ffl The multiclass character of the analytical results and the admission control algorithm. One significant advantage of our scheme, over other priority schemes proposed in the literature ([19]) is that each service class gets the capacity required by its QoS specifications which include both a measure of loss and one of delay. It allows, for instance, class 1 traffic to suffer less delay with a larger loss probability than class 2 traffic, something that can not be achieved with a ....

A. I. Elwalid and D. Mitra, "Analysis, approximations and admission control of a multiple-service multiplexing system with priorities." Preprint, 1994.

....capable of supporting diverse user needs has become a critical problem. The traditional approach to QoS provision uses resource reservation and admission control such that a traffic stream s data rate and burstiness can be suitably accommodated by a network. Although research abounds [1] [2], 3] analytic tools for computing QoS guarantees rely on shaping of input traffic to preserve well behavedness across switches which implement some form of packet scheduling discipline such as generalized S.C. Supported in part by NSF grant ANI 9714707; chensg cs.purdue.edu. K.P. Supported in ....

A. Elwalid and D. Mitra, "Analysis, approximations and admission control of a multi-service multiplexing system with priorities," in Proc. IEEE INFOCOM '95, 1995, pp. 463--472.

....video teleconference applications. Coffman et al. CIK91] considered on off, 2 state sources and gave numerical evidence to support the claim G(0) L. It is easy to show that G(0) L. Simonian and Guibert [SGU94] quote the observation in [CIK91] as partial basis for a related approximation. In [EMI94] the approximation is used for the analysis and admission control of a multi service multiplexing system in which the services are prioritized. The approximation refines the pure exponential form e zB used in effective bandwidth analyses [GAN91, GHU91, EMI93, KWC93, WHI93] Prior studies [HUI90, ....

A. Elwalid and D. Mitra, "Analysis, approximations and admission control of a multi-service multiplexing system with priorities", submitted to INFOCOM `95, August 1994.

No context found.

A.I. Elwalid and D. Mitra, "Analysis approximations and admission control of a multi-service multiplexing system with priorities," in Proceedings of IEEE INFOCOM'95, 1995, pp. 463--472.

No context found.

A. Elwalid and D. Mitra, "Analysis, approximations and admission control of a multi-service multiplexing system with priorities," in Proc. IEEE INFOCOM '95, pp. 463--472, 1995.

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