Counting protocols for reliable end-to-end transmission (Q1267718)

We have shown how to build counting protocols which use bounded header size and solve the sequence transmission problem for non-FIFO channels. In addition we have analyzed the protocols on a statistical FIFO channel. The protocol \(P_{\text{one}}\) uses one packet per message on an ideal channel. For the protocols. \(P_{\text{one}}\) and \(P{\text{mode}}\), we can obtain good expressions for the expected number of packets per message sent by the protocols on a statistical FIFO channel with positive lose rate. Although the protocols are intetesting theoretically, they exhibit the exponential type of ineffiency demonstrated by the lower bounds of Mansour and Schieber.