TY - JOUR
T1 - The switch reordering contagion
T2 - Preventing a few late packets from ruining the whole party
AU - Rottenstreich, Ori
AU - Li, Pu
AU - Horev, Inbal
AU - Keslassy, Isaac
AU - Kalyanaraman, Shivkumar
N1 - European Research Council [210389]; Jacobs-Qualcomm fellowship; Intel graduate fellowship; Gutwirth Memorial fellowship; Intel research grant on Heterogeneous Computing; Intel ICRI-CI Center; Technion Funds for Security Research; Hasso Plattner Center for Scalable ComputingThe authors thank Alex Shpiner for his helpful suggestions. This work was supported in part by the European Research Council Starting Grant 210389, in part by the Jacobs-Qualcomm fellowship, in part by an Intel graduate fellowship, in part by a Gutwirth Memorial fellowship, in part by an Intel research grant on Heterogeneous Computing, in part by the Intel ICRI-CI Center, in part by the Technion Funds for Security Research, and in part by the Hasso Plattner Center for Scalable Computing.
PY - 2014/5
Y1 - 2014/5
N2 - Packet reordering has now become one of the most significant bottlenecks in next-generation switch designs. A switch practically experiences a reordering delay contagion, such that a few late packets may affect a disproportionate number of other packets. This contagion can have two possible forms. First, since switch designers tend to keep the switch flow order, i.e., the order of packets arriving at the same switch input and departing from the same switch output, a packet may be delayed due to packets of other flows with little or no reason. Further, within a flow, if a single packet is delayed for a long time, then all the other packets of the same flow will have to wait for it and suffer as well. In this paper, we suggest solutions against this reordering contagion. We first suggest several hash-based counter schemes that prevent inter-flow blocking and reduce reordering delay. We further suggest schemes based on network coding to protect against rare events with high queueing delay within a flow. Last, we demonstrate using both analysis and simulations that the use of these solutions can indeed reduce the resequencing delay. For instance, resequencing delays are reduced by up to an order of magnitude using real-life traces and a real hashing function.
AB - Packet reordering has now become one of the most significant bottlenecks in next-generation switch designs. A switch practically experiences a reordering delay contagion, such that a few late packets may affect a disproportionate number of other packets. This contagion can have two possible forms. First, since switch designers tend to keep the switch flow order, i.e., the order of packets arriving at the same switch input and departing from the same switch output, a packet may be delayed due to packets of other flows with little or no reason. Further, within a flow, if a single packet is delayed for a long time, then all the other packets of the same flow will have to wait for it and suffer as well. In this paper, we suggest solutions against this reordering contagion. We first suggest several hash-based counter schemes that prevent inter-flow blocking and reduce reordering delay. We further suggest schemes based on network coding to protect against rare events with high queueing delay within a flow. Last, we demonstrate using both analysis and simulations that the use of these solutions can indeed reduce the resequencing delay. For instance, resequencing delays are reduced by up to an order of magnitude using real-life traces and a real hashing function.
KW - Switching theory
KW - packet-switching networks
UR - http://www.scopus.com/inward/record.url?scp=84901005362&partnerID=8YFLogxK
U2 - https://doi.org/10.1109/TC.2012.288
DO - https://doi.org/10.1109/TC.2012.288
M3 - مقالة
SN - 0018-9340
VL - 63
SP - 1262
EP - 1276
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
IS - 5
M1 - 6375702
ER -