Traffic shaping in aggregate-based networks: implementation and analysis

This paper addresses the issue of traffic shaping analytically by extending known Network Calculus. An equation that allows computing tight per-flow output bounds in aggregate scheduling networks is derived and a solution for shaped interfering flows is provided. We then give an overview on the shaping capabilities of current legacy routers, showing deviations of actual implementations compared to the idealized view. Finally, the evolved analytical framework is applied to an example scenario and the results are compared to corresponding measurements.