Abstract
This paper presents FALTCON that enhances the control path for repeated TCP connections. First, we measure and find that the control path of TCP stack consumes as many CPU cycles as that of the data path, which brings up the importance of optimizing the control path. Yet, to the best of our knowledge, there has been little research effort on investigating the control path. Also, we observe that a significant portion of TCP traffic (e.g., HTTP) is not only short-lived but also repeated for a server and client pair. We design FALTCON to take advantage of the property of being repeated. Specifically, FALTCON re-designs the control path to remove the duplicate allocation of the structures and redundant operations over them. FALTCON is implemented in Linux 5.1 that has the latest and highly efficient networking stack. Furthermore, we optimize FALTCON to be lockless entirely and to work per-core. The experiment results show that FALTCON achieves a higher number of connections than Linux, up to 19%, and with much less CPU cycles up to 31%.
Original language | English |
---|---|
Title of host publication | APSys 2021 - Proceedings of the 12th ACM SIGOPS Asia-Pacific Workshop on Systems |
Publisher | Association for Computing Machinery, Inc |
Pages | 131-137 |
Number of pages | 7 |
ISBN (Electronic) | 9781450386982 |
DOIs | |
Publication status | Published - 2020 Aug 24 |
Event | 12th ACM SIGOPS Asia-Pacific Workshop on Systems, APSys 2021 - Virtual, Online, China Duration: 2021 Aug 24 → 2021 Aug 25 |
Publication series
Name | APSys 2021 - Proceedings of the 12th ACM SIGOPS Asia-Pacific Workshop on Systems |
---|
Conference
Conference | 12th ACM SIGOPS Asia-Pacific Workshop on Systems, APSys 2021 |
---|---|
Country/Territory | China |
City | Virtual, Online |
Period | 21/8/24 → 21/8/25 |
Bibliographical note
Publisher Copyright:© 2021 ACM.
Keywords
- Kernel TCP stack
- Operating system
- Repeated TCP
- Short-lived TCP
- TCP
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture