Sciweavers

INFOCOM
2012
IEEE

Memory-assisted universal compression of network flows

12 years 2 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the network. These techniques are often based on either packet-level Redundancy Elimination (RE) or Content-Centric Networking (CCN). However, these techniques cannot exploit sub-packet redundancies. Further, other alternative techniques such as the end-to-end universal compression solutions would not perform well either over the Internet traffic, as such techniques require infinite length traffic to effectively remove redundancy. This paper proposes a memory-assisted universal compression technique that holds a significant promise for reducing the amount of traffic in the networks. The proposed work is based on the observation that if a source is to be compressed and sent over a network, the associated universal code entails a substantial overhead in transmission due to finite length traffic. However, intermed...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
Added 28 Sep 2012
Updated 28 Sep 2012
Type Journal
Year 2012
Where INFOCOM
Authors Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
Comments (0)