TRAFFIC CONTROL OVER INTERNET USING WRR SCHEDULING

Abstract

The rapid growth of the World Wide Web in recent years has caused a significant shift in the composition of the Internet traffic. The end-to-end control mechanisms of TCP have been a critical factor in the robustness of the Internet. The network itself must now participate in controlling its own resource utilization. To promote the inclusion of end-to-end congestion control in the design of future protocols using best effort traffic, router mechanisms are needed to identify and restrict the bandwidth of selected high bandwidth best effort flows that are using disproportionate bandwidth in times of congestion. Packet scheduling disciplines in routers were proposed that isolate each flow, as much as possible from the effects of other flows. In this dissertation, one such type of discipline, weighted round robin (WRR) scheduling algorithm is implemented in routers and the performance characteristics have been studied. Simulations of the TCP/IP network are used to illustrate the, performance the algorithm. The software is written in C++ language on Pentium (300 MHz) processor system under LINUX environ ment.