返回
Network Traffic Compression With Side Information
DOI:10.1109/ACCESS.2020.2994319.png)
摘要
En 中文
There is a high degree of correlation among packets traversing the Internet. As these packets are often routed through different paths, eliminating such correlation requires to process them individually. Traditional universal compression solutions would not perform well over a single short packet because of the insufficient data available for learning the unknown source parameters. In this paper, we define a notion of correlation between information sources and characterize the average redundancy in universal compression when side information from a correlated source is available. We show that the presence of side information provides at least 50 & x0025; traffic reduction over traditional universal compression when applied to network packet data providing theoretical evidence for previous empirical studies.
Keyword:
Correlation
Redundancy
Decoding
Markov processes
Entropy
Encoding
Internet
Redundancy elimination
network compression
side information
correlated information sources
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
Optimization of Thermal-Hydraulic Reactor System for SMRs via Data Assimilation and Uncertainty Quantification通过数据同化和不确定性量化优化SMRs热工水力反应堆系统

