TY - GEN
T1 - Do Switches Still Need to Deliver Packets in Sequence?
AU - Usubutun, Ufuk
AU - Fund, Fraida
AU - Panwar, Shivendra
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Internet switches become harder and costlier to build for higher line rates and switch capacities. In-sequence delivery of packets has traditionally been a constraint on switch designs because TCP loss detection was considered vulnerable to out-of-sequence arrivals. For this reason, extremely efficient and simple designs, such as the Load Balanced Birkhoff-von Neumann Switch, were considered impractical. However, we reevaluate this constraint considering modern TCP implementations with loss detection algorithms like Recent Acknowledgment (RACK) that are more resilient to out-of-order arrivals. In a set of testbed experiments representative of wide area core networks, we evaluated the performance of TCP flows traversing a load balanced switch that reorders some packets within a flow. We show that widely deployed and standard TCP implementations of the last decade achieve similar performance when traversing a load balanced switch as they do when there is no reordering. Furthermore, we also verified that an increase in the line rate leads to favorable conditions for time based loss detection methods, such as the one used in RACK. Our results, if further validated, suggest that switch designs that were previously thought to be unsuitable can potentially be utilized, thanks to the relaxation of the in-sequence delivery constraint.
AB - Internet switches become harder and costlier to build for higher line rates and switch capacities. In-sequence delivery of packets has traditionally been a constraint on switch designs because TCP loss detection was considered vulnerable to out-of-sequence arrivals. For this reason, extremely efficient and simple designs, such as the Load Balanced Birkhoff-von Neumann Switch, were considered impractical. However, we reevaluate this constraint considering modern TCP implementations with loss detection algorithms like Recent Acknowledgment (RACK) that are more resilient to out-of-order arrivals. In a set of testbed experiments representative of wide area core networks, we evaluated the performance of TCP flows traversing a load balanced switch that reorders some packets within a flow. We show that widely deployed and standard TCP implementations of the last decade achieve similar performance when traversing a load balanced switch as they do when there is no reordering. Furthermore, we also verified that an increase in the line rate leads to favorable conditions for time based loss detection methods, such as the one used in RACK. Our results, if further validated, suggest that switch designs that were previously thought to be unsuitable can potentially be utilized, thanks to the relaxation of the in-sequence delivery constraint.
KW - dupthresh
KW - packet reordering
KW - RACK
KW - Switching
KW - TCP
UR - http://www.scopus.com/inward/record.url?scp=85163393828&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85163393828&partnerID=8YFLogxK
U2 - 10.1109/HPSR57248.2023.10147992
DO - 10.1109/HPSR57248.2023.10147992
M3 - Conference contribution
AN - SCOPUS:85163393828
T3 - IEEE International Conference on High Performance Switching and Routing, HPSR
SP - 89
EP - 95
BT - 2023 IEEE 24th International Conference on High Performance Switching and Routing, HPSR 2023
PB - IEEE Computer Society
T2 - 24th IEEE International Conference on High Performance Switching and Routing, HPSR 2023
Y2 - 5 June 2023 through 7 June 2023
ER -