In this paper we derive an efficient computational procedure for the system in which fluid is produced by N-1 on-off sources of type 1, N-2 on-off sources of type 2 and transferred to a buffer which is serviced by a c...
详细信息
In this paper we derive an efficient computational procedure for the system in which fluid is produced by N-1 on-off sources of type 1, N-2 on-off sources of type 2 and transferred to a buffer which is serviced by a channel of constant capacity. This is a canonical model for multiservice ATM multiplexing, which is hard to analyze and also of wide interest. This paper's approach to the computation of the buffer overflow probability, G(x) = Pr(buffer content > x), departs from all prior approaches in that it transforms the computation of G(x) for a particular x into a recursive construction of an interpolating polynomial. For the particular case of two source types the interpolating polynomial is in two variables. Our main result is the derivation of recursive algorithms for computing the overflowprobability G(x) and various other performance measures using their respective relations to two-dimensional interpolating polynomials. To make the computational procedure efficient we first derive a new system of equations for the coefficients in the spectral expansion formula for G(x) and then use specific properties of the new system for efficient recursive construction of the polynomials. We also develop an approximate method with low complexity and analyze its accuracy by numerical studies. We compute G(x) for different values of x, the mean buffer content and the coefficient of the dominant exponential term in the spectral expansion of G(x). The accuracy of the approximations is reasonable when the buffer utilization characterized by G(O) is more than 10(-2).
A space-division, nonblocking packet switch with data concentration and output buffering is proposed. The performance of the switch is evaluated with respect to packet loss probability, the first and second moments of...
详细信息
A space-division, nonblocking packet switch with data concentration and output buffering is proposed. The performance of the switch is evaluated with respect to packet loss probability, the first and second moments of the equilibrium queue length and waiting time, throughput and buffer overflow probability. Numerical results indicate that the proposed switch exhibits very good delay-throughput performance over a wide range of input traffic. The proposed switch compares favorably with the Knockout switch [10], the Sunshine switch [11], and the modular architecture proposed in [18] in terms of fewer basic building elements used to attain the same degree of output buffering.
暂无评论