Network border patrol: Preventing congestion collapse and promoting fairness in the Internet

被引:21
作者
Albuquerque, C [1 ]
Vickers, BJ
Suda, T
机构
[1] Magis Network, Dept Networking & Data Link Control, San Diego, CA 92130 USA
[2] ArenaNet NCSoft, Bellevue, WA 98004 USA
[3] Univ Calif Irvine, Sch Informat & Comp Sci, Irvine, CA 92697 USA
基金
美国国家科学基金会;
关键词
border control; congestion control; congestion collapse; core-stateless mechanisms; end-to-end argument; Internet; max-min fairness;
D O I
10.1109/TNET.2003.820248
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The Internet's excellent scalability and robustness result in part from the end-to-end nature of Internet congestion control. End-to-end congestion control algorithms alone, however, are unable to prevent the congestion collapse and unfairness created by applications that are unresponsive to network congestion. To address these maladies, We propose and investigate a novel congestion-avoidance mechanism called network border patrol (NBP). NBP entails the exchange of feedback between routers at the borders of a network in order to detect and restrict unresponsive traffic flows before they enter the network, thereby preventing congestion within the network. Moreover, NBP is complemented with the proposed enhanced core-stateless fair queueing (ECSFQ) mechanism, which provides fair bandwidth allocations to competing flows. Both NBP and ECSFQ are compliant with the Internet philosophy of pushing complexity toward the edges of the network whenever possible. Simulation results show that NBP effectively eliminates congestion collapse and that, when combined with ECSFQ, approximately max-min fair bandwidth allocations can be achieved for competing flows.
引用
收藏
页码:173 / 186
页数:14
相关论文
共 34 条
[1]  
[Anonymous], RFC
[2]  
[Anonymous], P ACM SIGCOMM 98
[3]  
[Anonymous], 896 RFC INT ENG TASK
[4]  
[Anonymous], 1997, 2001 IETF RFC
[5]  
[Anonymous], 1997, P ACM SIGCOMM 1997 O
[6]  
[Anonymous], 1988, ACM SIGCOMM COMPUTER
[7]   Packet reordering is not pathological network behavior [J].
Bennett, JCR ;
Partridge, C ;
Shectman, N .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (06) :789-798
[8]  
Bertsekas D., 1987, DATA NETWORKS
[9]  
Blake S., 1998, RFC 2475 (Informational)
[10]  
BRAKMO LS, 1994, P ACM SIGCOMM 94 AUG, P34