The M/M/1 Queue with Randomly Varying Arrival and Service Rates.

reportActive / Technical Report | Accession Number: ADA045943 | Open PDF

Abstract:

Computationally feasible solutions are studied for a number of problems related to a MM1 queve in which the arrival and service rates vary according to the state of an underlying Markov chain. Our results may be used to mode the effects of rush-hour phenomena or other extraneous fluctuations on the characteristics of an MM1 queue.

Author(s):
Neuts, Marcel F.
Author Organization(s):
DELAWARE UNIV NEWARK DEPT OF STATISTICS AND COMPUTER SCIENCE
Descriptive Note:
Technical rept.,
Pagination:
0025

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
TR-77/11, AFOSR-TR-77-1233
Contract/Grant Number(s):
AFOSR-77-3236
Task Number(s):
A5
Project Number(s):
2304
Monitor Series:
TR-77-1233
 Subject Terms
Joint Capability Areas:
JCA_6.4.1_Secure Information Exchange; JCA_6_Net Centric; JCA_6.4_Information Assurance; JCA_5_Command and Control
Modernization Areas:
Fully Networked C3
Communities of Interest:
Materials and Manufacturing Processes
Descriptor(s):
*QUEUEING THEORY, *OPERATIONS RESEARCH, *MARKOV PROCESSES, PROBABILITY DISTRIBUTION FUNCTIONS, MATRICES(MATHEMATICS), TRANSFORMATIONS(MATHEMATICS), STATISTICAL PROCESSES
Field(s)/Group(s):
Operations Research
Keyword(s):
Birth and death processes, Markov chains, Random environment, Waiting time, PE61102F, WUAFOSR2304A5
Report Date:
1977 Jul 01