Simulation and comparison of a new network protocol

The active queue management (AQM) algorithms in use today are found to be vulnerable to a type of denial of service attack called low-rate denial of service (LDoS) attack which degrades TCP connection throughput. Robust Random Early Detection (RRED), an AQ M algorithm, is designed to filter out these attacking packets before they are fed to the RED. Performance of this algorithm is evaluated and compared with other active queue management algorithm during the presence of LDoS attack. However, the analysis only focused on average throughput of TCP during the attack period. In this work, we adopted the detection and filtering part from RRED and integrated it to our Orange AQM and expanded the analysis to instantaneous and average TCP throughput; used sensitivity, specificity and accuracy measures to determine the performance of the filter. In all the cases, the result of the analysis shows that Robust Orange algorithm performs better than RRED in terms of TCP throughput; Robust Orange is more sensitive in filtering out attack packets than RRED and Robust Orange is better in receiving normal user's packet than RRED. The accuracy measure of Robust Orange is better than that of RRED.