Data compression techniques in modern communication networks for enhanced bandwidth utilization.

摘要

This study represents an exploration of the advantages of compression of data for storage and transmission. The significance of compressing data cannot be overestimated in light of the mushrooming applications and globalization of communication. Compression of data is of particular significance or an imperative for the developing countries (DCs) because of their relatively underdeveloped telecommunications infrastructure. Data compression in the case of DCs may overcome the varied infrastructure bottlenecks as well as represent a case of ‘leap-fogging.’; The study traces the development of communication networks in terms of their diversity of applications that we feel in our daily lives. Several compression algorithms have been developed to make transmission and storage of data more efficient as the volume of data transmitted grew. The study discusses the distinguishing features of these algorithms in terms of their applications. Simulation is an important tool for modeling a network to determine its performance characteristics. The study outlines the components of the simulation topology, i.e., nodes, links and arcs and simulation methodology pertaining to link utilization, WAN cloud, and message sources as a backdrop to simulation of data transmission.; The core of the study is the analysis and discussion of simulation results. Simulations are done for five different applications, i.e., e-mail, audio, image, video, and HDTV using Huffman Coding, LZW, MPEG-1 and MPEG-2 over five bandwidth percentages. The results show that the link utilization rate, drop rate and access link utilization rate and packets-dropped/packets-delivered ratio for compressed data compares quite favorably with the corresponding results for uncompressed data. The methodology used in the dissertation can be used for evaluating new compression algorithms through the evolving modern communication networks and data storage systems of the future.