{"title":"Queueing analysis of an optical disk based office system","authors":"J. Daigle, Robert B. Kuehl, Joseph D. Langford","doi":"10.1109/INFCOM.1988.13002","DOIUrl":null,"url":null,"abstract":"The authors consider worker waiting times and throughput for an optical-disk-based document storage and retrieval system in an office environment. They model the system as a single-server queuing system having a finite number of each of two types of worker: document user and document entry. Worker think times are assumed to be exponentially distributed while job service times are drawn from general distributions; worker think times and job service times are dependent on worker type. Throughput and waiting time as a function of the number of users of each type are analyzed under a nonpreemptive rule in which document use has priority over document entry. The methodology developed to assess average delays in finite-source queuing systems with priority appears to be novel.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"165 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.13002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
The authors consider worker waiting times and throughput for an optical-disk-based document storage and retrieval system in an office environment. They model the system as a single-server queuing system having a finite number of each of two types of worker: document user and document entry. Worker think times are assumed to be exponentially distributed while job service times are drawn from general distributions; worker think times and job service times are dependent on worker type. Throughput and waiting time as a function of the number of users of each type are analyzed under a nonpreemptive rule in which document use has priority over document entry. The methodology developed to assess average delays in finite-source queuing systems with priority appears to be novel.<>