An Adaptive Flow-Aware Packet Scheduling Algorithm for Multipath Tunnelling
Richard Sailer, J\"org H\"ahner

TL;DR
This paper introduces AFMT, an adaptive flow-aware packet scheduling algorithm for multipath tunnelling that improves throughput and reliability by dynamically managing traffic splitting and burst scheduling.
Contribution
It presents a novel adaptive traffic splitting and burst detection scheme for multipath tunnelling, enhancing load balancing with minimal packet reordering.
Findings
Increases throughput under varying network conditions
Enhances reliability in multipath tunnelling
Effectively manages traffic bursts for load balancing
Abstract
This paper proposes AFMT, a packet scheduling algorithm to achieve adaptive flow-aware multipath tunnelling. AFMT has two unique properties. Firstly, it implements robust adaptive traffic splitting for the subtunnels. Secondly, it detects and schedules bursts of packets cohesively, a scheme that already enabled traffic splitting for load balancing with little to no packet reordering. Several NS-3 experiments over different network topologies show that AFMT successfully deals with changing path characteristics due to background traffic while increasing throughput and reliability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
