Skip to main content
Erschienen in: Queueing Systems 2-4/2013

01.11.2013

Analysis of an \(M/M/1+G\) queue operated under the FCFS policy with exact admission control

verfasst von: Sudipta Das, Lawrence Jenkins, Debasis Sengupta

Erschienen in: Queueing Systems | Ausgabe 2-4/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this article, we present an exact theoretical analysis of an \(M/M/1\) system, with arbitrary distribution of relative deadline for the end of service, operated under the first come first served scheduling policy with exact admission control. We provide an explicit solution to the functional equation that must be satisfied by the workload distribution, when the system reaches steady state. We use this solution to derive explicit expressions for the loss ratio and the sojourn time distribution. Finally, we compare this loss ratio with that of a similar system operating without admission control, in the cases of some common distributions of the relative deadline.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Abdelzaher, T., Lu, C.: Schedulability analysis and utilization bounds for highly scalable real-time services. In: IEEE Real-Time Technology and Applications Symp, pp. 11–25 (2001) Abdelzaher, T., Lu, C.: Schedulability analysis and utilization bounds for highly scalable real-time services. In: IEEE Real-Time Technology and Applications Symp, pp. 11–25 (2001)
2.
Zurück zum Zitat Baccelli, F., Boyer, P., Hebuterne, G.: Single-server queue with impatient customers. Adv. Appl. Probab. 16(4), 887–905 (1984)CrossRef Baccelli, F., Boyer, P., Hebuterne, G.: Single-server queue with impatient customers. Adv. Appl. Probab. 16(4), 887–905 (1984)CrossRef
3.
Zurück zum Zitat Barrer, D.Y.: Queueing with impatient customers and indifferent clerks. Oper. Res. 5(5), 644–649 (1957)CrossRef Barrer, D.Y.: Queueing with impatient customers and indifferent clerks. Oper. Res. 5(5), 644–649 (1957)CrossRef
4.
Zurück zum Zitat Barrer, D.Y.: Queueing with impatient customers and ordered service. Oper. Res. 5(5), 650–656 (1957)CrossRef Barrer, D.Y.: Queueing with impatient customers and ordered service. Oper. Res. 5(5), 650–656 (1957)CrossRef
5.
Zurück zum Zitat Bekker, R.: Finite-buffer queues with workload-dependent service and arrival rates. Queueing Syst. 50, 231–253 (2005)CrossRef Bekker, R.: Finite-buffer queues with workload-dependent service and arrival rates. Queueing Syst. 50, 231–253 (2005)CrossRef
6.
Zurück zum Zitat Boxma, O.J., de Waal, P.R.: Multiserver queues with impatient customers. In: Proceedings of ITC, vol. 14, pp. 743–756. Elsevier, Amsterdam (1994) Boxma, O.J., de Waal, P.R.: Multiserver queues with impatient customers. In: Proceedings of ITC, vol. 14, pp. 743–756. Elsevier, Amsterdam (1994)
7.
Zurück zum Zitat Boxma, O., Perry, D., Stadje, W.: The M/G/1+G queue revisited. Queueing Syst. 67, 207–220 (2011)CrossRef Boxma, O., Perry, D., Stadje, W.: The M/G/1+G queue revisited. Queueing Syst. 67, 207–220 (2011)CrossRef
8.
Zurück zum Zitat Cohen, J.W.: Single server queues with restricted accessibility. J. Eng. Math. 3(4), 265–284 (1969)CrossRef Cohen, J.W.: Single server queues with restricted accessibility. J. Eng. Math. 3(4), 265–284 (1969)CrossRef
9.
Zurück zum Zitat Daley, D.J.: General customer impatience in queue GI/G/1. J. Appl. Probab. 2(1), 186–205 (1965)CrossRef Daley, D.J.: General customer impatience in queue GI/G/1. J. Appl. Probab. 2(1), 186–205 (1965)CrossRef
10.
Zurück zum Zitat Das, S., Jenkins, L., Sengupta, D.: Loss ratios of EDF and FCFS scheduling policies under a performance enhancing modification. In: Proceedings of International Conference on Real-Time and Embedded Systems, pp. 128–131, RTES (2010) Das, S., Jenkins, L., Sengupta, D.: Loss ratios of EDF and FCFS scheduling policies under a performance enhancing modification. In: Proceedings of International Conference on Real-Time and Embedded Systems, pp. 128–131, RTES (2010)
11.
Zurück zum Zitat Gavish, B., Schweitzer, P.: The Markovian queue with bounded waiting time. Manag. Sci. 23(12), 1349–1357 (1977)CrossRef Gavish, B., Schweitzer, P.: The Markovian queue with bounded waiting time. Manag. Sci. 23(12), 1349–1357 (1977)CrossRef
12.
Zurück zum Zitat Haugen, R.B., Even, S.: Queueing systems with stochastic time out. IEEE Trans. Commun. 28(12), 1984–1989 (1980)CrossRef Haugen, R.B., Even, S.: Queueing systems with stochastic time out. IEEE Trans. Commun. 28(12), 1984–1989 (1980)CrossRef
13.
Zurück zum Zitat Liu, L., Kulkarni, V.G.: Explicit solutions for the steady state distributions in M/PH/1 queues with workload dependent balking. Queueing Syst. 52, 251–260 (2006)CrossRef Liu, L., Kulkarni, V.G.: Explicit solutions for the steady state distributions in M/PH/1 queues with workload dependent balking. Queueing Syst. 52, 251–260 (2006)CrossRef
14.
Zurück zum Zitat Llamosi, A., Bernat, G., Burns, A.: Weakly hard real-time systems. IEEE Trans. Comput. 50(4), 308–321 (2001)CrossRef Llamosi, A., Bernat, G., Burns, A.: Weakly hard real-time systems. IEEE Trans. Comput. 50(4), 308–321 (2001)CrossRef
15.
Zurück zum Zitat Loris-Teghem, J.: On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times. J. Appl. Probab. 9, 642–649 (1972)CrossRef Loris-Teghem, J.: On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times. J. Appl. Probab. 9, 642–649 (1972)CrossRef
16.
Zurück zum Zitat Movaghar, A.: On queueing with customer impatience until the beginning of service. Queueing Syst. 29, 337–350 (1998)CrossRef Movaghar, A.: On queueing with customer impatience until the beginning of service. Queueing Syst. 29, 337–350 (1998)CrossRef
17.
Zurück zum Zitat Movaghar, A.: On queueing with customer impatience until the end of service. Stoch. Models 22, 149–173 (2006)CrossRef Movaghar, A.: On queueing with customer impatience until the end of service. Stoch. Models 22, 149–173 (2006)CrossRef
18.
Zurück zum Zitat Palm, C.: Methods for judging the annoyance caused by congestion. Tele 2, 1–20 (1953) Palm, C.: Methods for judging the annoyance caused by congestion. Tele 2, 1–20 (1953)
19.
Zurück zum Zitat Perry, D., Asmussen, S.: Rejection rules in the M/G/1 queue. Queueing Syst. 19, 105–130 (1995)CrossRef Perry, D., Asmussen, S.: Rejection rules in the M/G/1 queue. Queueing Syst. 19, 105–130 (1995)CrossRef
20.
Zurück zum Zitat Van Dijk, N.M.: Queueing systems with restricted workload: an explicit solution. J. Appl. Probab. 27, 393–400 (1990)CrossRef Van Dijk, N.M.: Queueing systems with restricted workload: an explicit solution. J. Appl. Probab. 27, 393–400 (1990)CrossRef
21.
Zurück zum Zitat Zwart, A.P.: Loss rates in the M/G/1 queue with complete rejection. Technische Universiteit Eindhoven, Technical report (2003) Zwart, A.P.: Loss rates in the M/G/1 queue with complete rejection. Technische Universiteit Eindhoven, Technical report (2003)
Metadaten
Titel
Analysis of an queue operated under the FCFS policy with exact admission control
verfasst von
Sudipta Das
Lawrence Jenkins
Debasis Sengupta
Publikationsdatum
01.11.2013
Verlag
Springer US
Erschienen in
Queueing Systems / Ausgabe 2-4/2013
Print ISSN: 0257-0130
Elektronische ISSN: 1572-9443
DOI
https://doi.org/10.1007/s11134-013-9366-6

Weitere Artikel der Ausgabe 2-4/2013

Queueing Systems 2-4/2013 Zur Ausgabe

Premium Partner