TCP-friendly marking for scalable best-effort services on the Internet

被引:0
作者
Lo Monaco, G [1 ]
Feroz, A [1 ]
Kalyanaraman, S [1 ]
Xia, Y [1 ]
机构
[1] Rensselaer Polytech Inst, ECSE Dept, Troy, NY 12180 USA
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper proposes the use of TCP-awaxe network-based packet marking, which in conjunction with differential packet dropping, is a powerful way to improve the performance of buffer management for best-effort services on the Internet. We extend the notion of "TCP-Friendly" packet marking, proposed recently by us [6], and apply it to improve the performance of traditional best-effort services. The TCP-aware use of deterministic packet marking at the network edge allows us to protect selected TCP packets from suffering loss. This significantly reduces the total number of timeouts and avoids the resulting service degradation. In particular, we protect TCP sessions with very small windows, disperse packet loss across a given window, and protect retransmitted packets from encountering loss. We show baseline results which illustrate that the performance gains are considerable (orders of magnitude) when compared to stateful packet dropping algorithms like FRED [15], and even when TCP SACK [18] implementations are employed. The scheme has been implemented in Linux 2.2.10, and all the results are based upon experimental data.
引用
收藏
页码:11 / 19
页数:9
相关论文
共 25 条
[1]  
ALLMAN M, 2001, ENHANCING TCP LOSS R
[2]  
[Anonymous], 1998, RECOMMENDATIONS QUEU
[3]  
[Anonymous], 1996, 2018 IETF RFC
[4]  
[Anonymous], 1998, 2475 RFC IETF
[5]  
[Anonymous], 1997, RFC 2001
[6]   Explicit allocation of best-effort packet delivery service [J].
Clark, DD ;
Fang, WJ .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1998, 6 (04) :362-373
[7]  
Fall K., 1996, Computer Communication Review, V26, P5, DOI 10.1145/235160.235162
[8]  
Feng WC, 1999, IEEE ACM T NETWORK, V7, P685
[9]  
FEROZ A, 2000, IWQOS 2000 PITTSB PA
[10]   A report on recent developments in TCP congestion control [J].
Floyd, S .
IEEE COMMUNICATIONS MAGAZINE, 2001, 39 (04) :84-90