Queueing Systems with Common Memory Space

• Autorzy: Tikhonenko O. , Ziółkowski M.
• Konferencja: Proceedings of the IX Conference "Applications of algebra" (9 ; 07-13.03.2005 ; Zakopane, Poland)
• Języki publikacji: EN

Abstrakty

EN

In the present paper we investigate queueing systems of different types with customers having some random space requirements connected via common memory space. For such systems combinations we determine the stationary loss probability and the distribution of customers present in each system.

Słowa kluczowe

EN

queueing systems with common memory space; loss probability

PL

systemy kolejkowe ze wspólną przestrzenią pamięci; prawdopodobieństwo straty

• Wydawca: Wydawnictwo Uniwersytetu Humanistyczno-Przyrodniczego im. Jana Długosza w Częstochowie
• Czasopismo: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
• Rocznik: 2005
• Tom: Vol. 10
• Strony: 131--149
• Opis fizyczny: Bibliogr. 12 poz.

Twórcy

autor

Tikhonenko O.

• Institute of Mathematics and Computer Science Jan Długosz University of Częstochowa al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland

autor

Ziółkowski M.

• Institute of Mathematics and Computer Science Jan Długosz University of Częstochowa al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland

Bibliografia

• [1] O.M. Tikhonenko. Queueing Models in Computer Systems. Universitetskoe, Minsk, 1990. (In Russian).
• [2] O.M. Tikhonenko. Modele obsługi masowej w systemach informacyjnych. Akademicka Oficyna Wydawnicza EXIT, Warszawa, 2003.
• [3] B. Sengupta. The spatial requirement of an M/G/1 queue or: how to design for buffer space. Lect. Notes Contr. lnf. Sci., 60, pp. 547-562, 1984.
• [4] E.L. Romm, V.V. Skitovich. On the generalization of the Erlang problem. Avtomatika i Telemekhanika, No. 6, pp. 164-167, 1971. (In Russian).
• [5] A.M. Alexandrov, B.A. Katz. Non-homogeneous demands flows service. lzvestiya AN SSSR. Tekhnicheskaya Kibernetika, No. 2, pp. 47-53, 1973. (In Russian).
• [6] O.M. Tikhonenko. Queueing systems with random length demands and limitations. Avtomatika i Telemekhanika, No. 10, pp. 126-134, 1991. (In Russian).
• [7] O.M. Tikhonenko. Determination of characteristics of queueing systems with limited memory. Avtomatika i Telemekhanika, No 6, pp. 105-110, 1997. (In Russian).
• [8] O.M. Tikhonenko, K.G. Klimovich. Analysis of some queueing systems with restricted summarized volume. Queues: Flows, Systems, Networks. Proc. Int. Conf. "Modern Mathematical Methods of Investigating of the Information Networks", Minsk, pp. 182-186, 2001.
• [9] O.M. Tikhonenko, K.G. Klimovich. Queueing systems for random length arrivals with limited cumulative volume. Problems of Information Transmission, 37, No. 1, pp. 70-79, 2001.
• [10] O.M. Tikhonenko. Generalized Erlang problem in the theory of systems with random volume demands. Queues: Flows, Systems, Networks. Proc. Int. Conf. "Modern Mathematical Methods of Analysis and Optimization of Telecommunication Networks", Minsk, pp. 238-243, 2003.
• [11] O.M. Tikhonenko. The problem of determination of the summarized messages volume in queueing systems and its applications. J. Inform. Process. Cybernet. EIK, 23, No. 7, pp. 339-352, 1987.
• [12] V.F. Matveev, V.G. Ushakov. Queueing Systems. Moscow Univ. Publ., Moscow, 1984. (In Russian).