Recent multipath-tools contains a patch series that allows latency-based path prioritization. However the code is clumsy and not well designed.

More importantly, I think that the applied algorithm, which is based on simple methods like comparing averages and standard deviations, is suboptimal. I consider replacing it with a clustering-based approach, using the open source cluster library.

Testing this will be a challenge.

Looking for mad skills in:

Nothing? Add some keywords!

This project is part of:

Hack Week 17

Activity

  • about 1 year ago: zzhou liked Path clustering for multipathd
  • about 1 year ago: mwilck originated Path clustering for multipathd
  • Show History

    Comments

    Be the first to comment!

    Similar Projects

    This project is one of its kind!