Real-time Network Traffic Management using the Modified BPTraSha Algorithm

Abstract- Various researchers have reported that traffic measurements demonstrate considerable burstiness on several time scales, with properties of self-similarity. Also, the rapid development of technologies has widened the scope of network and Internet applications and, in turn, increased traffic. The self-similar nature of this data traffic may exhibit spikiness and burstiness on large scales with such behaviour being caused by strong dependence characteristics in data: that is, large values tend to come in clusters and clusters of clusters and so on. Several studies have shown that TCP, the dominant network (Internet) transport protocol, contributes to the propagation of self-similarity. Bursty traffic can affect the Quality of Service of all traffic on the network by introducing inconsistent latency. It is easier to manage the workloads under less bursty (i.e. smoother) conditions. This paper continues the work published in [1], which introduced a novel algorithm for traffic shaping to smooth out the traffic burstiness. It was named as the Bursty Packet Traffic Shaper (BPTraSha). Experimental results show that this approach allows significant traffic control by smoothing the incoming traffic. BPTraSha can be implemented on the distribution router buffer so that the traffic’s bursty nature can be modified before it is transmitted over the core network (e.g., Internet). A modified BPTraSha algorithm is proposed in this research, which can be shown to be more dynamic, and therefore responsive, than the previous one. In this case, the dynamic variation of link speed can lead to further reducing the long-range dependence of network traffic.