Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Mean-Value Analysis of Closed Multichain Queuing Networks
Journal of the ACM (JACM)
Guest Editor's Overview… Queuing Network Models of Computer System Performance
ACM Computing Surveys (CSUR)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
Approximate Methods for Analyzing Queueing Network Models of Computing Systems
ACM Computing Surveys (CSUR)
The aggregate server method for analyzing serialization delays in computer systems
ACM Transactions on Computer Systems (TOCS)
A model of shared DASD and multipathing
Communications of the ACM
Analysis of locking policies in database management systems
Communications of the ACM
Decomposability, instabilities, and saturation in multiprogramming systems
Communications of the ACM
Computational algorithms for closed queueing networks with exponential servers
Communications of the ACM
A Method for Obtaining Approximate Solutions to Closed Queueing Networks with General Service Times
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Some Extensions to Multiclass Queueing Network Analysis
Proceedings of the Third International Symposium on Modelling and Performance Evaluation of Computer Systems: Performance of Computer Systems
The MVA Pre-empt resume priority approximation
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
State space transformations in queueing network modeling
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Performance models of token ring local area networks
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Analytical models for an Ethernet-like local area network link
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Approximate solutions of queueing network models of computer systems
Approximate solutions of queueing network models of computer systems
Metamodeling: a study of approximations in queueing models
Metamodeling: a study of approximations in queueing models
Multiple class memory constrained queueing networks
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Fast approximate solution of multiprogramming models
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Control policies in CSMA local area networks: ethernet controls
SIGMETRICS '82 Proceedings of the 1982 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Approximate Analysis of Load Dependent General Queueing Networks
IEEE Transactions on Software Engineering
SIQUEUE-PET: an environment for queueing network modelling
ACM SIGMETRICS Performance Evaluation Review
An overview of performance prediction in MVS systems and SNA networks
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Approximate Throughput Computation of Stochastic Marked Graphs
IEEE Transactions on Software Engineering
Approximation in non-product form finite capacity queue systems
Future Generation Computer Systems - Systems performance analysis and evaluation
Activity routing in a distributed supply chain: Performance evaluation with two inputs
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Response Time Preservation (RTP) is introduced as a general technique for developing approximate analysis procedures for queueing networks. The underlying idea is to replace a subsystem by an equivalent server whose response time in isolation equals that of the entire subsystem in isolation. The RTP based approximations, which belong to the class of decomposition approximations, can be viewed as a dual of the Norton's Theorem approach for solving queueing networks since it matches response times rather than throughputs. The generality of the RTP technique is illustrated by developing solution procedures for several important queueing systems which violate product form assumptions. Examples include FCFS servers with general service times, FCFS servers with different service times for multiple classes, priority scheduling, and distributed systems.