Author:
Agrawal Subhash C.,Buzen Jeffrey P.,Shum Annie W.
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Reference32 articles.
1. The aggregate server method for analyzing serialization delays in computer systems
2. S.C. Agrawal "Metamodeling: A study of approximations in queueing networks " Ph.D. Dissertation Dept. of Computer Science Purdue University West Lafayette IN. (August 1983). S.C. Agrawal "Metamodeling: A study of approximations in queueing networks " Ph.D. Dissertation Dept. of Computer Science Purdue University West Lafayette IN. (August 1983).
3. G. Balbo "Approximate solutions of queueing network models of computer systems " Ph.D. Dissertation Dept. of Computer Science Purdue University West Lafayette IN. (December 1979). G. Balbo "Approximate solutions of queueing network models of computer systems " Ph.D. Dissertation Dept. of Computer Science Purdue University West Lafayette IN. (December 1979).
4. A model of shared DASD and multipathing
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献