Discrete-time Analysis of a Cyclic Service System with Gated Limited Service

This study deals with cyclic service systems with gated limited service, where each q u e u e has a xed, but individual limit. An approximate discrete-time analysis for the cycle-length and waiting-time distribution for such systems is presented, considering general renewal input traac, service time and switch-over time distributions. To catch the correlation between the state processes of the queues, the weighted sum of the cycle-time distribution of an uncorrelated and a perfectly correlated system are used, as in 6]. Thus whole distributions are calculated, higher moments and quantiles can beobtained. Numerical results are given to show the accuracy of the approximation.

[1]  Hermann Gold,et al.  Multi Server Batch Service Systems in Push and Pull Operating Mode - a Performance Comparison , 1991 .

[2]  Phuoc Tran-Gia,et al.  Approximate Performance Analysis of the DQDB Acess Protocol , 1990, Comput. Networks ISDN Syst..

[3]  Phuoc Tran-Gia,et al.  Performance Analysis of Finite Capacity Polling Systems with Nonexhaustive Service , 1988, Perform. Evaluation.

[4]  Phuoc Tran-Gia,et al.  Discrete-time analysis of cell spacing in ATM systems , 1994, Telecommun. Syst..

[5]  Eric Allender,et al.  A note on the power of threshold circuits , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Ulrich Hertrampf.  Locally Definable Acceptance Types - The Three-Valued Case , 1992, LATIN.

[7]  N Gerlich,et al.  Reducing the Variance of Sojourn times in Queueing Networks with Overtaking , 1993 .

[8]  M. Ritter,et al.  Blocking in Multi-service Broadband Systems with Cbr and Vbr Input Traac , 1992 .

[9]  P. J. Kuehn,et al.  Multiqueue systems with nonexhaustive cyclic service , 1979, The Bell System Technical Journal.

[10]  Phuoc Tran-Gia,et al.  An Analysis of Multi-Service Systems with Trunk Reservation Mechanisms , 1992 .

[11]  Miroslaw Kowaluk,et al.  Vector Language: Simple Description of Hard Instances (Extended Abstract) , 1990, MFCS.

[12]  Michael R. Frater,et al.  A Comparison of Models for VBR Video Traffic Sources in B-ISDN , 1994, Broadband Communications.

[13]  Phuoc Tran-Gia,et al.  Performance of a neural net scheduler used in packet switching interconnection networks , 1993, IEEE International Conference on Neural Networks.

[14]  F. H. Ubner.  Analysis of a nite capacity asynchronous multiplexer with periodic sources , 1990 .

[15]  高木 英明,et al.  Analysis of polling systems , 1986 .

[16]  Manfred Mittler,et al.  Triggering Scheduler , 1993 .

[17]  Steve W. Fuhrmann,et al.  Analysis of Cyclic Service Systems with Limited Service: Bounds and Approximations , 1988, Perform. Evaluation.

[18]  Hermann Gold,et al.  Performance Analysis of a Batch Service System , 1994 .

[19]  Heribert Vollmer,et al.  The Complexity of Finding Middle Elements , 1993, Int. J. Found. Comput. Sci..

[20]  Krzysztof Lorys,et al.  The Variable Membership Problem: Succinctness Versus Complexity , 1994, STACS.

[21]  Conny Friedewald,et al.  WUMPS, Würzburger Message Passing System , 1990, Transputer-Anwender-Treffen.

[22]  Sajal K. Das,et al.  Incomplete Hypercubes: embeddings of Tree-Related Networks , 1995, J. Parallel Distributed Comput..

[23]  F Hh.  Autocorrelation and Power Density Spectrum of Atm Multiplexer Output Processes , 1992 .

[24]  Christoph Meinel,et al.  Structure and Importance of Logspace-MOD-Classes , 1991, STACS.

[25]  F Hh,et al.  Queueing Analysis of Resource Dispatching and Scheduling in Multi-media Systems , 1991 .

[26]  Phuoc Tran-Gia,et al.  Performance analysis of a batch service queue arising out of manufacturing system modelling , 1993, Queueing Syst. Theory Appl..

[27]  Frank Puppe,et al.  COKE: efficient solving of complex assignment problems with the propose-and-exchange method , 1992, Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92.

[28]  F Hh,et al.  Discrete-time Analysis of the Output Process of an Atm Multiplexer with Periodic Input , 1991 .

[29]  Phuoc Tran-Gia,et al.  Basic Concepts and Performance of High-Speed Protocols , 1993, Integrated Broadband Communications.

[30]  Kin K. Leung,et al.  Cyclic-Service Systems with Probabilistically-Limited Service , 1991, IEEE J. Sel. Areas Commun..

[31]  Steve W. Fuhrmann,et al.  Mean Waiting Time Approximations of Cyclic Service Systems with Limited Service , 1987, Performance.

[32]  F Hh,et al.  Output Process Analysis of the Peak Cell Rate Monitor Algorithm , 1994 .

[33]  Phuoc Tran-Gia.  Analysis of polling systems with general input process and finite capacity , 1992, IEEE Trans. Commun..

[34]  Lane A. Hemaspaandra,et al.  Using Inductive Counting to Simulate Nondeterministic Computation , 1990, MFCS.

[35]  David Everitt.  A note on the pseudoconservation laws for cyclic service systems with limited service disciplines , 1989, IEEE Trans. Commun..

[36]  Jack H. Lutz,et al.  On Complexity Classes and Algorithmically Random Languages (Extended Abstract) , 1992, STACS.

[37]  T. Fritsch,et al.  Communication network routing using neural nets-numerical aspects and alternative approaches , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[38]  Eric Allender,et al.  On the Power of Uniform Families of Constant Depth Treshold Circuits , 1990, MFCS.

[39]  Phuoc Tran-Gia,et al.  Structure and Performance of Neural Nets in Broadband System Admission Control , 1994 .

[40]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[41]  Ronald V. Book.  On Random Oracle Separations , 1991, Inf. Process. Lett..

[42]  F Hh,et al.  Dimensioning of a Peak Cell Rate Monitor Algorithm Using Discrete-time Analysis , 1993 .

[43]  Celia Wrathall.  Confluence of One-Rule Thue Systems , 1990, IWWERT.

[44]  Ulrich Hertrampf.  Locally Definable Acceptance Types for Polynomial Time Machines , 1992, STACS.