Skip to main content
Erschienen in:
Buchtitelbild

2016 | OriginalPaper | Buchkapitel

1. Introduction

verfasst von : Attahiru S. Alfa

Erschienen in: Applied Discrete-Time Queues

Verlag: Springer New York

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

search-config
loading …

Abstract

In a queueing system items arrive to be processed. The words “item” and “processed” are generic terms. An “item” could refer to customers. They could be customers arriving at a system such as a bank to receive service (be “processed”). Another example is in a manufacturing setting where an item could be a partially completed component that needs to be machined and is thus sent to a station where it is duly processed. Most of us go through city streets driving vehicles or as passengers in a vehicle. A vehicle going through a signalized intersection is an item that needs to be served and the service is provided by the intersection signal light in the form of giving the customer a green light to go through. The types of queueing systems that motivated me to write this book are the types encountered in a communication system. In such a system, an item could be a data packet arriving at a router (or at a switch) and needs its headers read so it can be forwarded to the appropriate next router or final destination. However, in the end, the systems considered in the book are generic and include any systems where items arrive to seek service (i.e. be processed). In this introductory chapter we will use all the similies of queueing system characteristics interchangeably so as to emphasize that we are dealing with a phenomenon that occurs in diverse walks of life. Generally in a queueing system there is a physical or a virtual location (sometimes moving) where items arrive to be processed. An item may be processed immediately after arrival if the processor is available, otherwise it has to wait if the processor is busy. Somehow, the waiting component that may occur if the processor is busy seems to dominate in the descriptor of the system, i.e. “queueing” or “waiting”. In reality, this system can also be called a service system – sometimes a better descriptor. But we will stay with queueing system to maintain tradition.

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!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Alfa AS, Neuts MF (1995) Modelling vehicular traffic using the discrete time Markovian arrival process. Transportation Science 29:109–117CrossRefMATH Alfa AS, Neuts MF (1995) Modelling vehicular traffic using the discrete time Markovian arrival process. Transportation Science 29:109–117CrossRefMATH
Zurück zum Zitat Daduna H (2001) Queueing networks with discrete time scale: Explicit expressions for the steady state behaviour of discrete time stochastic networks. In: Springer Lecture Notes in Computer Science, SpringerCrossRefMATH Daduna H (2001) Queueing networks with discrete time scale: Explicit expressions for the steady state behaviour of discrete time stochastic networks. In: Springer Lecture Notes in Computer Science, SpringerCrossRefMATH
Zurück zum Zitat Dafermos SC, Neuts MF (1971) A single server queue in discrete time. Cahiers Centre d’Etudes Rech Oper 13:23–40MathSciNetMATH Dafermos SC, Neuts MF (1971) A single server queue in discrete time. Cahiers Centre d’Etudes Rech Oper 13:23–40MathSciNetMATH
Zurück zum Zitat Erlang AK (1917) Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Electrotejnikeren (Danish), 13, 5-13 (English Translation, P O Elec Eng J 10, 189-197 (1917-1918) 13:5–13 Erlang AK (1917) Solution of some problems in the theory of probabilities of significance in automatic telephone exchanges. Electrotejnikeren (Danish), 13, 5-13 (English Translation, P O Elec Eng J 10, 189-197 (1917-1918) 13:5–13
Zurück zum Zitat Erlang AK (2009) The theory of probabilities and telephone conversations. vol 20, pp 33–39 Erlang AK (2009) The theory of probabilities and telephone conversations. vol 20, pp 33–39
Zurück zum Zitat Galliher HP, Wheeler RC (1958) Nonstationary queuing probabilities for landing congestion of aircraft. Operations Research 6:264–275MathSciNetCrossRef Galliher HP, Wheeler RC (1958) Nonstationary queuing probabilities for landing congestion of aircraft. Operations Research 6:264–275MathSciNetCrossRef
Zurück zum Zitat Hunter JJ (1983) Mathematical Techniques of Applied Probability - Volume 2, Discrete Time Model: Techniques and Applications. Academic Press, New YorkMATH Hunter JJ (1983) Mathematical Techniques of Applied Probability - Volume 2, Discrete Time Model: Techniques and Applications. Academic Press, New YorkMATH
Zurück zum Zitat Kendall DG (1951) Some problems in the theory of queues. J Roy Statist Soc Ser B 13:151–185MathSciNetMATH Kendall DG (1951) Some problems in the theory of queues. J Roy Statist Soc Ser B 13:151–185MathSciNetMATH
Zurück zum Zitat Kendall DG (1953) Stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Ann Math Statist 24:338–354MathSciNetCrossRefMATH Kendall DG (1953) Stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Ann Math Statist 24:338–354MathSciNetCrossRefMATH
Zurück zum Zitat Klimko MF, Neuts MF (1973) The single server queue in discrete time - numerical analysis, II. Naval Res Logist Quart 20:304–319MathSciNetCrossRefMATH Klimko MF, Neuts MF (1973) The single server queue in discrete time - numerical analysis, II. Naval Res Logist Quart 20:304–319MathSciNetCrossRefMATH
Zurück zum Zitat Minh DL (1978) The discrete-time single-server queue with time-inhomogeneous compound Poisson input. Journal of Applied Probability 15:590–601MathSciNetCrossRefMATH Minh DL (1978) The discrete-time single-server queue with time-inhomogeneous compound Poisson input. Journal of Applied Probability 15:590–601MathSciNetCrossRefMATH
Zurück zum Zitat Neuts MF, Klimko MF (1973) The single server queue in discrete time - numerical analysis, III. Naval Res Logist Quart 20:297–304MathSciNetCrossRefMATH Neuts MF, Klimko MF (1973) The single server queue in discrete time - numerical analysis, III. Naval Res Logist Quart 20:297–304MathSciNetCrossRefMATH
Zurück zum Zitat Park D, H P, Yamashita H (1994) Approximate analysis of discrete-time tandem queuing networks with bursty and correlated input traffic and customer loss. Oper Res Letters 15:95–104 Park D, H P, Yamashita H (1994) Approximate analysis of discrete-time tandem queuing networks with bursty and correlated input traffic and customer loss. Oper Res Letters 15:95–104
Zurück zum Zitat Perros HG, Altiok T (1989) Queueing Networks with Blocking. North, AmsterdamMATH Perros HG, Altiok T (1989) Queueing Networks with Blocking. North, AmsterdamMATH
Zurück zum Zitat Takagi H (1993) Queuing analysis, a foundation of performance analysis - volume 3. In: Discrete-Time Systems, North Holland, p Amsterdam Takagi H (1993) Queuing analysis, a foundation of performance analysis - volume 3. In: Discrete-Time Systems, North Holland, p Amsterdam
Zurück zum Zitat Webster FV (1958) Traffic signal settings. Road Research Technical paper 39, Department of Scientific & Industrial Research, Her majesty’s Stationary Office, London, England Webster FV (1958) Traffic signal settings. Road Research Technical paper 39, Department of Scientific & Industrial Research, Her majesty’s Stationary Office, London, England
Zurück zum Zitat Wu K, McGinnis LF, Zwart B (2008) Queueing models for single machine manufacturing systems with interruptions. In: SJMason, Hill RR, Monch L, Rose O, Jefferson T, Fowler JW (eds) Proc. 2008 Winter Simulation Conference, pp 2083–2092 Wu K, McGinnis LF, Zwart B (2008) Queueing models for single machine manufacturing systems with interruptions. In: SJMason, Hill RR, Monch L, Rose O, Jefferson T, Fowler JW (eds) Proc. 2008 Winter Simulation Conference, pp 2083–2092
Metadaten
Titel
Introduction
verfasst von
Attahiru S. Alfa
Copyright-Jahr
2016
Verlag
Springer New York
DOI
https://doi.org/10.1007/978-1-4939-3420-1_1

Neuer Inhalt