Tradeoffs in Scalable Data Routing for Deduplication Clusters

12 years 7 months ago

Download www.usenix.org

As data have been growing rapidly in data centers, deduplication storage systems continuously face challenges in providing the corresponding throughputs and capacities necessary to move backup data within backup and recovery window times. One approach is to build a cluster deduplication storage system with multiple deduplication storage system nodes. The goal is to achieve scalable throughput and capacity using extremely high

Wei Dong, Fred Douglis, Kai Li, R. Hugo Patterson,

Real-time Traffic

FAST 2011 | Operating System | Storage System | Storage Systems | System Nodes |

claim paper

» LIMBO Scalable Clustering of Categorical Data

» Design and Performance Tradeoffs in Clustered Video Servers

» Data utility and privacy protection tradeoff in kanonymisation

» On the ThroughputCost Tradeoff of MultiTiered Optical Network Architectures

» Data ONTAP GX A Scalable Storage Cluster

» Scaling IP Routing with the Core RouterIntegrated Overlay

» Scalable DensityBased Distributed Clustering

» TreePattern Similarity Estimation for Scalable Contentbased Routing

Post Info
More Details (n/a)

Added	28 Aug 2011
Updated	28 Aug 2011
Type	Journal
Year	2011
Where	FAST
Authors	Wei Dong, Fred Douglis, Kai Li, R. Hugo Patterson, Sazzala Reddy, Philip Shilane

Comments (0)

Sciweavers

Tradeoffs in Scalable Data Routing for Deduplication Clusters

FAST 2011 | Operating System | Storage System | Storage Systems | System Nodes |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers