Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue

ISSN： 0257-0130

Source： Queueing Systems, Vol.49, Iss.3-4, 2005-04, pp. : 363-403

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 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

Maxima of Waiting Times for the Random Order Service M|M|1 Queue

By Lebedev A.

Problems of Information Transmission, Vol. 41, Iss. 3, 2005-07 ,pp. : 296-299

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A direct approach to sojourn times in a busy period of an M/M/1 queue

By Kherani Arzad

Queueing Systems, Vol. 53, Iss. 3, 2006-07 ,pp. : 159-169

Springer Publishing Company

Access to resources Recommend Favorite

Queue length and waiting time of the M/G/1 queue under the D-policy and multiple vacations

By Lee Ho Cheon Sahng Seo Won

Queueing Systems, Vol. 54, Iss. 4, 2006-12 ,pp. : 261-280

Springer Publishing Company

Access to resources Recommend Favorite

Tail asymptotics for the queue size distribution in a discrete-time Geo/G/1 retrial queue

By Kim Bara Kim Jeongsim

Queueing Systems, Vol. 61, Iss. 2-3, 2009-03 ,pp. : 243-254

Springer Publishing Company

Access to resources Recommend Favorite