%0 Journal Article
%T A New Congestion Avoidance Scheme:SECN<br>一种新的拥塞避免算法——SECN
%A TANG Yuan
%A KONG Fan-sheng
%A <br>唐渊
%A 孔繁胜
%J 计算机应用研究
%D 2005
%I 
%X We firstly introduced two representative arithmetic RED and DECbit and interpret the difficulty in calculating the average queue length. Then presents a new scheme: SECN. The routers detect incipient congestion by compute the input queue length and throughout. Then choose the connection that occupies the most bandwidth to notify, requiring the sender to decrease the congestion window. Our scheme is easy-use, fair and no global synchronization of many connections decreasing their window at the same time. The simulation result also shows it has high throughout and low response time.
%K Congestion Control
%K Congestion Avoidance
%K TCP/IP Protocol<br>拥塞控制
%K 拥塞避免
%K TCP/IP协议
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=1154F1532088AB6B&yid=2DD7160C83D0ACED&vid=BC12EA701C895178&iid=DF92D298D3FF1E6E&sid=4B1FFFA116F7AE3B&eid=10828928EB89AD8E&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=5