Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?
Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.
One major drawback of multipath transferring schemes, which is inspired by the usage of different paths with diverse delays, is the emergence of reordering among packets of a flow. This reordering brings some substantial problems (like larger delay and buffer space) to the transport applications. In this paper, we present a novel UDP-based multipath scheme for in-order delivery to the receiver by scheduling of packets among multiple paths. This method imposes the minimum possible delay and a small buffer space on the receiver’s application. We theoretically prove the optimality of the proposed method. Finally, through simulation experiments, we show that the performance of our multipath method is comparable with the best-case one-path transmission with aggregated bandwidth.