| |
Browse All Reviews > Mathematics Of Computing (G) > Miscellaneous (G.m) > Queueing Theory (G.m...)
|
|
 |
|
|
| |
|
|
| |
1-10 of 22
Reviews about "Queueing Theory (G.m...)":
|
Date Reviewed |
| |
Foundations of queueing theory
Prabhu N., Kluwer Academic Publishers, Norwell, MA, 1997. Type: Book (9780792399629)
Prabhu is an eminent author and researcher, and founding editor of the influential journal Queueing Systems. The content, objectives, target audience, and prerequisites for this book are best described by quoting from the prefac...
|
Jun 1 1998 |
| |
Exponential bounds with applications to call admission
Liu Z., Nain P., Towsley D. Journal of the ACM 44(3): 366-394, 1997. Type: Article
Motivated by the need to characterize response time or backlog distributions for the design and analysis of multimedia systems, the authors model one component of such systems as a single-server queue driven by a demand process whose a...
|
Jun 1 1998 |
| |
A comparative study of parallel and sequential priority queue algorithms
Rönngren R., Ayani R. ACM Transactions on Modeling and Computer Simulation 7(2): 157-209, 1997. Type: Article
The priority queue is an important data structure that is essential to the design of many system programs, such as operating systems, as well as to the design of many applications, such as simulations. In fact, priority queues must be ...
|
Nov 1 1997 |
| |
On the convergence of traffic measurement and queueing analysis: a statistical-matching and queueing (SMAQ) tool
Li S., Hwang C. IEEE/ACM Transactions on Networking 5(1): 95-110, 1997. Type: Article
The authors observe that teletraffic analysis can be viewed as a two-step process: describe (measure) the input traffic, and construct a model that predicts the performance of the system when its input traffic has the characteristics o...
|
Sep 1 1997 |
| |
Modeling of optimal load balancing strategy using queueing theory
Spies F. Microprocessing and Microprogramming 41(8-9): 555-570, 1996. Type: Article
Though the writing in this paper is hard to understand--almost incomprehensible--my best guess is that the model the author uses to represent an “optimal load balancing strategy using queueing theoryR...
|
Jul 1 1997 |
| |
Calculating normalization constants of closed queueing networks by numerically inverting their generating functions
Choudhury G., Leung K., Whitt W. Journal of the ACM 42(5): 935-970, 1995. Type: Article
The authors provide an algorithm for calculating normalization constants and moments of product-form steady-state distributions of closed queueing networks. The main concept in this paper is the numerical inversion of the generating fu...
|
Nov 1 1996 |
| |
An Approximate Analysis of the Join the Shortest Queue (JSQ) Policy
Lin H., Raghavendra C. IEEE Transactions on Parallel and Distributed Systems 7(3): 301-307, 1996. Type: Article
The model studied here is that of N identical exponential queues, operating according to the join-the-shortest-queue policy: an arriving customer is routed to the queue with the smallest number of customers, and ther...
|
Nov 1 1996 |
| |
On bounds of response time performance achievable by multiclass single-server queues
Rühl A. Acta Informatica 31(7): 629-650, 1994. Type: Article
The author considers the M/G/1 model with K different classes of customers. The performance is described by a K-dimensional vector whose ith component is the expected response ti...
|
Sep 1 1995 |
| |
Heterogeneous multiprocessor systems with breakdowns
Chakka R., Mitrani I. Theoretical Computer Science 125(1): 91-109, 1994. Type: Article
A service system with a number of machines, subject to failure and repair processes, and a time-homogeneous arrival stream of customers with service requirements is considered. The rates of failure, service, and repair may be different...
|
Mar 1 1995 |
| |
On the sojourn time distribution in a finite capacity processor shared queue
Knessl C. Journal of the ACM 40(5): 1238-1301, 1993. Type: Article
The paper begins with a set of birth-and-death differential-difference equations, of the standard variety, that determine a set of state probabilities that describe the behavior of the model described in the abstract. Knessl then provi...
|
Nov 1 1994 |
| |
|
|
| |
|
|
