• DocumentCode
    2344508
  • Title

    Heart-like fair queuing algorithms (HLFQA)

  • Author

    Dragos, Radu ; Collier, Martin

  • Author_Institution
    Sch. of Electron. Eng., Dublin City Univ.
  • fYear
    0
  • fDate
    0-0 0
  • Firstpage
    203
  • Lastpage
    208
  • Abstract
    We propose a new family of fair, work conserving traffic scheduling mechanisms that imitate the behavior of the human heart in the cardiovascular system. The algorithms have MAX (where MAX is the maximum packet size) fairness and O(log N) complexity and thus compare favorably with existing algorithms. The algorithms are simple enough to be implemented in hardware
  • Keywords
    computational complexity; packet switching; queueing theory; scheduling; telecommunication traffic; MAX fairness; O(log N) complexity; cardiovascular system; heart-like fair queuing algorithms; human heart; maximum packet size fairness; traffic scheduling mechanisms; Bandwidth; Humans; Multiprotocol label switching; Protocols; Round robin; Scheduling algorithm; Switches; Telecommunication traffic; Traffic control; Web and internet services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Networks, 2006 International Symposium on
  • Conference_Location
    Istanbul
  • Print_ISBN
    1-4244-0491-6
  • Type

    conf

  • DOI
    10.1109/ISCN.2006.1662534
  • Filename
    1662534
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2344508