Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue

Author： Cheung Sing-Kong   Berg Hans   Boucherie Richard  

Publisher： Springer Publishing Company

ISSN： 0257-0130

Source： Queueing Systems, Vol.53, Iss.1-2, 2006-06, pp. : 7-18

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Sojourn time asymptotics in processor-sharing queues

By Borst Sem   Núñez-Queija Rudesindo   Zwart Bert  

Queueing Systems, Vol. 53, Iss. 1-2, 2006-06 ,pp. : 31-51

Springer Publishing Company

Access to resources Recommend Favorite

Sojourn Times in the M/PH/1 Processor Sharing Queue

By Sericola Bruno   Guillemin Fabrice   Boyer Jacqueline  

Queueing Systems, Vol. 50, Iss. 1, 2005-05 ,pp. : 109-130

Springer Publishing Company

Access to resources Recommend Favorite

Regularly varying tail of the waiting time distribution in M/G/1 retrial queue

By Kim Jerim   Kim Jeongsim   Kim Bara  

Queueing Systems, Vol. 65, Iss. 4, 2010-08 ,pp. : 365-383

Springer Publishing Company

Access to resources Recommend Favorite

A finite capacity BMAP K /G K /1 queue with the generalized foreground-background processor-sharing discipline

By D’Apice C.   Manzo R.  

Automation and Remote Control, Vol. 67, Iss. 3, 2006-03 ,pp. : 428-434

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Tail behavior of conditional sojourn times in Processor-Sharing queues

By Egorova Regina   Zwart Bert  

Queueing Systems, Vol. 55, Iss. 2, 2007-02 ,pp. : 107-121

Springer Publishing Company

Access to resources Recommend Favorite