Abstract: 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