.png){kind=icon}
.png){kind=icon}
Return
Network Traffic Compression With Side Information
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2994319.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Correlation
Redundancy
Decoding
Markov processes
Entropy
Encoding
Internet
Redundancy elimination
network compression
side information
correlated information sources
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.