Skip to main content

Controllable Capacity Queue with Synchronous Constant Service Time and Loss

  • Conference paper
  • First Online:
Queueing Theory and Network Applications (QTNA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10932))

Included in the following conference series:

Abstract

In this paper we analyze a queue, in which the number of active servers can be controlled by means of probabilities specifying the dependency of the number of active servers on the actual number of customers and the number of active servers. We call this queue as controllable capacity queue. The service time is constant and the concurrently served customers are served in syncronized manner. The active number of servers can be incremented, decremented or kept unchanged at the ends of service time according to the given probabilities. The system has no buffer for long-term customer waiting, it is a loss system. Such system could be relevant in modeling Machine-To-Machine communication systems, in which the resources are limited.

We provide explicit form results for the joint and marginal distributions of the number of servers and the number of customers on PGF level. We give the condition of the stability and also provide the expressions of the most important system measures including the mean stationary number of servers, the mean stationary number of customers and the blocking probability.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Malak, D., Dhillon, H.S., Andrews, J.G.: Optimizing data aggregation for uplink machine-to-machine communication networks. IEEE Trans. Commun. 64(3), 1274–1290 (2016)

    Article  Google Scholar 

  2. Wang, F.-Y.: Parallel control and management for intelligent transportation systems: Concepts, architectures, and applications. IEEE Trans. Intell. Transp. Syst. 11(3), 630–638 (2010)

    Article  Google Scholar 

  3. Saffer, Z., Telek, M.: Analysis of globally gated Markovian limited cyclic polling model and its application to uplink traffic in the IEEE 802.16 network. J. Ind. Manag. Optim. (JIMO) 7(3), 677–697 (2011)

    Article  MathSciNet  Google Scholar 

  4. Bruneel, H., Walraevens, J., Claeys, D., Wittevrongel, S.: Analysis of a discrete-time queue with geometrically distributed service capacities. In: Al-Begain, K., Fiems, D., Vincent, J.-M. (eds.) ASMTA 2012. LNCS, vol. 7314, pp. 121–135. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-30782-9_9

    Chapter  Google Scholar 

  5. Conway, R.W., Maxwell, W.L.: A queueing model with state dependent service rate. J. Ind. Eng. 12, 132–136 (1961)

    Google Scholar 

  6. Lia, H., Yang, T.: Queues with a variable number of servers. EJOR 124(3), 615–628 (2000)

    Article  MathSciNet  Google Scholar 

  7. Mazalov, V., Gurtov, A.: Queuing system with on-demand number of servers. Math. Appl. 40(2) 15/56, 1–12 (2012)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zsolt Saffer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Saffer, Z., Grill, K., Yue, W. (2018). Controllable Capacity Queue with Synchronous Constant Service Time and Loss. In: Takahashi, Y., Phung-Duc, T., Wittevrongel, S., Yue, W. (eds) Queueing Theory and Network Applications. QTNA 2018. Lecture Notes in Computer Science(), vol 10932. Springer, Cham. https://doi.org/10.1007/978-3-319-93736-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93736-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93735-9

  • Online ISBN: 978-3-319-93736-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics