|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 3, Pages 83–95
(Mi ppi620)
|
|
|
|
Communication Network Theory
Asymptotic Analysis of Telegraphic Message Switching Systems
F. I. Karpelevich, A. Ya. Kreinin
Abstract:
Single-channel message switching systems are considered in which the transmission time is determined only by the message length and is the same at all nodes. The heavy traffic case is analyzed. It is shown that if the traffic parameter tends to 1, the sojourn time in the system is asymptotically equivalent to the waiting time in the first phase.
Received: 05.05.1988 Revised: 25.01.1990
Citation:
F. I. Karpelevich, A. Ya. Kreinin, “Asymptotic Analysis of Telegraphic Message Switching Systems”, Probl. Peredachi Inf., 26:3 (1990), 83–95; Problems Inform. Transmission, 26:3 (1990), 261–274
Linking options:
https://www.mathnet.ru/eng/ppi620 https://www.mathnet.ru/eng/ppi/v26/i3/p83
|
Statistics & downloads: |
Abstract page: | 171 | Full-text PDF : | 73 |
|