Pollaezek-Khinchin formula for the M/G/1 queue in discrete time with vacations

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Chan, WC	en_US
dc.contributor.author	Lu, TC	en_US
dc.contributor.author	Chen, RJ	en_US
dc.date.accessioned	2014-12-08T15:01:39Z	-
dc.date.available	2014-12-08T15:01:39Z	-
dc.date.issued	1997-07-01	en_US
dc.identifier.issn	1350-2387	en_US
dc.identifier.uri	http://hdl.handle.net/11536/468	-
dc.description.abstract	The 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.iso	en_US	en_US
dc.subject	Pollaczek-Khinchin formula	en_US
dc.subject	M/G/1 queue in discrete time	en_US
dc.title	Pollaezek-Khinchin formula for the M/G/1 queue in discrete time with vacations	en_US
dc.type	Article	en_US
dc.identifier.journal	IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES	en_US
dc.citation.volume	144	en_US
dc.citation.issue	4	en_US
dc.citation.spage	222	en_US
dc.citation.epage	226	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000073870600004	-
dc.citation.woscount	13	-
顯示於類別：	期刊論文

文件中的檔案：

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。