Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Introduction to Probability Theory Kapitel lesen Erstes Kapitel lesen

2013 | OriginalPaper | Buchkapitel

11. Applied Queueing Systems

verfasst von : László Lakatos, László Szeidl, Miklós Telek

Erschienen in: Introduction to Queueing Systems with Telecommunication Applications

Verlag: Springer US

Einloggen

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

search-config
loading …

Abstract

Traditional telephone networks were designed to implement a single type of communication service, i.e., the telephone service. Today’s telecommunication networks implement a wide range of communication services. In this section we introduce Markov models of communication services that compete for the bandwidth of a finite-capacity communication link.

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren
Vorheriges Kapitel Queueing Networks
Literatur
1.
2.
N. Abramson. The aloha system: another alternative for computer communications. In: Proceedings Fall Joint Computer Conference. AFIPS Press, 1970.
3.
4.
5.
6.
J. R. Artalejo, A. Gómez-Corral. Retrial Queueing Systems: A Computational Approach. Springer, Berlin Heidelberg New York, 2008.MATHCrossRef
7.
S. Asmussen. Applied Probability and Queues. Springer, Berlin Heidelberg New York, 2003.MATH
8.
F. Baccelli, P. Brémaud. Elements of Queueing Theory, Applications of Mathematics. Springer, Berlin Heidelberg New York, 2002.
9.
F. Baskett, K. Mani Chandy, R. R. Muntz, F. G. Palacios. Open, closed and mixed networks of queues with different classes of customers. J. ACM, 22:248–260, 1975.MATHCrossRef
10.
S. N. Bernstein. Theory of Probabilities. Moskva, Leningrad, 1946. (in Russian).
11.
G. Bianchi. Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J. Select. Areas Commun., 18:535–547, 2000.
12.
D. Bini, G. Latouche, B. Meini. Numerical methods for structured Markov chains. Oxford University Press, Oxford, 2005.MATHCrossRef
13.
A. Bobbio, M. Telek. A benchmark for PH estimation algorithms: results for Acyclic-PH. Stoch. Models, 10:661–677, 1994.MathSciNetMATHCrossRef
14.
A. A. Borovkov. Stochastic processes in queueing theory. Applications of Mathematics. Springer, Berlin Heidelberg New York, 1976.MATHCrossRef
15.
A. A. Borovkov. Asymptotic Methods in Queueing Theory. Wiley, New York, 1984.MATH
16.
L. Breuer, D. Baum. An Introduction to Queueing Theory and Matrix-Analytic Methods. Springer, Berlin Heidelberg New York, 2005.MATH
17.
18.
J. Buzen. Computational algorithms for closed queueing networks with exponential servers. Commun. ACM, 16:527–531, 1973.MathSciNetMATHCrossRef
19.
V. Ceric, L. Lakatos. Measurement and analysis of input data for queueing system models used in system design. Syst. Anal. Modell. Simul., 11:227–233, 1993.MATH
20.
Hong Chen, David D. Yao. Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization. Springer, Berlin Heidelberg New York, 2001.MATH
21.
Y. Chow, H. Teicher. Probability Theory. Springer, Berlin Heidelberg New York, 1978.MATHCrossRef
22.
K. Chung. Markov chains with stationary transition probabilities. Springer, Berlin Heidelberg New York, 1960.MATHCrossRef
23.
E. Cinlar. Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, NJ, 1975.MATH
24.
D. R. Cox. The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables. Proc. Cambridge Philos. Soc., 51:433–440, 1955.MathSciNetMATHCrossRef
25.
A. Cumani. On the canonical representation of homogeneous Markov processes modelling failure-time distributions. Microelectron. Reliab., 22:583–602, 1982.CrossRef
26.
D.J. Daley, D. Vere-Jones. An Introduction to the Theory of Point Process. Springer, Berlin Heidelberg New York, 2008. 2nd edn.
27.
Gy. Dallos, Cs. Szabó. Random access methods of communication channels. Akadémiai Kiadó, Budapest, 1984 (in Hungarian).
28.
M. De Prycker. Asynchronous Transfer Mode, Solutions for Broadband ISDN. Prentice Hall, Englewood Cliffs, NJ, 1993.
29.
P. Erdős, W. Feller, H. Pollard. A theorem on power series. Bull. Am. Math. Soc., 55:201–203, 1949.CrossRef
30.
G. I. Falin, J. G. C. Templeton. Retrial queues. Chapman and Hall, London, 1997.MATH
31.
W. Feller. An Introduction to Probability Theory and its Applications, vol. I. Wiley, New York, 1968.MATH
32.
Chuan Heng Foh, M. Zukerman. Performance analysis of the IEEE 802.11 MAC protocol. In Proceedings of European wireless conference, Florence, February 2002.
33.
34.
G. Giambene. Queuing Theory and Telecommunications: Networks and Applications. Springer, Berlin Heidelberg New York, 2005.
35.
I.I. Gihman, A.V. Skorohod. The Theory of Stochastic Processes, vol. I. Springer, Berlin Heidelberg New York, 1974.MATHCrossRef
36.
I. I. Gihman, A. V. Skorohod. The Theory of Stochastic Processes, vol. II. Springer, Berlin Heidelberg New York, 1975.MATHCrossRef
37.
B. Gnedenko, E. Danielyan, B. Dimitrov, G. Klimov, V. Matveev. Priority Queues. Moscow State University, Moscow, 1973 (in Russian).
38.
B. V. Gnedenko. Theory of Probability. Gordon and Breach, Amsterdam, 1997. 6th edn.
39.
B. V. Gnedenko, I. N. Kovalenko. Introduction to Queueing Theory, 2nd edn. Birkhauser, Boston 1989.CrossRef
40.
W. J. Gordon, G. F. Newell. Closed queueing systems with exponential servers. Oper. Res., 15:254–265, 1967.MATHCrossRef
41.
D. Gross, J. F. Shortle, J. M. Thompson, C. M. Harris. Fundamentals of Queueing Theory, 4th edn. Wiley, New York, 2008.
42.
W. Henderson. Alternative approaches to the analysis of the M/G/1 and G/M/1 queues. J. Oper. Res. Soc. Jpn., 15:92–101, 1972.MATH
43.
A. Horváth, M. Telek. PhFit: A general purpose phase type fitting tool. In Tools 2002, pages 82–91, London, April 2002. Lecture Notes in Computer Science, vol. 2324. Springer, Berlin Heidelberg New York.
44.
J. R. Jackson. Jobshop-like queueing systems. Manage. Sci., 10:131–142, 1963.CrossRef
45.
N. K. Jaiswal. Priority Queues. Academic, New York, 1968.MATH
46.
N. L. Johnson, S. Kotz. Distributions in Statistics: Continuous Multivariate Distributions. Applied Probability and Statistics. Wiley, New York, 1972.MATH
47.
V.V. Kalashnikov. Mathematical Methods in Queueing Theory. Kluwer, Dordrecht, 1994.
48.
S. Karlin, H. M. Taylor. A First Course in Stochastic Processes. Academic, New York, 1975.MATH
49.
S. Karlin, H. M. Taylor. A Second Course in Stochastic Processes. Academic, New York, 1981.MATH
50.
J. Kaufman. Blocking in a shared resource environment. IEEE Trans. Commun., 29: 1474–1481, 1981.CrossRef
51.
F. P. Kelly. Reversibility and Stochastic Networks. Wiley, New York, 1979.MATH
52.
D. G. Kendall. Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Ann. Math. Stat., 24:338–354, 1953.MathSciNetMATHCrossRef
53.
A. Khinchin. Mathematisches über die Erwartung vor einem öffentlichen Schalter. Rec. Math., 39:72–84, 1932 (in Russian with German summary).
54.
J. F. C. Kingman. Poisson Processes. Clarendon, Oxford, 1993.MATH
55.
L. Kleinrock. Queuing Systems. Volume 1: Theory. Wiley-Interscience, New York, 1975.
56.
G. P. Klimov. Extremal Problems in Queueing Theory. Energia, Moskva, 1964 (in Russian).
57.
E. V. Koba. On a retrial queueing system with a FIFO queueing discipline. Theory Stoch. Proc., 8:201–207, 2002.MathSciNet
58.
V. G. Kulkarni. Modeling and Analysis of Stochastic Systems. Chapman & Hall, London, 1995.MATH
59.
L. Lakatos. On a simple continuous cyclic waiting problem. Annal. Univ. Sci. Budapest Sect. Comp., 14:105–113, 1994.MathSciNetMATH
60.
L. Lakatos. A note on the Pollaczek-Khinchin formula. Annal. Univ. Sci. Budapest Sect. Comp., 29:83–91, 2008.MathSciNetMATH
61.
62.
G. Latouche, V. Ramaswami. Introduction to matrix analytic methods in stochastic modeling. SIAM, 1999.
63.
64.
D. V. Lindley. The theory of queues with a single server. Math. Proc. Cambridge Philos. Soc., 48:277–289, 1952.MathSciNetCrossRef
65.
T. Lindwall. Lectures on the Coupling Method. Wiley, New York, 1992.
66.
67.
A. A. Markov. Rasprostranenie zakona bol’shih chisel na velichiny, zavisyaschie drug ot druga. Izvestiya Fiziko-matematicheskogo obschestva pri Kazanskom universitete, 15:135–156, 1906 (in Russian).
68.
L. Massoulie, J. Roberts. Bandwidth sharing: Objectives and Algorithms. In Infocom, 1999.
69.
V. F. Matveev, V. G. Ushakov. Queueing systems. Moscow State University, Moskva, 1984 (in Russian).MATH
70.
P. Medgyessy, L. Takács. Probability Theory. Tankönyvkiadó, Budapest, 1973 (in Hungarian).
71.
S. Meyn, R. Tweedie. Markov chains and stochastic stability. Springer, Berlin Heidelberg New York, 1993.MATHCrossRef
72.
73.
M. Neuts. Probability distributions of phase type. In Liber Amicorum Prof. Emeritus H. Florin, pp. 173–206. University of Louvain, Louvain, Belgium, 1975.
74.
M.F. Neuts. Matrix Geometric Solutions in Stochastic Models. Johns Hopkins University Press, Baltimore, 1981.MATH
75.
C. Palm. Methods of judging the annoyance caused by congestion. Telegrafstyrelsen, 4:189–208, 1953.
76.
A. P. Prudnikov, Y. A. Brychkov, O. I. Marichev. Integrals and series, vol. 2. Gordon and Breach, New York, 1986. Special functions.
77.
S. Rácz, M. Telek, G. Fodor. Call level performance analysis of 3rd generation mobile core network. In IEEE International Conference on Communications, ICC 2001, 2:456–461, Helsinki, Finland, June 2001.
78.
S. Rácz, M. Telek, G. Fodor. Link capacity sharing between guaranteed- and best effort services on an atm transmission link under GoS constraints. Telecommun. Syst., 17(1–2):93–114, 2001.MATHCrossRef
79.
M. Reiser, S. S. Lavenberg. Mean value analysis of closed multi-chain queueing networks. J. ACM, 27:313–322, 1980.MathSciNetMATHCrossRef
80.
J. Roberts. A service system with heterogeneous user requirements - application to multi-service telecommunications systems. In Proceedings of Performance of Data Communications Systems and Their Applications, pp. 423–431, Paris, 1981.
81.
K. W. Ross. Multiservice Loss Models for Broadband Telecommunication Networks. Springer, Berlin Heidelberg New York, 1995.MATHCrossRef
82.
T. Saaty. Elements of Queueing Theory. McGraw-Hill, New York, 1961.MATH
83.
R. Serfozo. Introduction to Stochastic Networks. Springer, Berlin Heidelberg New York, 1999.MATHCrossRef
84.
A. N. Shiryaev. Probability. Springer, Berlin Heidelberg New York, 1994.
85.
D. L. Snyder. Random Point Processes. Wiley, New York, 1975.MATH
86.
L. Szeidl. Estimation of the moment of the regeneration period in a closed central-server queueing network. Theory Probab. Appl., 31:309–313, 1986.
87.
L. Szeidl. On the estimation of moment of regenerative cycles in a general closed central-server queueing network. Lect. Notes Math., 1233:182–189, 1987.MathSciNetCrossRef
88.
L. Takács. Investigation of waiting time problems by reduction to Markov processes. Acta Math. Acad. Sci. Hung., 6:101–129, 1955.MATHCrossRef
89.
L. Takács. The distribution of the virtual waiting time for a single-server queue with Poisson input and general service times. Oper. Res., 11:261–264, 1963.MATHCrossRef
90.
L. Takács. Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York, 1967.MATH
91.
H. Takagi. Queueing Analysis. North Holland, Amsterdam, 1991.MATH
92.
M. Telek. Minimal coefficient of variation of discrete phase type distributions. In G. Latouche, P. Taylor, eds., Advances in algorithmic methods for stochastic models, MAM3, pp. 391–400. Notable Publications, 2000.
93.
A. Thümmler, P. Buchholz, M. Telek. A novel approach for fitting probability distributions to trace data with the em algorithm. IEEE Trans. Depend. Secure Comput., 3(3):245–258, 2006. Extended version of DSN 2005 paper.
94.
H. Tijms. Stochastic Models: An Algorithmic Approach. Wiley, New York, 1994.MATH
95.
96.
V. M. Zolotarev. Modern Theory of Summation of Random Variables. VSP, Utrecht, 1997.MATHCrossRef
Metadaten
Titel
Applied Queueing Systems
verfasst von
László Lakatos
László Szeidl
Miklós Telek
Copyright-Jahr
2013
Verlag
Springer US
Buch
Introduction to Queueing Systems with Telecommunication Applications

Print ISBN: 978-1-4614-5316-1

Electronic ISBN: 978-1-4614-5317-8

Copyright-Jahr: 2013

DOI
https://doi.org/10.1007/978-1-4614-5317-8_11