Evaluate loss probabilities of packet-awareness coder into queuing networks

IP-based wireless/wired networks can suffer from packet loss due to network congestion and errors, or other transmission problems. The strict real-time multimedia delivery, for applications such as video over IP and Internet gaming, limits the use of error control schemes such as ARQ and Forward Error Correction (FEC) codes. We previously designed a low-delay packet-awareness coder that took the bursty nature of the Internet into account in design considerations. In this paper, we analyse the performance of the proposed packet-awareness coder in terms of its loss probability into a finite M/M/1 queue that represents the network. We also identify conditions under which adding redundancy results in a decrease in the probability of losing messages. The theoretical derivations and numerical results show that in both heavy and light traffic conditions, the packet-awareness coder results in better performance compared to conventional designs.