There are two quality of service (QoS) constraints that must be satisfied: the maximum end-to-end latency and minimum throughput.
It is essential to provide virtual connections between peering nodes with certain performance guarantees such as minimum throughput, maximum delay or loss.
There is a quality of service (QoS) minimum throughput constraint that must be satisfied for each application in a string, and a maximum utilization constraint that must be satisfied on each of the hardware resources in the system.
Many issues are discussed based on the numerical results, including how the approximations in our design affect the processing time and result of the design, how the change of one STA affects the performance of the other STAs, how the minimum throughput constraints affect the fairness and total throughput, how to select these constraints to satisfy the delay requirements, etc.
This paper presents a novel parallel tabu search (PTS) algorithm equipped with a proper adaptive neighborhood generation mechanism to solve the primal buffer allocation problem, which consists of minimizing the total buffer capacity of a serial production system under a minimum throughput rate constraint.
By selecting the modulation scheme, coding scheme, and packet length of each STA in the network, the design aims to maximize the total throughput of all the STAs and satisfy the minimum throughput requirement or delay requirement of each STA, thus addressing the fairness and delay issues.
The minimum throughput requirement is informed in Mbits/second.
The SOHRS produced the minimum throughput among all the approaches.
C3 represents the minimum throughput constraint which can keep the throughput above the minimum throughput requirement in the network.
Hence, we use the normalized minimum throughput α ~ as a performance metric.
In wireline networks, FFQ and PFQ provide delay bound, minimum throughput, and fairness.
