Fluid-Shuttle: Efficient Cloud Data Transmission Based on Serverless Computing Compression
Authors: 
Rong Gu, Shulin Wang, Haipeng Dai, Xiaofei Chen, Zhaokang Wang, Wenjie Bao, Jiaqi Zheng, Yaofeng Tu, Yihua Huang, Lianyong Qi, Xiaolong Xu, Wanchun Dou, Guihai ChenAuthors Info & Claims
Rong Gu, Shulin Wang, Haipeng Dai, Xiaofei Chen, Zhaokang Wang, Wenjie Bao, Jiaqi Zheng, Yaofeng Tu, Yihua Huang, Lianyong Qi, Xiaolong Xu, Wanchun Dou, Guihai ChenAuthors Info & ClaimsPages 4554 - 4569
Abstract
Nowadays, there exists a lot of cross-region data transmission demand on the cloud. It is promising to use serverless computing for data compressing to save the total data size. However, it is challenging to estimate the data transmission time and monetary cost with serverless compression. In addition, minimizing the data transmission cost is non-trivial due to the enormous parameter space. This paper focuses on this problem and makes the following contributions: 1) We propose empirical data transmission time and monetary cost models based on serverless compression. It can also predict compression information, e.g., ratio and speed using chunk sampling and machine learning techniques. 2) For single-task cloud data transmission, we propose two efficient parameter search methods based on Sequential Quadratic Programming (SQP) and Eliminate then Divide and Conquer (EDC) with proven error upper bounds. Besides, we propose a parameter fine-tuning strategy to deal with transmission bandwidth variance. 3) Furthermore, for multi-task scenarios, a parameter search method based on dynamic programming and numerical computation is proposed. We have implemented the system called Fluid-Shuttle, which includes straggler optimization, cache optimization, and the autoscaling decompression mechanism. Finally, we evaluate the performance of Fluid-Shuttle with various workloads and applications on the real-world AWS serverless computing platform. Experimental results show that the proposed approach can improve the parameter search efficiency by over <inline-formula> <tex-math notation="LaTeX">$3\times $ </tex-math></inline-formula> compared with the state-of-art methods and achieves better parameter quality. In addition, our approach achieves higher time efficiency and lower monetary cost compared with competing cloud data transmission approaches.
References
[1]
P. Wendell, J. W. Jiang, M. J. Freedman, and J. Rexford, “DONAR: Decentralized server selection for cloud services,” in Proc. 24th ACM Special Interest Group Data Commun. (SIGCOMM), 2010, pp. 231–242.
[2]
X. Dong, W. Li, X. Zhou, K. Li, and H. Qi, “TINA: A fair inter-datacenter transmission mechanism with deadline guarantee,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Jul. 2020, pp. 2017–2025.
[3]
W. Li, X. Zhou, K. Li, H. Qi, and D. Guo, “TrafficShaper: Shaping inter-datacenter traffic to reduce the transmission cost,” IEEE/ACM Trans. Netw., vol. 26, no. 3, pp. 1193–1206, Jun. 2018.
[4]
C.-Y. Hong et al., “Achieving high utilization with software-driven WAN,” in Proc. 27th ACM Special Interest Group Data Commun. (SIGCOMM), 2013, pp. 15–26.
[5]
K. C. Barr and K. Asanović, “Energy-aware lossless data compression,” ACM Trans. Comput. Syst., vol. 24, no. 3, pp. 250–291, 2006.
[6]
P. A. H. Peterson and P. L. Reiher, “Datacomp: Locally independent adaptive compression for real-world systems,” in Proc. IEEE 36th Int. Conf. Distrib. Comput. Syst. (ICDCS), Jun. 2016, pp. 211–220.
[7]
E. Zohar and Y. Cassuto, “Automatic and dynamic configuration of data compression for web servers,” in Proc. 28th Large Installation Syst. Admin. Conf. (LISA), 2014, pp. 106–117.
[8]
S. Fouladi et al., “From laptop to lambda: Outsourcing everyday jobs to thousands of transient functional containers,” in Proc. 30th USENIX Annu. Tech. Conf. (ATC), 2019, pp. 475–488.
[9]
E. Jonas et al., “Cloud programming simplified: A Berkeley view on serverless computing,” EECS Dept., Univ. California, Berkeley, CA, USA, Tech. Rep. UCB/EECS-2019-3, 2019.
[10]
Serverless Computing—AWS Lambda. Accessed: May 1, 2022. [Online]. Available: https://aws.amazon.com/lambda/
[11]
TPC-H Homepage. Accessed: May 1, 2022. [Online]. https://www.tpc.org/tpch/
[12]
Q. Pu, S. Venkataraman, and I. Stoica, “Shuffling, fast and slow: Scalable analytics on serverless infrastructure,” in Proc. 16th USENIX Symp. Netw. Syst. design Implement. (NSDI), 2019, pp. 193–206.
[13]
A. Klimovic, Y. Wang, P. Stuedi, A. Trivedi, J. Pfefferle, and C. Kozyrakis, “Pocket: Elastic ephemeral storage for serverless analytics,” in Proc. 13th USENIX Symp. Oper. Syst. Design Implement. (OSDI), 2018, pp. 427–444.
[14]
S. Fouladi et al., “Encoding, fast and slow: Low-latency video processing using thousands of tiny threads,” in Proc. 14th USENIX Symp. Networked Syst. Design Implement. (NSDI'17), 2017, pp. 363–376.
[15]
S. Eismann, L. Bui, J. Grohmann, C. Abad, N. Herbst, andS. Kounev, “Sizeless: Predicting the optimal size of serverless functions,” in Proc. 22nd Int. Middleware Conf. (Middleware), 2021, pp. 248–259.
[16]
N. Akhtar, A. Raza, V. Ishakian, and I. Matta, “COSE: Configuring serverless functions using statistical learning,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Jul. 2020, pp. 129–138.
[17]
Amazon Lambda Enables Functions That Can Run up to 15 minutes. Accessed: Dec. 30, 2023. [Online]. Available: https://www.amazonaws.cn/en/new/2018/aws-lambda-enables-functions-that-can-run-up-to-15-minutes/
[18]
Memory and Computing Power—AWS Lambda. Accessed: Dec. 30, 2023. [Online]. Available: https://docs.aws.amazon.com/lambda/latest/operatorguide/computing-power.html
[19]
PiecewiseLinear Fitting. Accessed: May 1, 2023. [Online]. Available: https://pypi.org/project/pwlf/
[20]
W. G. Cochran, Sampling Techniques. Hoboken, NJ, USA: Wiley, 1977.
[21]
P. E. Gill and E. Wong, “Sequential quadratic programming methods,” in Mixed Integer Nonlinear Programming. Berlin, Germany: Springer, 2012, pp. 147–224.
[22]
G. S. Mudholkar and D. K. Srivastava, “Exponentiated Weibull family for analyzing bathtub failure-rate data,” IEEE Trans. Rel., vol. 42, no. 2, pp. 299–302, Jun. 1993.
[23]
S. J. Almalki and S. Nadarajah, “Modifications of the Weibull distribution: A review,” Rel. Eng. Syst. Saf., vol. 124, pp. 32–55, Apr. 2014.
[24]
Y. Liu et al., “RoBERTa: A robustly optimized BERT pretraining approach,” 2019, arXiv:1907.11692.
[25]
Wikimedia Downloads. Accessed: May 1, 2022. [Online]. Available: https://dumps.wikimedia.org/
[26]
A. Gokaslan and V. Cohen. (2019). Openwebtext Corpus. Accessed: Jul. 1, 2022. [Online]. Available: http://Skylion007.github.io/OpenWebTextCorpus
[27]
N. Nguyen, M. Maifi Hasan Khan, and K. Wang, “Towards automatic tuning of apache spark configuration,” in Proc. IEEE 11th Int. Conf. Cloud Comput. (CLOUD), Jul. 2018, pp. 417–425.
[28]
M. Li et al., “MRONLINE: Mapreduce online performance tuning,” in Proc. 23rd Int. Symp. High-Perform. Parallel Distrib. Comput. (HPDC), 2014, pp. 165–176.
[29]
O. Alipourfard, H. H. Liu, J. Chen, S. Venkataraman, M. Yu, and M. Zhang, “CherryPick: Adaptively unearthing the best cloud configurations for big data analytics,” in Proc. 14th USENIX Symp. Netw. Syst. Design Implement., 2017, pp. 469–482.
[30]
A. Mahgoub et al., “OPTIMUSCLOUD: Heterogeneous configuration optimization for distributed databases in the cloud,” in Proc. 31st USENIX Annu. Tech. Conf. (ATC), 2020, pp. 189–203.
[31]
A. P. Iyer, Z. Liu, X. Jin, S. Venkataraman, V. Braverman, and I. Stoica, “ASAP: Fast, approximate graph pattern mining at scale,” in Proc. 13th USENIX Symp. Operating Syst. Design Implement. (OSDI), 2018, pp. 745–761.
[32]
M. Kunjir and S. Babu, “Black or white? How to develop an autotuner for memory-base analytics,” in Proc. 39th ACM Int. Conf. Manage. Data (SIGMOD), 2020, pp. 1667–1683.
[33]
J. L. García-Dorado and S. G. Rao, “Cost-aware multi data-center bulk transfers in the cloud from a customer-side perspective,” IEEE Trans. Cloud Comput., vol. 7, no. 1, pp. 34–47, Jan. 2019.
[34]
M. Noormohammadpour, C. S. Raghavendra, S. Kandula, and S. Rao, “QuickCast: Fast and efficient inter-datacenter transfers using forwarding tree cohorts,” in Proc. IEEE Conf. Comput. Commun. (INFOCOM), Apr. 2018, pp. 225–233.
[35]
J. Zhang et al., “InfiniStore: Elastic serverless cloud storage,” Proc. VLDB Endowment, vol. 16, no. 7, pp. 1629–1642, 2023.
[36]
S. Shillaker and P. Pietzuch, “Faasm: Lightweight isolation for efficient stateful serverless computing,” in Proc. USENIX Annu. Tech. Conf. (USENIX ATC), 2020, pp. 419–433.
[37]
A. Mahgoub et al., “SONIC: Application-aware data passing for chained serverless applications,” in Proc. 32nd USENIX Annu. Tech. Conf. (ATC), 2021, pp. 285–301.
[38]
M. Yu, T. Cao, W. Wang, and R. Chen, “Following the data, not the function: Rethinking function orchestration in serverless computing,” in Proc. 20th USENIX Symp. Netw. Syst. Design Implement. (NSDI), 2023, pp. 1489–1504.
[39]
J. Song, S. Hu, Y. Bao, and G. Yu, “Compress blocks or not: Tradeoffs for energy consumption of a big data processing system,” IEEE Trans. Sustain. Comput., vol. 7, no. 1, pp. 112–124, Jan. 2022.
[40]
S. He, J. Chen, F. Jiang, D. K. Y. Yau, G. Xing, and Y. Sun, “Energy provisioning in wireless rechargeable sensor networks,” IEEE Trans. Mobile Comput., vol. 12, no. 10, pp. 1931–1942, Oct. 2013.
[41]
S. He, K. Shi, C. Liu, B. Guo, J. Chen, and Z. Shi, “Collaborative sensing in Internet of Things: A comprehensive survey,” IEEE Commun. Surveys Tuts., vol. 24, no. 3, pp. 1435–1474, 3rd Quart., 2022.
[42]
X. Deng, B. Wang, W. Liu, and L. T. Yang, “Sensor scheduling for multi-modal confident information coverage in sensor networks,” IEEE Trans. Parallel Distrib. Syst., vol. 26, no. 3, pp. 902–913, Mar. 2015.
[43]
K. Liao, A. Moffat, M. Petri, and A. Wirth, “A cost model for long-term compressed data retention,” in Proc. 10th ACM Int. Conf. Web Search Data Mining (WSDM), 2017, pp. 241–249.
[44]
J. Lu et al., “Speedup your analytics: Automatic parameter tuning for databases and big data systems,” Proc. VLDB Endowment, vol. 12, no. 12, pp. 1970–1973, 2019.
[45]
Z. Wen, Y. Wang, and F. Liu, “StepConf: SLO-aware dynamic resource configuration for serverless function workflows,” in Proc. 41st IEEE Conf. Comput. Commun. (INFOCOM) May 2022, pp. 1868–1877.
[46]
M. Bilal, M. Canini, R. Fonseca, and R. Rodrigues, “With great freedom comes great opportunity: Rethinking resource allocation for serverless functions,” in Proc. 18th Eur. Conf. Comput. Syst. (EuroSys), 2023, pp. 381–397.
[47]
A. Ali, R. Pinciroli, F. Yan, and E. Smirni, “Optimizing inference serving on serverless platforms,” Proc. VLDB Endowment, vol. 15, no. 10, pp. 2071–2084, Jun. 2022.
[48]
A. Karthikeyan et al., “SelfTune: Tuning cluster managers,” in Proc. 20th USENIX Symp. Netw. Syst. Design Implement. (NSDI) 2023, pp. 1097–1114.
[49]
L. Wang et al., “Morphling: Fast, near-optimal auto-configuration for cloud-native model serving,” in Proc. 12th ACM Symp. Cloud Comput. (SoCC), 2021, pp. 639–653.
[50]
R. Singh, S. Agarwal, M. Calder, and P. Bahl, “Cost-effective cloud edge traffic engineering with cascara,” in Proc. 18th USENIX Symp. Netw. Syst. Design Implement. (NSDI), Apr. 2021, pp. 201–216.
[51]
G. Rong et al., “Time and cost-efficient cloud data transmission based on serverless computing compression,” in Proc. 42nd IEEE Conf. Comput. Commun. (INFOCOM), May 2023, pp. 1–10.
Index Terms
- Fluid-Shuttle: Efficient Cloud Data Transmission Based on Serverless Computing Compression
Index terms have been assigned to the content through auto-classification.
Recommendations
Supporting Multi-Provider Serverless Computing on the Edge
ICPP Workshops '18: Workshop Proceedings of the 47th International Conference on Parallel ProcessingServerless computing has recently emerged as a new execution model for cloud computing, in which service providers offer compute runtimes, also known as Function-as-a-Service (FaaS) platforms, allowing users to develop, execute and manage application ...
Data storage auditing service in cloud computing: challenges, methods and opportunities
Cloud computing is a promising computing model that enables convenient and on-demand network access to a shared pool of configurable computing resources. The first offered cloud service is moving data into the cloud: data owners let cloud service ...
Comments
Information & Contributors
Information
Published In
1063-6692 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 10 October 2024
Published in TON Volume 32, Issue 6
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 6Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)6
Reflects downloads up to 27 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in