Fairness-guaranteed per-class-type queueing and hierarchical packet scheduling for DiffServ-aware-MPLS network

In DiffServ packet processing, three fairness problems have been emphasized in recent research works: (i) fair sharing of bandwidth among flows with different round trip times (RTT) in aggregated flows of a class-type; (ii) fairness between responsive traffic (e.g., TCP) and nonresponsive traffic (e.g., UDP); and (iii) fair distribution of excess bandwidth among aggregates. In this paper we propose a fairness-guaranteed per class-type queueing and a hierarchical packet scheduler for DiffServ-aware-MPLS networks. The proposed scheme discriminates the packet flows according to the pre-configured DiffServ class-types, and applies different packet processing schemes and a hierarchical packet scheduler to per-class-type queue. We evaluate the proposed scheme with various DiffServ-aware-MPLS networking scenarios. From the simulation results, we can verify that the proposed scheme provides a good fairness to multiple class-types under DiffServ-aware-MPLS traffic engineering.