Title :
Codes can reduce queueing delay in data centers
Author :
Huang, Longbo ; Pawar, Sameer ; Zhang, Hao ; Ramchandran, Kannan
Author_Institution :
EECS Dept., UC Berkeley, Berkeley, CA, USA
Abstract :
In this paper, we quantify how much codes can reduce the data retrieval latency in storage systems. By combining a simple linear code with a novel request scheduling algorithm, which we call Blocking-one Scheduling (BoS), we show analytically that it is possible to use codes to reduce data retrieval delay by up to 17% over currently popular replication-based strategies. Although in this work we focus on a simplified setting where the storage system stores a single content, the methodology developed can be applied to more general settings with multiple contents. The results also offer insightful guidance to the design of storage systems in data centers and content distribution networks.
Keywords :
computer centres; content-based retrieval; delays; information retrieval systems; linear codes; queueing theory; storage management; BoS algorithm; blocking-one scheduling; content distribution networks; data centers; data retrieval delay reduction; data retrieval latency reduction; linear code; queueing delay reduction; request scheduling algorithm; storage system design; Delay; Encoding; Optimal scheduling; Redundancy; Scheduling; Servers; Throughput;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6284026
