Bandwidth Limitation Based on Content Classification Using Queue Trees and Hierarchical Token Buckets

Abstract

Internet services become a mandatory to society in a daily basis. The key issue of this service is the crucial bandwidth that is caused by traffic congestion which leads to poor network performance. Therefore, bandwidth management is required as an effort to reduce traffic congestion on hotspot services by using the Queue Tree and Hierarchical Token Bucket methods. This study conducted a comparison of Queue Type analysis on the Queue Tree method, namely First In First Out (FIFO) and Random Early Detect (RED) to determine the process of sending data packets that can reduce congestion when building hotspot services. Test results on 10 FIFO and RED clients show that Queue Type FIFO is superior to Queue Type RED, with a FIFO QoS index of 87.5% and RED 75% with a difference of 15%, based on Quality of Service (QoS) with standard TIPHON.