论文信息 - Moments of Conditional Sojourn Times in Finite Capacity M/M/1/N-PS Processor Sharing Queues

Moments of Conditional Sojourn Times in Finite Capacity M/M/1/N-PS Processor Sharing Queues

Moments of sojourn times conditioned on the length of an admitted job are derived for a finite capacity M/M/1/N-PS processor sharing queue. The mean conditional sojourn time is given in closed form whereas an expression is provided for the conditional variance in such systems involving matrix-vector operations.

Nail Akar

[1] S. Shenker. Fundamental Design Issues for the Future Internet , 1995 .

[2] D. Mitra,et al. Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[3] Edward G. Coffman,et al. Waiting Time Distributions for Processor-Sharing Systems , 1970, JACM.

[4] N. Hegde,et al. Sojourn times in finite-capacity processor-sharing queues , 2005, Next Generation Internet Networks, 2005.

[5] Sem C. Borst. User-level performance of channel-aware scheduling algorithms in wireless data networks , 2005, IEEE/ACM Transactions on Networking.

[6] Laurent Massoulié,et al. Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[7] Natarajan Gautam,et al. A fluid queueing model for link travel time moments , 2004 .

[8] Na Chen,et al. Violation Probability in Processor-Sharing Queues , 2008, IEEE Transactions on Automatic Control.

[9] J. W. Cohen,et al. The multiple phase service network with generalized processor sharing , 1979, Acta Informatica.

[10] Scott Shenker,et al. Fundamental Design Issues for the Future Internet (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..