Diffusion Approximation Model of Multiserver Stations with Losses

Electronic Notes in Theoretical Computer Science

Volumn 232, Issue C, 2009, Pages 125-143

  Czachórski, Tadeusz ^a   Fourneau, Jean Michel ^b   Nycz, Tomasz ^c   Pekergin, Ferhan ^b  

^a INSTITUTE OF THEORETICAL AND APPLIED INFORMATICS   (Poland)

^b UNIVERSITY OF VERSAILLES   (France)

^c SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

call center; diffusion approximation; G G N N queue; sliding window mechanism; transient analysis

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DIFFUSION; QUEUEING THEORY; TELECOMMUNICATION SERVICES; TRANSIENT ANALYSIS;

CALL CENTERS; DIFFUSION APPROXIMATIONS; G/G/N/N /QUEUE; INTER-ARRIVAL TIME; PARALLEL SERVERS; SERVICE TIME DISTRIBUTION; SLIDING WINDOW MECHANISM; TRANSIENT STATE;

APPROXIMATION ALGORITHMS;

EID: 62949137221     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.02.054     Document Type: Article

References (14)

1. Cox R.P., and Miller H.D. The Theory of Stochastic Processes (1965), Chapman and Hall, London, UK
2. Czachórski T. A method to solve diffusion equation with instantaneous return processes acting as boundary conditions. Bulletin of Polish Academy of Sciences, Technical Sciences 41 4 (1993)
3. Czachórski T., and Pekergin F. A diffusion approximation model of an electronic-optical node. Proc. of 2nd European Performance and Engineering Workshop. EPEW 05, Versailles, 1-3 September 2005. LNCS no. 3670 (2005), Springer Verlag 187-199
4. Czachórski T., Grochla K., and Pekergin F. Diffusion approximation model for the distribution of packet travel time at sensor networks. Wireless Systems and Mobility in Next Generation Internet. LNCS no. 5122 (2008)
5. Gans N., Koole G., and Mandelbaum A. Telephone Call Centers Tutorial, Review, and Research Prospects. Manufacturing & Service Operations Management 5 (2003) 79-141
6. Gelenbe E. On Approximate Computer Systems Models. J. ACM 22 2 (1975)
7. Gelenbe E., and Pujolle G. The Behaviour of a Single Queue in a General Queueing Network. Acta Informatica 7 Fasc. 2 (1976) 123-136
8. Green L.V., Kolesar P.J., and Whitt W. Coping with Time-Varying Demand when Setting Staffing Requirements for a Service System. Production and Operations Management (POMS) 16 1 (2007) 13-39
9. Iglehart D. Weak Convergence in Queueing Theory. Advances in Applied Probability 5 (1973) 570-594
10. Kleinrock L. Queueing Systems, vol. I: Theory, vol. II: Computer Applications (1975), Wiley, New York, USA 1976
11. Kobayashi H. Modeling and Analysis: An Introduction to System Performance Evaluation Methodology (1978), Addison Wesley, Reading, Massachusetts USA
12. Newell G.F. Applications of Queueing Theory (1971), Chapman and Hall, London
13. Stehfest H. Algorithm 368: Numeric inversion of Laplace transform. Comm. of ACM 13 1 (1970) 47-49
14. Whitt W. A Diffusion approximation for the G/G/n/m Queue. Operations Research 52 6 (2004) 922-941