Burst Round Robin: A Linux Ethernet Bonding Implementation Study

• Author(s) / Creator(s)

  • Shieh, Wilson Ka Wai

• In this paper, we document the experience with several link aggregation schemes under Linux. These are implemented in the bond kernel loadable module. We introduce a new scheme called burst round robin (BRR). We evaluate two aspects of each scheme: load-distribution and packet reordering.

• Date created

  2007-04-03

• Subjects / Keywords

  • Link Aggregation
  • Linux Kernel

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/r3-efzj-6b98

• License

  Attribution-NonCommercial 4.0 International