Traffic Engineering Queue Optimization Models with Guaranteed Quality of Service Support

Authors:
Open Access
Publisher website
Google Scholar
Abstract
The article introduces the Guarantee-Based Bandwidth Traffic Engineering Queue (GB(Bw)-TEQ) and Guarantee-Based Utilization Traffic Engineering Queue (GB(U)-TEQ) models for queue management on router interfaces. These models implement the principles of Traffic Engineering Queues and support both DiffServ and IntServ. Their novelty lies in the ability to provide guarantees either for the bandwidth allocated to a class queue or for its utilization coefficient. Such guarantees stabilize and control the average queue length, positively affecting key Quality of Service (QoS) indicators, particularly average delay and packet loss probability. The unreserved portion of the interface bandwidth is allocated among queues in proportion to their classes. Therefore, the higher-priority queues have lower utilization, while lower-priority queues operate with higher utilization, which is consistent with DiffServ principles. The models are formulated as a mixed-integer linear programming problem with an optimality criterion and a system of constraints. Computational experiments confirmed the operability and efficiency of GB(Bw)-TEQ and GB(U)-TEQ compared to the known analogue CB-TEQ model, which does not provide service-level guarantees. The results demonstrate that the proposed models achieve the stated guarantees and enable differentiated service without blocking the lowest-class queues. These solutions can be applied to automate queue management in IP/MPLS switches and routers as well as in software-defined networks.

This publication has 27 references indexed in Scilit: