D. Artiges and P. Nain, "Upper and Lower Bounds for the Multiplexing of Multiclass Markovian on/off Sources," Perf. Eval., vol. 27 and 28, pp. 673--698, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bounds For Fluid Models Driven By Semi-Markov Inputs - Gautam, Kulkarni.. (1999) (Correct)
.... deriving upper and lower bounds for the tail of buffer content process in steady state with a Markov additive input by discretizing time and using extensions of Kingman s exponential bounds for waiting times in the stationary regime in a G=G=1 queue (see Kingman [18] Ross [31] Artiges and Nain [2], and Liu et al. [24] Artiges and Nain [2] obtain exponential bounds for multiplexing multiclass Markovian on off sources, where the upper bounds are similar to those in Palmowski and Rolski [29] Liu et al. [24] obtain exponential bounds for a large class of single resource systems fed by ....
.... of buffer content process in steady state with a Markov additive input by discretizing time and using extensions of Kingman s exponential bounds for waiting times in the stationary regime in a G=G=1 queue (see Kingman [18] Ross [31] Artiges and Nain [2] and Liu et al. [24] Artiges and Nain [2] obtain exponential bounds for multiplexing multiclass Markovian on off sources, where the upper bounds are similar to those in Palmowski and Rolski [29] Liu et al. [24] obtain exponential bounds for a large class of single resource systems fed by multiplexing Markov Arrival Processes in discrete ....
D. Artiges and P. Nain (1996). Upper and Lower Bounds for the Multiplexing of Multiclass Markovian On/Off Sources. Performance Evaluation, 27 & 28, 673--698.
On a Reduced Load Equivalence for Fluid Queues Under.. - Agrawal, Makowski, Nain (1998) (19 citations) Self-citation (Nain) (Correct)
.... modulated fluid models which has been extensively studied [1, 12, 23, 27] since the seminal work of Kosten [20] A fairly comprehensive theory has been developed for such sources, and algorithms are now available for the numerical evaluation of the tail distribution P [W x] for all values of x [2, 27]. On the other hand, the situation is quite different when at least one of the on off sources has heavy tailed on periods. The need for considering such models with heavy tailed components can be traced back to recent measurements of network traffic [21] which exhibit long range dependence and ....
D. Artiges and P. Nain, "Upper and lower bound for the multiplexing of multiclass Markovian on/off sources," Performance Evaluation, 27&28:673-698, 1996.
Computational Aspects of the Workload Distribution in .. - Jean-Marie, Liu.. (1998) Self-citation (Nain) (Correct)
.... In these experiments, the source consists of a superposition of two types of binary sources having the following characteristics q (1) 0 = 1:5384; q (1) 1 = 2:8409; 1) 0 = 0; 1) 1 = 0:064; q (2) 0 = 1:25; q (2) 1 = 5:0; 2) 0 = 0; 2) 1 = 0:32: These numbers are taken from [3], and are derived from voice traOEc data. The source is the superposition of twelve type 1 and six type 2 sources (N 1 = 12, N 2 = 6) The service time distribution is two phase Erlang with an average adjusted to achieve dioeerent loads. Figures 1, 2 and 3 compare the exact value of P(W x) with ....
D. Artiges and P. Nain. Upper and lower bounds for the multiplexing of multiclass Markovian on/ooe sources. Performance Evaluation, 27&28, pp. 673698, 1996.
Per-flow Delay Performance in Traffic Aggregates - Siripongwutikorn, Banerjee (2002) (Correct)
No context found.
D. Artiges and P. Nain, "Upper and Lower Bounds for the Multiplexing of Multiclass Markovian on/off Sources," Perf. Eval., vol. 27 and 28, pp. 673--698, 1996.
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