Abstract
This letter investigates streaming coding that places multiple repair packets between source packets to achieve in-order delivery over highly lossy links. While directly analyzing the deterministic placement of repair packets is difficult, a tractable random model is proposed and analyzed to show that a finite in-order delay is achieved. Using it as a guide of the insertion percentage, the delay is then shown to be further reducible by uniformly placing the repair packets, which suppresses the random variation.