FaST: Fine-grained and Scalable TCP for Cloud Data Center Networks

被引:3
|
作者
Hwang, Jaehyun [1 ]
Yoo, Joon [2 ]
机构
[1] Bell Labs, Alcatel Lucent, Seoul, South Korea
[2] Gachon Univ, Dept Software Design & Management, Songnam, South Korea
来源
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS | 2014年 / 8卷 / 03期
基金
新加坡国家研究基金会;
关键词
Scalable congestion control; cloud data center networks; virtual congestion window;
D O I
10.3837/tiis.2014.03.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the increasing usage of cloud applications such as MapReduce and social networking, the amount of data traffic in data center networks continues to grow. Moreover, these applications follow the incast traffic pattern, where a large burst of traffic sent by a number of senders, accumulates simultaneously at the shallow-buffered data center switches. This causes severe packet losses. The currently deployed TCP is custom-tailored for the wide-area Internet. This causes cloud applications to suffer long completion times towing to the packet losses, and hence, results in a poor quality of service. An Explicit Congestion Notification (ECN)-based approach is an attractive solution that conservatively adjusts to the network congestion in advance. This legacy approach, however, lacks scalability in terms of the number of flows. In this paper, we reveal the primary cause of the scalability issue through analysis, and propose a new congestion-control algorithm called FaST. FaST employs a novel, virtual congestion window to conduct fine-grained congestion control that results in improved scalability. Furthermore, FaST is easy to deploy since it requires only a few software modifications at the server-side. Through ns-3 simulations, we show that FaST improves the scalability of data center networks compared with the existing approaches.
引用
收藏
页码:762 / 777
页数:16
相关论文
共 50 条
  • [31] Towards secure and fine-grained data sharing over cloud platform
    Song, Fuyuan
    Sun, Xiaowei
    Gao, Yunlong
    Jiang, Qin
    Fu, Zhangjie
    FRONTIERS OF COMPUTER SCIENCE, 2025, 19 (06)
  • [32] Fine-Grained Access Control ensuring Data Privacy in OpenStack Cloud
    John, Naveen Thomas M.
    Thomas, Manoj V.
    2017 INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING, INSTRUMENTATION AND CONTROL TECHNOLOGIES (ICICICT), 2017, : 1669 - 1674
  • [33] Fine-Grained and Controllably Editable Data Sharing With Accountability in Cloud Storage
    Hou, Huiying
    Ning, Jianting
    Zhao, Yunlei
    Deng, Robert
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2022, 19 (05) : 3448 - 3463
  • [34] FlexTOE: Flexible TCP Offload with Fine-Grained Parallelism
    Shashidhara, Rajath
    Stamler, Tim
    Kaufmann, Antoine
    Peter, Simon
    PROCEEDINGS OF THE 19TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION (NSDI '22), 2022, : 87 - 102
  • [35] Towards Revocable Fine-Grained Encryption of Cloud Data: Reducing Trust upon Cloud
    Yang, Yanjiang
    Liu, Joseph
    Wei, Zhuo
    Huang, Xinyi
    INFORMATION SECURITY AND PRIVACY, ACISP 2017, PT I, 2017, 10342 : 127 - 144
  • [36] Fine-grained data access control for distributed sensor networks
    Junbeom Hur
    Wireless Networks, 2011, 17 : 1235 - 1249
  • [37] Fine-grained data access control for distributed sensor networks
    Hur, Junbeom
    WIRELESS NETWORKS, 2011, 17 (05) : 1235 - 1249
  • [38] VerSA: Verifiable and Secure Approach With Provable Security for Fine-Grained Data Distribution in Scalable Internet of Things Networks
    Olakanmi, Oladayo Olufemi
    Odeyemi, Kehinde Oluwasesan
    INTERNATIONAL JOURNAL OF INFORMATION SECURITY AND PRIVACY, 2021, 15 (03) : 65 - 82
  • [39] Towards a fine-grained access control for Cloud
    Msahli, Mounira
    Chen, Xiuzhen
    Serhrouchni, Ahmed
    2014 IEEE 11TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE), 2014, : 286 - 291
  • [40] Fine-Grained Allocation Algorithm for Sharing Heterogeneous Resources in Data Center
    Tang X.
    Fu Y.
    Fan X.
    Xibei Gongye Daxue Xuebao/Journal of Northwestern Polytechnical University, 2020, 38 (03): : 589 - 595