Abstract
dc:descriptionTHE GOAL OF THIS RESEARCH IS THE DEVELOPMENT OF AN AXIOMATIC APPROACH FOR ANALYZING THE PERFORMANCE OF MULTICLASS SYSTEMS WITH SET-UP TIMES OPERATING IN A DYNAMIC ENVIRONMENT. SUCH SYSTEMS ARE WIDELY USED TO MODEL COMPLEX PRODUCTION AND SERVICE SYSTEMS WITH MULTIPLE TYPES OF CUSTOMERS WHICH MAY DIFFER IN THEIR ARRIVAL PROCESSES, SERVICE REQUIREMENTS AS WELL AS COST OR PROFIT FUNCTIONS. THEY ALSO HAVE IMPORTANT APPLICATIONS IN TELECOMMUNICATIONS, COMPUTER NETWORKS AND TRANSPORTATION SYSTEMS. TO ACHIEVE OUR GOAL WE START BY ADDRESSING A VERY FUNDAMENTAL QUESTION: ARE THERE "LAWS" OF QUEUEING SYSTEMS? IF SO, HOW CAN THEY BE USED TO ANALYZE THE PERFORMANCE OF THE SPECIFIC SYSTEMS WE ARE INTERESTED IN? MOTIVATED BY THESE QUESTIONS, WE ESTABLISH A SET OF "LAWS" THAT RELATE THE DISTRIBUTIONS OF THE QUANTITIES OF INTEREST (E.G. THE NUMBER AND THE DELAY OF JOBS IN A QUEUEING SYSTEM) FOR MULTICLASS QUEUEING SYSTEMS BOTH IN THE STEADY- STATE AND THE TRANSIENT DOMAIN. THESE LAWS COMPLETELY DESCRIBE THE DYNAMICS OF NON-STATIONARY SYSTEMS, PROVIDE INSIGHT ON THE INFLUENCE OF THE INITIAL CONDITIONS AND GENERALIZE THE CLASSICAL LITTLE'S LAW IN A NON-STATIONARY ENVIRONMENT. REGARDING SPECIFIC APPLICATIONS, IN STEADY STATE, WE USE THESE LAWS TO ANALYZE THE PERFORMANCE OF MULTICLASS SINGLE SERVER SYSTEMS WITH GENERAL ARRIVAL AND SERVICE DISTRIBUTIONS UNDER FIFO AND GENERAL PRIORITY POLICIES, QUEUEING SYSTEMS WITH SET UP TIMES (POLLING SYSTEMS) AND FINALLY, MULTISERVER SYSTEMS WITH DETERMINISTIC SERVICE TIMES AND INFINITE SERVER SYSTEMS. (ABSTRACTTRUNCATED)
Degree
thesis:*- Grantor dc:publisher
- Institutes outside Greece
- Year dc:date
- 1995
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Μουρτζίνου, Γεωργία
Subjects
dc:subject × 10Rights
- Language dc:language
- eng
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/5219