TY - JOUR
T1 - Preemptive packet-mode scheduling to improve TCP performance
AU - Li, Wenjie
AU - Liu, Bin
AU - Shi, Lei
AU - Xu, Yang
AU - Wu, Dapeng
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2005
Y1 - 2005
N2 - Recent Internet traffic measurements show that 60% of the total packets are short packets, which include TCP acknowledgment and control segments. These short packets make a great impact on the performance of TCP. Unfortunately, short packets suffer from large delay due to serving long data packets in switches running in the packet mode, i.e. a packet is switched in its entirety. To optimize TCP performance, we apply a cross-layer approach to the design of switching architectures and scheduling algorithms. Specifically, we propose a preemptive packet-mode scheduling architecture and an algorithm called preemptive short packets first (P-SPF). Analysis and simulation results demonstrate that compared to existing packet-mode schedulers, P-SPF significantly reduces the waiting time for short packets while achieving a high overall throughput when the traffic load is heavy. Moreover, with a relatively low speedup, P-SPF performs better than existing packet-mode schedulers under any traffic load. © IFIP International Federation for Information Processing 2005.
AB - Recent Internet traffic measurements show that 60% of the total packets are short packets, which include TCP acknowledgment and control segments. These short packets make a great impact on the performance of TCP. Unfortunately, short packets suffer from large delay due to serving long data packets in switches running in the packet mode, i.e. a packet is switched in its entirety. To optimize TCP performance, we apply a cross-layer approach to the design of switching architectures and scheduling algorithms. Specifically, we propose a preemptive packet-mode scheduling architecture and an algorithm called preemptive short packets first (P-SPF). Analysis and simulation results demonstrate that compared to existing packet-mode schedulers, P-SPF significantly reduces the waiting time for short packets while achieving a high overall throughput when the traffic load is heavy. Moreover, with a relatively low speedup, P-SPF performs better than existing packet-mode schedulers under any traffic load. © IFIP International Federation for Information Processing 2005.
UR - http://www.scopus.com/inward/record.url?scp=26444576805&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-26444576805&origin=recordpage
U2 - 10.1007/11499169_20
DO - 10.1007/11499169_20
M3 - RGC 21 - Publication in refereed journal
SN - 0302-9743
VL - 3552
SP - 246
EP - 258
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
T2 - 13th International Workshop on Qualityof Service - IWQoS 2005
Y2 - 21 June 2005 through 23 June 2005
ER -