• DocumentCode
    1454879
  • Title

    A recursive algorithm for bandwidth partitioning

  • Author

    Jordan, Scott ; Charrington, Sam ; Apivatanagul, Pruttipong

  • Author_Institution
    Dept. of Comput. Sci., Univ. of California, Irvine, CA, USA
  • Volume
    58
  • Issue
    4
  • fYear
    2010
  • fDate
    4/1/2010 12:00:00 AM
  • Firstpage
    1026
  • Lastpage
    1030
  • Abstract
    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
    bandwidth allocation; computational complexity; bandwidth partitioning; complexity; dynamic programming; mixed integer programming; optimal complete partitioning policy; recursive algorithm; Access control; Bandwidth; Circuits; Dynamic programming; Helium; Linear programming; Partitioning algorithms; Resource management; Scheduling algorithm; Virtual private networks; Resource management; access control;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2010.04.090041
  • Filename
    5439304
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1454879