Preview

Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS)

Advanced search

The Dynamic Adaptive Packet Buffering (DAPB) Algorithm for Service Mesh Performance Enhancement Based on eBPF

https://doi.org/10.15514/ISPRAS-2025-37(5)-7

Abstract

This paper introduces the Dynamic Adaptive Packet Buffering (DAPB) algorithm. Designed to enhance data transfer efficiency in modern networking environments, it is built on the principles of Nagle's algorithm. DAPB addresses the limitations of existing buffering techniques by dynamically adjusting its behavior based on real-time network conditions, application requirements, and latency sensitivity. The algorithm incorporates context-sensitive buffering, adaptive timeout mechanisms, and machine learning-driven predictions to achieve a balance between efficiency, latency, and energy consumption. DAPB's context-aware buffering tailors its strategy to the specific needs of the application, minimizing buffering for latency-sensitive applications like VoIP and online gaming, while maximizing buffering for throughput-sensitive applications like file transfers. The adaptive timeout mechanism dynamically adjusts the waiting timeout based on network conditions such as round-trip time, packet loss, and jitter, ensuring optimal performance under varying workloads. Machine learning models are used to predict optimal buffer sizes and timeout values, leveraging historical data and real-time metrics to improve decision-making. The algorithm also features selective aggregation, intelligently deciding which packets to aggregate and which to send immediately. This ensures that urgent packets are transmitted without delay, while nonurgent packets are aggregated to reduce overhead. Additionally, DAPB prioritizes energy efficiency by optimizing buffer sizes and timeout values, making it suitable for energy-constrained environments like edge computing and IoT devices. The DAPB algorithm is expected to improve the data transfer performance in various scenarios. Compared to the standard Nagle algorithm, the DAPB algorithm is expected to reduce latency, improve throughput, and enhance energy efficiency. This paper is the result of a research project implemented as part of the Basic Research Program at the National Research University Higher School of Economics (HSE University).

About the Authors

Hank-Debain DJAMBONG TENKEU
National Research University “Higher School of Economics”
Russian Federation

Master of Science in Software Engineering, postgraduate student at the National Research University “Higher School of Economics”, invited lecturer at the Faculty of Computer Science of NRU “Higher School of Economics”. Research interests: Software and Computer Systems Engineering.



Dmitry Vladimirovich ALEXANDROV
National Research University “Higher School of Economics”
Russian Federation

Professor in the Department of Software Engineering, Faculty of Computer Science, National Research University “Higher School of Economics”. He is also the Head of the Research and Educational Laboratory of Cloud and Mobile Technologies. His research interests include methods and technologies of artificial intelligence, machine learning and data analysis, iOS development, mobile application development, software development, indoor navigation, databases, game development.



References

1. J. Nagle, Congestion control in IP/TCP internetworks, RFC Editor, RFC 896, Jan. 1984, Obsoleted by RFC 1122, but foundational to Nagle’s algorithm. [Online]. Available: https: //tools.ietf.org/html/rfc896.

2. J. Nagle, “Congestion control in IP/TCP internetworks,” RFC Editor, RFC 896, (Jan. 1984), Obsoleted by RFC 1122, but foundational to Nagle’s algorithm. [Online]. Available: https: //tools.ietf.org/html/rfc896.

3. TCP/IP Illustrated, Volume 1: The Protocols ([1994]), W. R. Stevens, Addison-Wesley Professional, isbn: 978-0201633467.

4. “The BSD packet filter: a new architecture for user-level packet capture” ([1993]), S. McCanne et al., (In: Proceedings of the USENIX Winter 1993 Conference), pp. 259–270.

5. “BPF: In-kernel Virtual Machine” ([2015]), A. Starovoitov, (In: Linux Plumbers Conference).

6. “The eXpress Data Path: Fast Programmable Packet Processing in the Operating System Kernel” ([2018]), T. Hoiland-Jorgensen et al., (In: Proceedings of the 14th International Conference on Emerging Networking Experiments and Technologies), pp. 54–66, doi: 10.1145/3281411.3281443.

7. Computer Networks ([2011]), A. S. Tanenbaum et al., Pearson.

