In this paper, an architecture is proposed for bursty traffic control which consists of an adaptive packet scheduler and bursty traffic slicing algorithm. In Internet, unresponsive flows easily occupy the limited buffers, there by reducing the Quality of Service (QoS). In this paper, first the incoming traffic is checked and the unresponsive flows are detected and penalized using a dropping policy. By using the bursty traffic slicer algorithm, the load balancer reroutes the high priority aggressive flows into the least loaded best path. Based on a split vector, the bursty traffic slicing algorithm splits the aggressive flows over multiple parallel paths. Since the high rate aggressive traffic flows are splitted along multiple parallel paths, load balancing is obtained in the system in order to achieve fair bandwidth allocations. The proposed switching technique is performed along the edge and core routers. By our simulation results, our packet scheduler achieves better than the standard fair queuing techniques.
Load Balancing, Splitting, Bursty Traffic, Unresponsive Flows, Scheduler
