Queueing analysis of synchronous time division multiplexing with individual source buffering

Synchronous time division multiplexing is analyzed. Packets of information arrive at the system as a compound Poisson process, and are transmitted only during individual periodic intervals. Packet arrivals are blocked (lost) if the system has a finite capacity and is congested. Using the theory of semiregenerative processes, the distribution of the number of packets in the system (system size) is found. This nonstationary distribution is used to determine the complete system behavior, including the delay distributions, the blocking probability, and the density of the system size at arrival instants. Numerical examples illustrate applications of the results given

Bandwidth compression of sonar displays

A major problem affecting the design of data compression systems is that of employing a buffer of limited size and at the same time prevent uncontrollable loss of data due to overflow. One method of alleviating this problem is to employ an adaptive compression algorithm. With this design approach when overflow is imminent the compression algorithm is degraded which effectively reduces the input rate to the buffer. A method is proposed here, where by using a recirculating register as the buffer the recirculating data controls the input rate and hence the performance of the system. The system has been analysed for a Poisson input process, and simulated using synthetic patterns similar to that encountered on sonar displays. The results indicate that this form of storage is quantitatively similar to random-access storage but qualitatively superior due to the random nature of the losses. An experimental system has been built using dynamic MOS shift registers for the store and a simple run-length coding procedure

Packet-switched voice and its application to integrated voice / data networks

Imperial Users onl