Skip to main content
Springer Nature Link
Log in

M-Vollständigkeit von Warteschlangensystemen

M-completeness of queueing systems

  • Originalarbeiten
  • Published:
Computing Aims and scope Submit manuscript

Zusammenfassung

Warteschlangensysteme, bei denen Ankünfte und Abgänge aus dem System einen Poisson-Prozeß bilden, heißen M-vollständig (siehe Müntz [5]). In dieser Arbeit werden hinreichende und notwendige Bedingungen für M-Vollständigkeit angegeben.

Abstract

Queueing Systems for which Poisson arrivals imply Poisson departures are called M-complete (see Muntz [5]). In this paper necessary and sufficient conditions for M-completeness are derived.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Literatur

  1. Mani Chandy, K., Howard, J. H., jr., Towsley, D. F.: Product form and local balance in queueing network. J. ACM24, 250–263 (1977).

    Google Scholar 

  2. Jackson, J. R.: Job shop like queueing systems. Management Science10, 131–142 (1963).

    Google Scholar 

  3. Baskett, F., Chandy, K. M., Muntz, R. P., Palacios, F. G.: Open cosed and mixed networks of queues with different classes of customers. J. ACM22, 248–260 (1975).

    Google Scholar 

  4. Noetzel, A. S.: A generalized queueing discipline for product form network solutions. J. ACM26, 779–793 (1979).

    Google Scholar 

  5. Muntz, R. R.: Poisson departure processes and queueing networks. IBM Research Report RC-4145.

Download references

Author information

Authors and Affiliations

  1. Institut für Theoretische Informatik Fachbereich Informatik, Technische Hochschule Darmstadt, Steubenplatz 12/Magdalenenstrasse 11, D-6100, Darmstadt, Federal Republic of Germany

    H. Tzschach

Authors
  1. H. Tzschach
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tzschach, H. M-Vollständigkeit von Warteschlangensystemen. Computing 33, 227–235 (1984). https://doi.org/10.1007/BF02242269

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02242269