Zheng Chen
School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, China
Chong Peng
School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, China
Long Qin
School of Computer Science and Engineering, University of Electronic Science and Technology of China, 610054, Chengdu, China
ABSTRACT
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.
PDF References Citation
How to cite this article
Zheng Chen, Chong Peng and Long Qin, 2013. A Real-time Data Compression for Massive Data Transmission Over High Delay-bandwidth Network. Information Technology Journal, 12: 8109-8115.
DOI: 10.3923/itj.2013.8109.8115
URL: https://scialert.net/abstract/?doi=itj.2013.8109.8115
DOI: 10.3923/itj.2013.8109.8115
URL: https://scialert.net/abstract/?doi=itj.2013.8109.8115
REFERENCES
- Huffman, D.A., 1952. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng., 40: 1098-1101.
CrossRefDirect Link - Jeannot, E. and B. Knutsson, 2002. Adaptive online data compression. Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing, July 23-26, 2002, Edinburgh, Scotland, UK., pp: 379-388.
CrossRef - Lilley, J., J. Yang, H. Balakrishnan and S. Seshan, 2000. A unified header compression framework for low-bandwidth links. Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, August 6-11, 2000, Boston, MA., USA., pp: 131-142.
CrossRef - Matias, Y. and R. Refua, 2005. Delayed-dictionary compression for packet networks. Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, Volume 2, March 13-17, 2005, Miami, FL., USA., pp: 1443-1454.
CrossRef - Matias, Y., N. Rajpoot and C. Sahinalp, 2001. The effect of flexible parsing for dynamic dictionary-based data compression. J. Exp. Algorithmics, Vol. 6.
CrossRef - Tan, L.S., S.P. Lau and C.E. Tan, 2010. Enhanced compression scheme for high latency networks to improve quality of service of real-time applications. Proceedings of the 8th Asia-Pacific Symposium on Information and Telecommunication Technologies, June 15-18, 2010, Kuching, Malaysia, pp: 1-6.
Direct Link - Ziv, J. and A. Lempel, 1977. A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, 23: 337-343.
CrossRefDirect Link - Ziv, J. and A. Lempel, 1978. Compression of Individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, 24: 530-536.
CrossRefDirect Link
LINH VAN MA Reply
This paper is of high valuable in the network transmission. I'm currently researching on high-capacity network transmission.
Can authors share the simulation source code?
Thank you in advanced.