Favoring Short Flows Without Punishing Long Flows for the Internet Traffic Performance Improvement

摘要

An explosive growth in business applications using the Internet have resulted in a strong demand for some notion of reliability or quality of service. During periods of congestion or failure, the quality of service of all flows is degraded. As a result, a strong need for service differentiation in the flows to provide service guarantees. Today the internet carries different types of traffic with the increased use of peer to peer, HTTP, FTP applications. Web traffic comprises short flows which requires low response time and long flows seen in the internet originate form peer to peer file sharing applications TCP is the dominating protocol that carries majority of the total internet traffic. Recent internet traffic measurement shows most of the TCP flows are short lived. The performance improvement in the internet traffic can be achieved by the advantages of scheduling algorithms to favor short TCP flows first. However long TCP flows competing against short TCP flows starve at some point. Hence, the proposed Dynamic Queue Scheduling (DQS) favors short TCP flows without penalizing the performance of long flows using Dynamic packet scheduling ratio. We observed that the mean transmission time of flows and packet loss significantly decreases in comparison with FIFO and RuN2C.