Packet dropout and retransmission have become a more and more serious problem in high delay-bandwidth network, it is difficult for traditional streaming compression to deal with reorder packets, people have to use stateless compression, but it can only achieve very low compression ratio. In this study, we introduce a novel Orderless Tolerance Compression Algorithm (OTCA). The algorithm works effectively with orderless packets which is caused by the packet retransmission, through allowing variable delay in the dictionary construction. OTCA performs better compression ratio than stateless compression and low decoding latency than that of streaming compression and excels delay-dictionary compression in both compression ratio and decoding latency especially in high bandwidth network. We conduct extensive experiments to establish the potential improvement for packet compression techniques, using many data files including the Calgary corpus and the Canterbury corpus. Experimental results of the OTCA show that it is a good compromise proposal for transfer massive data over high delay-bandwidth networks.
展开▼