Back to results
Virginia Polytechnic Institute and State University
Access size and order in queueing systems
Abstract
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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science
- Level thesis:degree_level
- masters
- Discipline thesis:degree_discipline
- Electrical Engineering
- Department dc:contributor.department
- Electrical Engineering
- Grantor dc:publisher
- Virginia Polytechnic Institute and State University
- Year dc:date.issued
- 1974
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Ayres, Robert N.
Rights
dc:rights- Statement dc:rights
-
- In Copyright
- Licence dc:rights.uri
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/10919/70561
- OAI identifier oai:identifier
- oai:vtechworks.lib.vt.edu:10919/70561