Moments of conditional sojourn times in finite capacity M/M/1/N-PS processor sharing queues

dc.citation.epage535en_US
dc.citation.issueNumber4en_US
dc.citation.spage533en_US
dc.citation.volumeNumber16en_US
dc.contributor.authorAkar, N.en_US
dc.date.accessioned2016-02-08T09:47:42Z
dc.date.available2016-02-08T09:47:42Z
dc.date.issued2012en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractMoments 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.en_US
dc.identifier.doi10.1109/LCOMM.2012.020212.112310en_US
dc.identifier.issn1089-7798
dc.identifier.urihttp://hdl.handle.net/11693/21533
dc.language.isoEnglishen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/LCOMM.2012.020212.112310en_US
dc.source.titleIEEE Communications Lettersen_US
dc.subjectConditional sojourn timeen_US
dc.subjectProcessor sharing queueen_US
dc.subjectClosed formen_US
dc.subjectConditional varianceen_US
dc.subjectFinite capacityen_US
dc.subjectMatrix-vectoren_US
dc.subjectProcessor sharing queueen_US
dc.subjectSojourn timeen_US
dc.subjectElectrical engineeringen_US
dc.subjectMathematical modelsen_US
dc.subjectQueueing theoryen_US
dc.titleMoments of conditional sojourn times in finite capacity M/M/1/N-PS processor sharing queuesen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Moments of conditional sojourn times in finite capacity M M 1 N PS processor sharing queues.pdf
Size:
116.27 KB
Format:
Adobe Portable Document Format
Description:
Full printable version