{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:00:35Z","timestamp":1725645635370},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184065"},{"type":"electronic","value":"9783642730160"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/978-3-642-73016-0_2","type":"book-chapter","created":{"date-parts":[[2011,12,26]],"date-time":"2011-12-26T13:32:52Z","timestamp":1324906372000},"page":"13-27","source":"Crossref","is-referenced-by-count":1,"title":["Wahrscheinlichkeitsverteilungen maximaler Entropie f\u00fcr die Wartezeiten in G\/G\/1-Systemen"],"prefix":"10.1007","author":[{"given":"Johann Christoph","family":"Strelen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","volume-title":"Probability, Statistics, and Queueing Theory","author":"AO Allen","year":"1978","unstructured":"A.O. Allen: Probability, Statistics, and Queueing Theory. Academic Press, New York, 1978"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF00290731","volume":"19","author":"MA El-Affendi","year":"1983","unstructured":"M.A. El-Affendi and D.D. Kouvatsos: A Maximum Entropy Analysis of the M\/G\/1 and G\/M\/1 Queueing Systems at Equilibrium. Acta Informatica 19 (1983), S.339","journal-title":"Acta Informatica"},{"key":"2_CR3","volume-title":"Handbuch der Bedienungstheorie, Band 2","author":"K Gnedenko","year":"1984","unstructured":"Gnedenko, K\u00f6nig: Handbuch der Bedienungstheorie, Band 2. Akademie-Verlag, Berlin, 1984"},{"unstructured":"G. Ha\u00dflinger: Das N\u00e4herungsverfahren nach dem Prinzip der maximalen Entropie f\u00fcr Warteschlangen-Verteilungen in geschlossenen Netzwerken. Dissertation, Technische Hochschule Darmstadt, 1986","key":"2_CR4"},{"key":"2_CR5","volume-title":"Queueing Systems, Vol. 1","author":"L Kleinrock","year":"1975","unstructured":"L. Kleinrock: Queueing Systems, Vol. 1, J. Wiley, New York, 1975"},{"key":"2_CR6","first-page":"113","volume-title":"Computer Networking and Performance Evaluation","author":"DD Kouvatsos","year":"1986","unstructured":"D.D. Kouvatsos: A Universal Maximum Entropy Algorithm for the Analysis of General Closed Networks. In: T. Hasegawa, H. Takagi, Y. Takahashi (Hrsg.), Computer Networking and Performance Evaluation, Elsvier Science Publishers, Amsterdam, 1986, S. 113"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/317531.317555","volume":"14","author":"DD Kouvatsos","year":"1986","unstructured":"D.D. Kouvatsos: A Maximum Entropy Queue Length Distribution for a G\/G\/1 Finite Capacity Queue. ACM Performance Evaluation Review, Vol.14, No.1 (1986), S. 224","journal-title":"ACM Performance Evaluation Review"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF00262975","volume":"17","author":"JE Shore","year":"1982","unstructured":"J. E. Shore: Information Theoretic Approximations for M\/G\/1 and G\/G\/1 Queueing Systems. Acta Informatica 17, 1982, S. 43","journal-title":"Acta Informatica"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/TIT.1980.1056144","volume":"IT-26","author":"JE Shore","year":"1980","unstructured":"J. E. Shore and R. W. Johnson: Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross-Entropy. IEEE Trans. Inf. Theory, Vol. IT-26, No. 1, Jan 1980, S. 26\u201337","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"W. J. Smirnow: Lehrgang der h\u00f6heren Mathematik, Teil IV, Berlin 1961.","key":"2_CR10"},{"key":"2_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-06864-9","volume-title":"Einf\u00fchrung in die Numerische Mathematik","author":"J Stoer","year":"1976","unstructured":"J. Stoer: Einf\u00fchrung in die Numerische Mathematik. Springer, Berlin, Heidelberg, New York, 1976"},{"unstructured":"H. Tzschach: The Principle of Maximum Entropy applied to Queueing Systems. Bericht TI-2, Fachbereich Informatik, Technische Hochschule Darmstadt, 1983.","key":"2_CR12"},{"unstructured":"H. Tzschach: Information Theoretic Approximations of Queueing Systems and Queueing Networks. Bericht des Fachbereichs Informatik, Technische Hochschule Darmstadt, 1986","key":"2_CR13"},{"doi-asserted-by":"crossref","unstructured":"R.J. Walstra: Nonexponential Networks of Queues: A Maximum Entropy Analysis. ACM Sigmetrics, 1985, S.27","key":"2_CR14","DOI":"10.1145\/317795.317807"}],"container-title":["Informatik-Fachberichte","Messung, Modellierung und Bewertung von Rechensystemen"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-73016-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T12:34:22Z","timestamp":1620304462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-73016-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184065","9783642730160"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-73016-0_2","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1987]]}}}