Currently, libudpard implements the cyclic transfer-ID deduplication policy, which works but introduces an unnecessary fail-over delay shall one transport fail.
The monotonic transfer-ID deduplication policy always picks the first transfer to arrive regardless of which interface it arrived from. This approach eliminates the fail-over delay and guarantees that the redundant transport operates with the latency of the fastest underlying transport.
Please see this for background: https://pycyphal.readthedocs.io/en/stable/api/pycyphal.transport.redundant.html#reception
Currently, libudpard implements the cyclic transfer-ID deduplication policy, which works but introduces an unnecessary fail-over delay shall one transport fail.
The monotonic transfer-ID deduplication policy always picks the first transfer to arrive regardless of which interface it arrived from. This approach eliminates the fail-over delay and guarantees that the redundant transport operates with the latency of the fastest underlying transport.