按端到端连接调度的网络拥塞控制机制  

Per-Flow Scheduling Congestion Control Mechanism in Routers

作　　者：陈依群[1] 铁玲[1] 顾尚杰[1] 诸鸿文[1] 

机构地区：[1]上海交通大学电子工程系,上海200030

出　　处：《上海交通大学学报》2000年第2期283-285,共3页Journal of Shanghai Jiaotong University

摘　　要：针对越来越多网络应用不采用端到端拥塞控制机制而导致非公平占用网络带宽问题，介绍了在路由器内部实现基于连接调度的增强拥塞控制方法．路由器使用公平排队调度算法代替传统的先来先服务调度算法，可隔离和保护基于漏桶控制的网络连接．但采用传输控制协议（ＴＣＰ）连接对数据包丢失敏感，路由器使用公平排队调度算法还需要结合相应的缓冲管理方法，才能保证ＴＣＰ连接获取公平的吞吐量．讨论了基于连接的最长排队数据包丢弃的缓冲管理方法．模拟结果表明。With the increasement of Internet users and the diversification of network applications,router itself is necessary to improve the congestion control mechanism.In this paper,the router congestion control issue based on per flow scheduling was investigated.By adopting the fair queueing instead of the traditional FCFS service discipline,router is able to isolate and protect leaky bucket controlled network connections.However,to achieve the fair bandwidth allocation for feedback controlled and adaptive connection such as TCP,the router need to combine the fair queueing with appropriate buffer management schemes.It proposed a new buffer management scheme of the longest queue drop.The simulation results show the proposed schemes can obtain better performance comparing with that of the RED buffer management.

关 键 词：加权公平排队 拥塞控制 连接调度 计算机网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]