Full metadata record
DC FieldValueLanguage
dc.contributor.authorChan, WCen_US
dc.contributor.authorLu, TCen_US
dc.contributor.authorChen, RJen_US
dc.date.accessioned2014-12-08T15:01:39Z-
dc.date.available2014-12-08T15:01:39Z-
dc.date.issued1997-07-01en_US
dc.identifier.issn1350-2387en_US
dc.identifier.urihttp://hdl.handle.net/11536/468-
dc.description.abstractThe continuous-lime M/G/1 queue with vacations has been studied by many researchers. In the paper the authors report on an investigation of the discrete-time M/G/1 queue using Little's formula and conditional expectation. This direct approach can also be adopted to study the continuous-time case.en_US
dc.language.isoen_USen_US
dc.subjectPollaczek-Khinchin formulaen_US
dc.subjectM/G/1 queue in discrete timeen_US
dc.titlePollaezek-Khinchin formula for the M/G/1 queue in discrete time with vacationsen_US
dc.typeArticleen_US
dc.identifier.journalIEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUESen_US
dc.citation.volume144en_US
dc.citation.issue4en_US
dc.citation.spage222en_US
dc.citation.epage226en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000073870600004-
dc.citation.woscount13-
Appears in Collections:Articles


Files in This Item:

  1. 000073870600004.pdf