MobiCom'99

MobiCom'99

4.11 - 1251 ratings - Source

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.


Title:MobiCom'99
Author:Association for Computing Machin
Publisher:Association for Computing Machinery (ACM) - 1999
ISBN-13:

Continue

You Must CONTINUE and create a free account to access unlimited downloads & streaming