Modified Huffman Code for Bandwidth Optimization Through Lossless Compression
In the interest of minimizing bandwidth usage, a modified Huffman code structure is proposed, with an accompanying algorithm, to achieve excellent lossless compression ratios while maintaining a quick compression and decompression process. This is important as the usage of internet bandwidth increases greatly with each passing year, and other existing compression models are either too slow, or not efficient enough. We then implement this data structure and algorithm using English text compression as the data and discuss its application to other data types. We conclude that if this algorithm were to be adopted by browsers and web servers, bandwidth usage could be reduced significantly, resulting in cut costs and a faster internet.
KeywordsCompression Bandwidth Internet Lossless Space optimization
- 1.Cisco Systems. Visual Networking Index. Available at: https://www.cisco.com/c/en/us/solutions/service-provider/visual-networking-index-vni/index.html, Accessed 10 Mar 2018
- 3.C. Hong-Chung, W. Yue-Li, L. Yu-Feng, Memory-efficient and fast Huffman decoding algorithm. Inf. Process. Lett. 69(3), 119–122 (1999). ISSN: 0020–0190. https://doi.org/10.1016/S0020-0190(99)00002-2. http://www.sciencedirect.com/science/article/pii/S0020019099000022 MathSciNetCrossRefGoogle Scholar