A protocol-independent technique for eliminating redundant network traffic
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A low-bandwidth network file system
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Finding similar files in a large file system
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Supporting practical content-addressable caching with CZIP compression
ATC'07 2007 USENIX Annual Technical Conference on Proceedings of the USENIX Annual Technical Conference
Packet caches on routers: the implications of universal redundant traffic elimination
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Redundancy in network traffic: findings and implications
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Challenges for High-Speed Protocol-Independent Redundancy Eliminating Systems
ICCCN '09 Proceedings of the 2009 Proceedings of 18th International Conference on Computer Communications and Networks
Exploiting similarity for multi-source downloads using file handprints
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
| Hi-index | 0.00 |
The idea of identifying and removing repetitive patterns in the network data transfers, also known as protocol-independent redundancy elimination, and its benefits have received thorough consideration. However, actual implementation of such systems received much less attention. The intention of the redundancy elimination is to increase capacity of low-bandwidth network connections, when searching for redundancies and replacing them is faster than transmitting unprocessed redundant data. As long as network is slow, any reasonable implementation is beneficial. But as network capacities grow, the maximal throughput that system can provide becomes critical for its deployment. Thus, an appropriate choice of redundancy eliminating algorithm and its parameters becomes very important. This work addresses the problem of algorithm and parameter selection. We describe possible variations of the basic scheme, and demonstrate experiments that we have conducted for each variation. We discuss the trends observed in the results and explain their nature. We then propose a methodology to make a choice of the algorithm and its parameters, based on the obtained measurements.