Due to the large increase in the use of data communication and information exchange services of different types in different environments, the standard and the programming had to be a language of characterization is ideal for scalability and development that serve the growing needs in the best form and in the shortest possible time and was the most widely used language and the most widely used XML language. he adoption of graphics architecture sometimes created a problem affecting the performance of information transmission networks due to the large volume of data exchanged as well as the need for large storage capacity at both ends of the transmission and reception. Effective ways of reducing the amount of data exchanged through the network had to be found. There have been many scientific researches and practical experiments on finding effective ways to reduce the actual size of the data and by adopting different parameters that affect the process of compressing the files so as to achieve better results by reducing the volumes of files exchanged with attention to times of compression and decompression of files. In this research, we focused on the study and comparison of some compression algorithms for files and their effect on data communication in networks.