Data Structure for Packet De-Duplication in Distributed Environments
István Finta, Lóránt Farkas, Sándor Szénási · 2020
In this contribution we propose an eventually consistent replica management framework providing guarantees for packet duplication avoidance in a distributed manner considering load balancing and avoiding the single point of failure. To achieve this we use a special kind of data structure, the so called Interval Merging Binary Tree.