Return
A Recursive Algorithm for Bandwidth Partitioning
DOI:10.1109/TCOMM.2010.04.090041.png)
Abstract
En 中文
We consider complete partitioning of bandwidth among multiple services. When class bandwidth is an integer multiple of the next lower class and total bandwidth is an integer multiple of the largest class bandwidth, we develop a recursive algorithm that determines the optimal complete partitioning policy with a significantly lower complexity than that of known dynamic programming or mixed integer programming approaches.
Keywords:
Resource management
access control
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
The type of blood used to feed Aedes aegypti females affects their cuticular and internal free fatty acid (FFA) profiles
PLOS ONE
IF0

