| Kelly, F.P. and Williams R.J. (ed.) (1995). Stochastic Networks. Springer Verlag, New York. |
....w ij, n ( i j M w ij, n ( ij M , CHAPTER 2 The LQF and OCF Algorithms 31 described in Chapter 1, this cannot be verified by exhaustively simulating all traffic patterns; there are too many. The situation, thus, requires an analytical approach. Using the method of Lyapunov functions [22][32], it was proved in [49] that LQF can achieve 100 throughput for all traffic patterns if arrivals are independent. How LQF achieves high throughput for non uniform traffic can be intuitively explained as follows. A switch is more able to transfer a large number of cells (i.e. connect a large ....
Kelley, F.P.; Williams, R.J.; "Stochastic networks," Springer-Verlag, New York, 1995.
No context found.
Kelly, F.P. and Williams R.J. (ed.) (1995). Stochastic Networks. Springer Verlag, New York.
....for multiclass networks. Indeed, the question of whether these nominal quantities actually correspond to long run quantities is related to the stability properties of the queueing network. Rather than digressing to discuss this further here, the reader is referred to the articles on stability in [KW95], the references therein, and the article [Br98] by Bramson. Here and ae are simply regarded as useful parameters. Networks that are (nominally) heavily loaded or in heavy traffic are those in which ae j is close to one for each j. Such networks are the focus of attention in the next section. 4 ....
Kelly, F. P., and Williams, R. J. (eds.) (1995). Stochastic Networks. Vol. 71, Springer.
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