Name
Abstract | ||
|---|---|---|
This paper gives a simple, accurate first order asymptotic analysis of the transient and steady state behavior of a network which is closed, not product-form and has multiple classes. One of the two nodes of the network is an infinite server and the discipline in the other node is discriminatory processor-sharing. Specifically, if there are nj jobs of class j at the latter node, then each class j job receives a fraction wj/(&Sgr;wini) of the processor capacity. This work has applications to data networks. For the asymptotic regime of high loading of the processor and high processing capacity, we derive the explicit first order transient behavior of the means of queue lengths. We also give explicit expressions for the steady state mean values and a simple procedure for finding the time constants (eigenvalues) that govern the approach to steady state. The results are based on an extension of Kurtz's theorem concerning the fluid limit of Markov processes. Some numerical experiments show that the analysis is quite accurate. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1145/75108.75394 | SIGMETRICS |
Keywords | Field | DocType |
discriminatory processor-sharing server,explicit expression,high loading,class j,latter node,steady state behavior,closed network,asymptotic regime,data network,steady state,class j job,high processing capacity,markov process,asymptotic analysis,eigenvalues,time constant,first order | Applied mathematics,Fluid limit,Discrete mathematics,Markov process,Expression (mathematics),Computer science,Queue,Processor sharing,Steady state,Asymptotic analysis,Eigenvalues and eigenvectors,Distributed computing | Conference |
Volume | Issue | ISSN |
17 | 1 | 0163-5999 |
ISBN | Citations | PageRank |
0-89791-315-9 | 9 | 1.53 |
References | Authors | |
6 | 2 | |