8. “BBR: Congestion-based congestion control” ([2016]), N. Cardwell, Y. Cheng, C. S. Gunn, et al., ACM Queue, 14, 5, pp. 20–53, doi: 10.1145/3012426.3022184.

9. N. Cardwell, Y. Cheng, S. H. Yeganeh, et al., “Tcp bbr v2 alpha/release history,” IETF, RFC 8962, (2021). [Online]. Available: https://tools.ietf.org/html/rfc8962.

10. Understanding Linux Network Internals ([2005]), C. Benvenuti, O’Reilly, isbn: 9780596002558.

11. “Efficient data transfer through zero copy” ([2006]), W. Ma et al., (In: Proceedings of the 2006 ACM/IEEE Conference on Supercomputing), pp. 1–12, doi: 10.1145/1188455.1188583.

12. “Differential evolution optimization for constrained routing in Wireless Mesh Networks” ([2014]), M. Sanni et al., (In: International Conference on Frontiers of Communications, Networks and Applications (ICFCNA 2014 - Malaysia)), pp. 1–6, doi: 10.1049/cp.2014.1397.

13. Istio, Istio: A service mesh for microservices, Official documentation, (2023). [Online]. Available: https://istio.io/latest/docs/concepts/what-is-istio/.

14. “Congestion control in IP/TCP internetworks” ([1984]), J. Nagle, ACM SIGCOMM Computer Communication Review, 14, 4, pp. 11–17, doi: 10.1145/1024908.1024910.

15. “Congestion avoidance and control” ([1988]), V. Jacobson, ACM SIGCOMM Computer Communication Review, 18, 4, pp. 314–329, doi: 10.1145/52325.52341.

16. R. Braden, “Requirements for internet hosts—communication layers,” IETF, RFC 1122, (1989). [Online]. Available: https://tools.ietf.org/html/rfc1122.

17. “Reducing web latency: the virtue of gentle aggression” ([2013]), T. Flach et al., (In: Proceedings of the ACM SIGCOMM 2013 Conference), pp. 159–170, doi: 10.1145/2486001.2486030.

18. “Evaluating the impacts of alternative TCP congestion control algorithms” ([2008]), S. Ha et al., (In: IEEE International Conference on Network Protocols), pp. 49–58, doi: 10.1109/ICNP. 2008.4697036.

19. “TCP Vegas: End to end congestion avoidance on a global internet” ([1995]), L. S. Brakmo et al., IEEE Journal on Selected Areas in Communications, 13, 8, pp. 1465–1480, doi: 10.1109/ 49.464716.

20. Computer Networking: A Top-Down Approach ([2021]), J. F. Kurose et al., Pearson, isbn: 9780135928615.

21. Learning eBPF ([Mar. 2023]), L. Rice, O’Reilly, isbn: 978-1-098-13887-5.

22. T. Graf et al., “Cilium: eBPF-based networking, security, and observability,” Isovalent, Tech. Rep., (2023), Official documentation. [Online]. Available: https://docs.cilium.io/en/stable/index.html.

23. “Network Shortcut in Data Plane of Service Mesh with eBPF” ([Jan. 2024]), W. Yang et al., Journal of Network and Computer Applications, 222, 1, p. 103805, doi: 10.1016/j.jnca. 2023.103805.

24. A. Cutler et al., “Random forests,” in Research Gate, (Jan. 2011), vol. 45, pp. 157–176, isbn:978-1-4419-9325-0. doi: 10.1007/978-1-4419-9326-7_5.

25. “Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms” ([Jan. 2024]), G. Zhang et al., ACM Comput. Surv., 56, 5, doi: 10.1145/3636553.

26. Gui774ume, eBPFKit: A rootkit and intrusion detection system based on ebpf, https:// github.com/Gui774ume/ebpfkit, GitHub repository, (2021). [Online]. Available: https://github.com/Gui774ume/ebpfkit.


Supplementary files

Review

For citations:


DJAMBONG TENKEU H., ALEXANDROV D.V. The Dynamic Adaptive Packet Buffering (DAPB) Algorithm for Service Mesh Performance Enhancement Based on eBPF. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2025;37(5):93-110. https://doi.org/10.15514/ISPRAS-2025-37(5)-7



Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 2079-8156 (Print)
ISSN 2220-6426 (Online)