Asymptotic Analysis of Telegraphic Message Switching Systems

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.