We analyze the throughput of a direct-sequence spread spectrum multiple access (DS/SSMA) unslotted ALOHA system with variable length data traffic. The system is analyzed for two cases: (1) systems without a channel load sensing protocol (CLSP) and (2) systems with a CLSP. The bit-error probability and the throughput are obtained as a function of the signal-to-noise ratio (SNR) during message transmission, considering the number of overlapped messages and the amount of time overlap. We assume that the generation of data messages is Poisson distributed and that the messages are divided into packets before transmission. The system is modeled as a Markov chain under the assumption that the number of packets in a message is geometrically distributed with a constant packet length. The throughput variance of the DS/SSMA unslotted ALOHA system with variable length data traffic is obtained as the Reed-Solomon code rate varies. Results show that a significant throughput improvement can be obtained by using an error-correcting code.

We propose an adaptive redundancy control method for erasure-code-based real-time data transmission over the Internet. The loss rate is an important quality of service (QoS) parameter for real-time data transmission. However, real-time data transmission over best-effort networks, such as the Internet, suffers from a frequent packet loss due to traffic congestion. Erasure-code-based loss recovery scheme is widely used for loss recovery on the Internet. We propose a redundancy estimation algorithm which considers consecutive losses since the loss recovery rate depends on the amount of redundancy data. A continuous time Markov chain is used for modeling the loss process and adjusting the number of redundant packets. Measurements and simulation results show that the proposed scheme can be used as an efficient loss recovery algorithm for real-time data transmission over the Internet.

We propose an adaptive redundancy control scheme for a systematic erasure coding scheme to transmit real time data in the Internet. Since the recovery rate of packet loss depends on the amount of redundancy data, we use the redundancy estimation algorithm which considers the loss burstiness. The Gilbert model is used for modeling the loss process and adjusting the number of redundant packets. Analysis and experimental results show that the proposed scheme is efficient for loss recovery in a consecutive loss environments like the Internet.