Advertisement

On a Multi-server Priority Queue with Preemption in Crowdsourcing

  • A. KrishnamoorthyEmail author
  • Dhanya Shajin
  • A. S. Manjunath
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10684)

Abstract

A c–server queueing system providing service to two types of customers, say, Type 1 and Type 2 to which customers arrive according to a marked Poisson process is considered. A Type 1 customer has to receive service by one of c servers while a Type 2 customer may be served by a Type 1 customer (with probability p) who is available to act as a server soon after getting own service or by one of c servers. Upon completion of a service a free server will offer service to a Type 1 customer on a FCFS basis. However, if there is no Type 1 customer waiting in the system, that server will serve a Type 2 customer if one of that type is present in the queue. The service time is exponentially distributed for each category. We consider preemptive service discipline. Condition for system stability is established. Crucial system characteristics are computed.

Keywords

Crowdsourcing Queueing system Preemptive service Matrix-analytic method 

Notes

Acknowledgments

Research of the first and second authors is supported by Kerala State Council for Science, Technology & Environment (No. 001/KESS/2013/CSTE). Research of the third author is supported by the University Grants Commission, Government of India, under Faculty Development Programme (Grant No. F. FIP/12th Plan/KLMG003TF05).

References

  1. 1.
    Brodal, G.S.: A survey on priority queues. In: Brodnik, A., López-Ortiz, A., Raman, V., Viola, A. (eds.) Space-Efficient Data Structures, Streams, and Algorithms. LNCS, vol. 8066, pp. 150–163. Springer, Heidelberg (2013).  https://doi.org/10.1007/978-3-642-40273-9_11 CrossRefGoogle Scholar
  2. 2.
    Chakravarthy, S.R., Dudin, A.N.: A queueing model for crowdsourcing. J. Oper. Res. Soc. 68, 221–236 (2016)CrossRefGoogle Scholar
  3. 3.
    Howe, J.: Crowdsourcing: a definition (2006). http://www.crowdsourcing.com/cs/2006/06/crowdsourcing_a.html
  4. 4.
    Jaiswal, N.K.: Preemptive resume priority queue. Oper. Res. 9, 732–742 (1961)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Jaiswal, N.K.: Priority Queues. Academic Press, New York, London (1968)zbMATHGoogle Scholar
  6. 6.
    Krishnamoorthy, A., Pramod, P.K., Chakravarthy, S.R.: Queues with interruptions, a survey. Top 22(1), 290–320 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Latouche, G., Ramaswami, V.: An Introduction to Matrix Analytic Methods in Stochastic Modeling. SIAM, Philadelphia (1999)CrossRefzbMATHGoogle Scholar
  8. 8.
    Neuts, M.F.: Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1981). [1994 version is Dover Edition]zbMATHGoogle Scholar
  9. 9.
    Takagi, H.: Queueing Analysis: Vacations and Priority Systems, vol. 1. North-Holland, Amsterdam (1991)zbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • A. Krishnamoorthy
    • 1
    Email author
  • Dhanya Shajin
    • 1
  • A. S. Manjunath
    • 2
  1. 1.Department of MathematicsCochin University of Science and TechnologyCochinIndia
  2. 2.Department of MathematicsGovernment Victoria CollegePalakkadIndia

Personalised recommendations