Access size and order in queueing systems

Simple item page
dc.contributor.authorAyres, Robert N.en
dc.contributor.departmentElectrical Engineeringen
dc.date.accessioned2016-04-21T15:35:23Zen
dc.date.available2016-04-21T15:35:23Zen
dc.date.issued1974en
dc.description.abstractGeneral queueing systems are discussed in order to familiarize the reader with the problem. Various access arrangements including straight, graded, slipped, and random access multiples are discussed and compared. Blocking probability curves for slipped multiple access order are generated. Cost of access is discussed. Cost per erlang curves, from which optimum access size is determined, are generated. Algorithms for generating these curves are developed. A stage in a progressive telephone switching system is designed as an example.en
dc.description.degreeMaster of Scienceen
dc.format.extentiv, 27 leavesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/10919/70561en
dc.language.isoenen
dc.publisherVirginia Polytechnic Institute and State Universityen
dc.relation.isformatofOCLC# 33352611en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V855 1974.A93en
dc.titleAccess size and order in queueing systemsen
dc.typeThesisen
dc.type.dcmitypeTexten
thesis.degree.disciplineElectrical Engineeringen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V855_1974.A93.pdf
Size:
1.99 MB
Format:
Adobe Portable Document Format
Download

Collections

Masters Theses