A Queueing Model for e-Learning System

  • T. Senthil Kumar
  • K. I. Ohhm Prakash
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 325)


There has been much written about e-Learning practice; however, little attention has been given to come out with a mathematical model for e-Learning. As the lack of a proper mathematical model will hinder providing better service to the customers, we have come up with an attempt to make a study on which of the existing mathematical models could fit e-Learning. We argue with statistical data that (M/M/C): (∞/FIFO) is one of the models which best fit e-Learning. This paper aims to provide inputs that the suggested queuing model can be used for e-Learning system in real conditions.


Queue Model Service Hypertext Parameters 


  1. 1.
    P. Sherman, Queuing theory and practice: a source of competitive advantage.
  2. 2.
    J.D.C. Little, A Proof for the Queuing Formula: L = λW”. Oper. Res. 9(3), 383–387 (1961)CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    M. Laguna, J. Marklund, Business Process Modeling, Simulation and Design (Pearson Prentice Hall, NJ, 2005). ISBN 0-13-091519-XGoogle Scholar
  4. 4.
    S.A. Curin, J.S. Vosko, E.W. Chan, O. Tsimhoni, Reducing service time at a busy fast food restaurant on campus, in Proceedings of the 2005 Winter Simulation Conference, IEEE Press (2005)Google Scholar
  5. 5.
    M. Zukerman, Introduction to queuing theory and stochastic teletraffic models.
  6. 6.
    S. Aljawarneh, Z. Muhsin, A. Nsour, F. Alkhateeb, E. AlMaghayreh, e-Learning Tools and Technologies in Education, A Perspective. LINC Proceedings (2010)Google Scholar
  7. 7.
    J.M. Harrison, Brownian Motion and Stochastic Flow Systems (Wiley, New York, 1985)MATHGoogle Scholar
  8. 8.
    J.M. Harrison, L.J. Wein, Scheduling networks of queues: heavy traffic analysis of a two-station closed network. Oper. Res. 38, 1052–1064 (1990)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    L.J. Wein, Scheduling networks of queues: heavy traffic analysis of a two-station network with controllable inputs. Oper. Res. 38, 1065–1078 (1990)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    R. Larson, The queue inference engine: deducing queue statistics from transactional data. Manage. Sci. 36, 586–601 (1990)CrossRefMATHGoogle Scholar
  11. 11.
    D.Y. Burman, An analytic approach to diffusion approximation in queueing. Ph.D. Dissertation, Department of Mathematics, New York University, 1979Google Scholar
  12. 12.
    R. Jain, J.M. Smith, Modelling vehicular traffic flow using M/G/C/C state dependent queueing models. Transp. Sci. 31, 324–336 (1997)CrossRefMATHGoogle Scholar
  13. 13.
    J.G. Dai, On positive Harris recurrence of multiclass queueing networks. A unified approach via fluid limit models. Ann. App. Prob. 5, 49–77 (1995)CrossRefMATHGoogle Scholar
  14. 14.
    J.M. Harrison, V. Nguyen, Brownian models of multiclass queueing networks: Current status and open problems. Queueing Syst. Th. Appl. 13, 5–40 (1993)CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    J.M. Harrison, Brownian models of queueing networks with heterogeneous customer populations, in PTOCI. MA Workshop on Stoc. Diff. Sys. Springer. (1988), pp. 147–186Google Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringAmrita School of EngineeringCoimbatoreIndia

Personalised recommendations