On the delay-storage trade-off in content download from coded distributed storage systems

IEEE Journal on Selected Areas in Communications

Volumn 32, Issue 5, 2014, Pages 989-997

  Joshi, Gauri ^a   Liu, Yanpei ^b   Soljanin, Emina ^c  

^a USA   (United States)

^b University of Wisconsin Madison   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

distributed storage; fork join queues; MDS codes

Indexed keywords

MULTIPROCESSING SYSTEMS; QUEUEING THEORY; REDUNDANCY;

CONTENT DELIVERY; CONTENT RECONSTRUCTION; DELAY CONSTRAINTS; DISTRIBUTED STORAGE; DISTRIBUTED STORAGE SYSTEM; FORK-JOIN QUEUES; MDS CODE; SYSTEM MODELING;

SERVERS;

EID: 84899819398     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2014.140518     Document Type: Article

References (36)

1. Amazon EBS, http://aws.amazon.com/ebs/.
2. S. Ghemawat, H. Gobioff, and S.-T. Leung, "The Google file system," in ACM SIGOPS Op. Sys. Rev., vol. 37, no. 5, 2003, pp. 29-43. (Pubitemid 40929686)
3. Dropbox, http://www.dropbox.com/.
4. Google Docs, http://docs.google.com/.
5. G. Joshi, Y. Liu, and E. Soljanin, "Coding for fast content download," Allerton Conf., pp. 326-333, Oct. 2012.
6. A. G. Dimakis, P. B. Godfrey, M. Wainwright, and K. Ramchandran, "Network coding for distributed storage systems," Proc. IEEE INFOCOM, pp. 2000-2008, May 2007. (Pubitemid 47334432)
7. M. Blaum, J. Brady, J. Bruck, and J. Menon, "EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures," IEEE Trans. Comput., vol. 44, no. 2, pp. 192-202, 1995.
8. R. Rodrigues and B. Liskov, "High availability in DHTs: Erasure coding vs. replication," Int. Workshop Peer-to-Peer Sys., pp. 226-239, Feb. 2005.
9. K. V. Rashmi, N. B. Shah, P. V. Kumar, and K. Ramchandran, "Explicit construction of optimal exact regenerating codes for distributed storage," Allerton Conf. on Commun. Control and Comput., pp. 1243-1249, Sep. 2009.
10. N. B. Shah, K. V. Rashmi, P. V. Kumar, and K. Ramchandran, "Interference alignment in regenerating codes for distributed storage: necessity and code constructions," IEEE Trans. Inf. Theory, vol. 58, pp. 2134-2158, Apr. 2012.
11. I. Tamo, Z. Wang and J. Bruck, "Zigzag Codes: MDS Array Codes With Optimal Rebuilding," IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1597-1616, 2013.
12. U. Ferner, M. Médard, and E. Soljanin, "Toward sustainable networking: Storage area networks with network coding," Allerton Conf., pp. 517-524, Oct. 2012.
13. L. Huang, S. Pawar, H. Zhang, and Kannan Ramchandran, "Codes can reduce queuing delay in data centers," Proc. Int. Symp. Inform. Theory, pp. 2766-2770, Jul. 2012.
14. N. Shah, K. Lee, and K. Ramachandran, "The MDS queue: analyzing latency performance of codes and redundant requests," Tech. Rep. arXiv:1211.5405, Nov. 2012.
15. G. Kabatiansky, E. Krouk and S. Semenov, Error correcting coding and security for data networks: analysis of the superchannel concept, 1st ed. Wiley, Mar. 2005, ch. 7.
16. N. F. Maxemchuk, "Dispersity routing in high-speed networks," Compu. Networks and ISDN Sys., vol. 25, pp. 645-661, Jan. 1993. (Pubitemid 23611976)
17. Y. Liu, J. Yang, and S. C. Draper, "Exploiting route diversity in multipacket transmission using mutual information accumulation," Allerton Conf. on Commun. Control and Comput., pp. 1793-1800, Sep. 2011.
18. L. Xu, "Highly available distributed storage systems," Ph.D. dissertation, California Institute of Technology, 1998.
19. E. Soljanin, "Reducing delay with coding in (mobile) multi-agent information transfer," Allerton Conf. on Commun. Control and Comput., pp. 1428-1433, Sep. 2010.
20. M. Harchol-Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action. Cambridge University Press, 2013.
21. C. Kim and A. K. Agrawala, "Analysis of the fork-join queue," IEEE Trans. Comput., vol. 38, no. 2, pp. 250-255, Feb. 1989.
22. R. Nelson and A. Tantawi, "Approximate analysis of fork/join synchronization in parallel queues," IEEE Trans. Comput., vol. 37, no. 6, pp. 739-743, Jun. 1988. (Pubitemid 18640099)
23. E. Varki, A. Merchant and H. Chen, "The M/M/1 fork-join queue with variable sub-tasks," unpublished, available online.
24. L. Flatto and S. Hahn, "Two parallel queues created by arrivals with two demands i," SIAM Journal on Applied Mathematics, vol. 44, no. 5, pp. 1041-1053, 1984. (Pubitemid 15420690)
25. P. E. Wright, "Two parallel processors with coupled inputs," Advances in applied probability, pp. 986-1007, 1992.
26. P. Konstantopoulos and J. Walrand, "Stationarity and stability of forkjoin networks," J. Appl. Prob., vol. 26, pp. 604-614, Sep. 1989.
27. H. C. Tijms, A first course in stochastic models, 2nd ed. Wiley, 2003, ch. 2.5, p. 58.
28. J. Esary, F. Proschan and D. Walkup, "Association of random variables, with applications," Annals of Math. Stat., vol. 38, no. 5, pp. 1466-1474, Oct. 1967.
29. M. Mitzenmacher, "The power of two choices in randomized load balancing," Ph.D. dissertation, University of California Berkeley, CA, 1996.
30. N. Papadatos, "Maximum variance of order statistics," Ann. Inst. Statist. Math, vol. 47, pp. 185-193, 1995.
31. B. C. Arnold and R. A. Groeneveld, "Bounds on expectations of linear systematic statistics based on dependent samples," Annals of Stat., vol. 7, pp. 220-223, Oct. 1979.
32. M. E. Crovella and A. Bestavros, "Self-similarity in World Wide Web traffic: evidence and possible causes," IEEE/ACM Trans. Netw., pp. 835-846, Dec. 1997. (Pubitemid 127768491)
33. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," Proc. ACM SIGCOMM, pp. 251-262, 1999. (Pubitemid 32081870)
34. J. Dean and S. Ghemawat, "MapReduce: simplified data processing on large clusters," Commu. of ACM, vol. 51, pp. 107-113, Jan. 2008.
35. A. Vulimiri, O. Michel, P. B. Godfrey, and S. Shenker, "More is less: reducing latency via redundancy," Proc. ACM HotNets, pp. 13-18, 2012.
36. T. Bostoen, S. Mullender, and Y. Berbers, "Power-reduction techniques for data-center storage systems," ACM Comput. Surveys, vol. 45, no. 3, 2013.