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

ISSN： 0005-1179

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

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

A Finite MAP_K/G_K/1 Queueing System with Generalized Foreground-Background Processor-Sharing Discipline

By D'Apice C. Manzo R. Pechinkin A. V.

Automation and Remote Control, Vol. 65, Iss. 11, 2004-11 ,pp. : 1793-1799

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A MAP_K/G_K/1/∞ Queueing System with Generalized Foreground-Background Processor Sharing Discipline

By D'Apice C. Cristofano M. L. Pechinkin A. V.

Automation and Remote Control, Vol. 65, Iss. 12, 2004-12 ,pp. : 1961-1967

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Efficient Solution of A, x ^(k) = b ^(k) Using A ⁻¹

By Ditkowski Adi Fibich Gadi Gavish Nir

Journal of Scientific Computing, Vol. 32, Iss. 1, 2007-07 ,pp. : 29-44

Springer Publishing Company

Access to resources Recommend Favorite

Minimum k Arborescences with Bandwidth Constraints

By Cai Mao-cheng Deng Xiaotie Wang Lusheng

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 529-537

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