Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
 
Queueing Systems: Theory and Applications
J. C. Baltzer AG, Science Publishers
 
   
 
Options:
 
  1-4 of 4 reviews Date Reviewed 
  On the greedy walk problem
Bordenave C., Foss S., Last G. Queueing Systems: Theory and Applications 68(3-4): 333-338, 2011.  Type: Article

The word “problem” in the paper’s title should be “problems.” Thirteen open problems from binomial and Poisson algorithms are discussed mathematically. The term “greedy...

Mar 28 2012
  Tail behaviour of the area under a random process, with applications to queueing systems, insurance and percolations
Kulik R., Palmowski Z. Queueing Systems: Theory and Applications 68(3-4): 275-284, 2011.  Type: Article

Queueing models are used to model applications in various areas, including computer networks, population dynamics, chemical kinetics, stock markets, and actuarial science. These models help provide more insight about such systems and p...

Jan 12 2012
  M/M/1 queueing systems with inventory
Schwarz M., Sauer C., Daduna H., Kulik R., Szekli R. Queueing Systems: Theory and Applications 54(1): 55-78, 2006.  Type: Article

Running out of inventory creates lost sales on one side, and a potential for losing customers on the other. The former is studied in inventory theory, and the latter in queueing theory. This paper combines both inventory management and...

Mar 27 2007
  Modeling teletraffic arrivals by a Poisson cluster process
Faÿ G., González-Arévalo B., Mikosch T., Samorodnitsky G. Queueing Systems: Theory and Applications 54(2): 121-140, 2006.  Type: Article

The modeling of teletraffic arrivals is discussed in this paper. The authors consider a Poisson cluster process as a generating process for these arrivals. This process generalizes, in a realistic manner, the previous model of infinite...

Jan 16 2007
 
 
   
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy