GLGuanfeng Liang

Guanfeng Liang

*This is an algorithmically generated author record based on publicly available information.

Guanfeng Liang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Building Reliable Storage Clouds: Models, Fundamental Tradeoffs, and Solutions

    by Ulas C. Kozat, Guanfeng Liang

    Distributed storage has been an active research area for decades. With the proliferation of cloud computing, there has been a rejuvenated interest in two perspectives. The first perspective is seen through the lenses of the cloud providers: how should we build global storage services for cloud hosted services and applications at scale with high reliability and availability guarantees, but also in a cost effective way? The second perspective is seen through the lenses of the service providers that utilize public clouds: how can we achieve high I/O performance over cloud storage within a cost budget? In this manuscript, we first present various kinds of distributed storage systems, their operational characteristics and the key techniques to improve their performance. We then focus on cloud storage, exclusively. Cloud storage has massive scales with the promise to provide as much storage capacity as their tenants demand. Cloud providers also promise very high durability, availability, and I/O performance. In this context, we cover the fundamental tradeoffs between storage efficiency and network bandwidth as well as I/O throughput and latency. Erasure codes play an essential role in these tradeoffs and, thus, we also present their design and usage in the context of cloud storage broadly. We pay particular attention on various queuing models and the corresponding performance analysis in the presence of coded storage. We provide exact and approximate solutions under various settings and assumptions. We describe optimal or near-optimal scheduling and coding strategies that are established based on these analyses.


  • On Throughput-Delay Optimal Access to Storage Clouds via Load Adaptive Coding and Chunking

    by Guanfeng Liang, Ulas C. Kozat

    Recent literature including our past work provides analysis and solutions for using: 1) erasure coding; 2) parallelism; or 3) variable slicing/chunking (i.e., dividing an object of a specific size into a variable number of smaller chunks) in speeding up the I/O performance of storage clouds. However, a comprehensive approach that considers all three dimensions together to achieve the best throughput-delay tradeoff curve had been lacking. This paper presents the first set of solutions that can pick the best combination of coding redundancy ratio and object chunking/slicing options as the load dynamically changes. Our specific contributions are as follows: 1) We establish via measurements that combining variable redundancy ratio and chunking is mostly feasible over a popular public cloud. 2) We relate the delay-optimal values for chunking level and code redundancy ratio to the queue backlogs via an approximate queuing analysis. 3) Based on this analysis, we propose TOFEC that adapts the chunking level and redundancy ratio against the queue backlogs. Our trace-driven simulation results show that TOFEC's adaptation mechanism converges to an appropriate code that provides the optimal throughput-delay tradeoff without reducing system capacity. Compared to a nonadaptive strategy optimized for throughput, TOFEC delivers 2.5× lower latency under light workloads; compared to a nonadaptive strategy optimized for latency, TOFEC can scale to support over 3× as many requests. 4) We propose a simpler greedy solution that performs on a par with TOFEC in average delay performance, but exhibits significantly more performance variations.


  • When queueing meets coding: Optimal-latency data retrieving scheme in storage clouds

    by Shengbo Chen, Yin Sun, Ulasc C. Kozat, Longbo Huang, Prasun Sinha, Guanfeng Liang, Xin Liu, Ness B. Shroff

    Storage clouds, such as Amazon S3, are being widely used for web services and Internet applications. It has been observed that the delay for retrieving data from and placing data into the clouds is quite random, and exhibits weak correlations between different read/write requests. This inspires us to investigate a key problem: can we reduce the delay by transmitting data replications in parallel or using powerful erasure codes? In this paper, we study the problem of reducing the delay of downloading data from cloud storage systems by leveraging multiple parallel threads, assuming that the data has been encoded and stored in the clouds using fixed rate forward error correction (FEC) codes with parameters (n, k). That is., each file is divided into k equal-sized chunks, which are then expanded into n chunks such that any k chunks out of the n are sufficient to successfully restore the original file. The model can be depicted as a multiple-server queue with arrivals of data retrieving requests and a server corresponding to a thread. However, this is not a typical queueing model because a server can terminate its operation, depending on when other servers complete their service (due to the redundancy that is spread across the threads). Hence, to the best of our knowledge, the analysis of this queueing model remains quite uncharted. Real traces from Amazon S3 show that the time to retrieve a fixed size chunk is random and can be accurately approximated as an i.i.d. exponentially distributed random variable. We show that any work-conserving scheme is delay-optimal when k = 1. When k > 1, we find that a simple greedy scheme, which allocates all available threads to the head of line request, is delay optimal, which appears surprising.