Current Volume 9
Abstract
Modern communication networks generate enormous volumes of data due to cloud computing, multimedia streaming, Internet of Things (IoT) devices, and distributed applications. Efficient utilization of network bandwidth has become increasingly important for maintaining high throughput and low transmission latency. Traditional lossless compression techniques often employ fixed compression strategies without considering changing network conditions, leading to suboptimal performance. This paper presents a Throughput-Aware Compression Framework (TACF) that dynamically adapts compression parameters according to network throughput characteristics. The proposed framework integrates traffic monitoring, statistical analysis, adaptive compression control, and lightweight lossless encoding to optimize data transmission efficiency. Experimental results demonstrate improvements in throughput utilization, compression ratio, and transmission latency when compared with conventional Huffman, LZW, and static Golomb-Rice compression methods. The framework is suitable for modern communication infrastructures including cloud networks, data centers, and IoT environments.
Keywords
Network Compression, Throughput Optimization, Lossless Compression, Communication Networks, Adaptive Encoding, Bandwidth Utilization
Citations
IRE Journals:
Muhammed Nihal C, Kousalya Devi S "A Throughput-Aware Compression Framework for Modern Communication Networks" Iconic Research And Engineering Journals Volume 7 Issue 9 2024 Page 649-654 https://doi.org/10.64388/IREV7I9-1718604
IEEE:
Muhammed Nihal C, Kousalya Devi S
"A Throughput-Aware Compression Framework for Modern Communication Networks" Iconic Research And Engineering Journals, 7(9) https://doi.org/10.64388/IREV7I9-1718604
About IRE Journals
IRE Journals is an open access online journals established with an aim to publish high quality of research work in various diciplines. We have more than 6 years in publications. Over 2500+ papers already published.
Important Links
For Authors
Volume 8:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 7:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 6:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 5:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 4:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12Volume 3:
Issue 1, Issue 2, Issue 3, Issue 4, Issue 5, Issue 6, Issue 7, Issue 8, Issue 9, Issue 10, Issue 11, Issue 12