基于差分服务的贪婪流问题解决算法

A DiffServ Based Solution to Problems of Greedy Flow

贪婪流问题是网络拥塞控制范畴的问题 ,泛指不遵从标准TCP拥塞控制机制的流 贪婪流给网络带来不公平性 提出了一种新的甄别算法 ,通过对目标流发送窗口随分组丢弃变化关系的分析 ,对不合规范的流进行检测 算法采用定长列表结构 ,具有实现简单、扩展性强的特点 提出了一种基于差分服务模式的体系结构 ,对传统Internet服务哲学进行了扩展 ,从根本上支持新型流式应用 。

Greedy flow problem belongs to the area of network congestion control It includes flows that do not obey the congestion control mechanism of standard TCP Greedy flows can yield unfairness in a resource sharing environment In this paper, a novel algorithm is proposed, which identifies the greedy flow by analyzing the send window of target flows before and after an arranged packet drop The algorithm uses a fixed length list which makes algorithm itself easier to implement and more scalable Furthermore, the service philosophy of traditional Internet is extended by proposing a DiffServ based architecture with end to end traffic management, which can support new stream based application naturally