Summary
Queueing systems with repeated attempts have wide practical use in designing switching networks and computer systems. The model presented in this paper not only takes into account repetitions by congestion but also considers the feedback effects from all types of failures in establishing a connection. A semi-regenerative analysis is applied in order to determine the characteristics of the underlying queueing process.
Zusammenfassung
Bedienungssysteme mit wiederholten Versuchen sind von großem praktischen Nutzen bei der Bemessung von Vermittlungseinrichtungen und Computersystemen. Das Modell, das in dieser Arbeit vorgestellt wird, berücksichtigt nicht nur Wiederholungen nach vorangegangener Blockierung, sondern auch die Rückkopplungseffekte aller Arten von Fehlern, die beim Aufbau einer Verbindung auftreten können. Um die charakteristischen Größen des zugrundeliegenden Warteschlangenprozesses zu bestimmen, wird ein semi-regenerativer Ansatz gewählt.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Choo HC, Conolly B (1979) New results in the theory of repeated order queueing systems. J Appl Probab 16:631–640
Cinlar E (1974) Periodicity in Markov renewal theory. Adv Appl Probab 6:61–78
Cinlar E (1975) Introduction to stochastic processes. Prentice Hall, Englewood Cliffs
Cohen JW (1957) Basic problems of telephone traffic theory and the influence of repeated calls. Philips Telecommun Rev 18:49–100
Dietrich G (1975) Verkehrsmodell für zentralgesteuerte Vermittlungssysteme. Elektr Nachrichtenwesen 50:30–36
Falin GI (1977) On the waiting time in a single-server queueing system with repeated calls. Vestn Mosk vychislit mat kibern 4:83–87
Falin GI (1979) A single-line system with secondary orders. Eng Cybern Rev 17:76–83
Hanschke T (1979) Bestimmung von Grenzwahrscheinlichkeiten bei Warteschlangenmodellen mit Hilfe des Jacobi-Perron-Algorithmus. Berichte der math-stat Sektion im Forschungszentrum Graz, No 126
Keilson J, Cozzolino J, Young H (1968) A service system with unfilled requests repeated. Oper Res 16:1126–1137
de Kok AG (1982) Computational methods for single server systems with repeated attempts. Report No 89 of the Interfaculteit der Actuariële Wetenschnappen en Econometrie, Amsterdam
Kulkarni VG (1982) Letter to the editor. J Appl Probab 19:901–904
Mertens JF, Samuel-Cahn E, Zamir S (1978) Necessary and sufficient conditions for recurrence and transience of Markov chains, in terms of inequalities. J Appl Probab 15: 848–851
Pakes AG (1969) Some conditions for ergodicity and recurrence of Markov chains. Oper Res 17:1058–1061
Schäl M (1970) Markov renewal processes with auxiliary paths. Ann Math Statist 41:1604–1623
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hanschke, T. The M/G/1/1 queue with repeated attempts and different types of feedback effects. OR Spektrum 7, 209–215 (1985). https://doi.org/10.1007/BF01720172
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01720172