Impli mi ntation Complexity: The time complexity for STFQ to sort the service tags (as in WFQ) is O(nlogn) for n flows. ... Thus, short term fairness is not provided and the worst case delay bounds are coarse. ... Thus, all the bounds supported by SBFA are only with respect to the remaining fraction of the channel bandwidth.
|Author||:||Association for Computing Machin|
|Publisher||:||Association for Computing Machinery (ACM) - 1999|