• DocumentCode
    2311552
  • Title

    Scheduling Algorithm of Load Balancing Based on Dynamic Policies

  • Author

    Chang, Jie ; Zhou, Wen An ; Song, Junde ; Lin, Zhiqi

  • Author_Institution
    Beijing Univ. of Posts & Telecommun., Beijing, China
  • fYear
    2010
  • fDate
    7-13 March 2010
  • Firstpage
    363
  • Lastpage
    367
  • Abstract
    Load balancing is a method to strengthen the network data processing capability, increase the flexibility and availability of the network. Using multiple components with load balancing, instead of a single component, to provide external services can solve the problem of insufficient processing capacity of a single host, and can also solve the challenges posed by concurrent access. Because of the importance of load balancing scheduling, which is the key issue, this article will propose a scheduling algorithm based on dynamic policy. This algorithm retains the advantages of the current widely used polling scheduling, on the other hand, it avoids some shortages of the polling scheduling algorithm by using dynamic policy framework.
  • Keywords
    data handling; resource allocation; scheduling; dynamic policy framework; load balancing; network data processing; polling scheduling; Application software; Availability; Computer networks; Costs; Data processing; Dynamic scheduling; Load management; Scheduling algorithm; Single machine scheduling; Telecommunication traffic; dynamic policy framework; dynamic policy scheduling algorithm; load balancing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Networking and Services (ICNS), 2010 Sixth International Conference on
  • Conference_Location
    Cancun
  • Print_ISBN
    978-1-4244-5927-8
  • Type

    conf

  • DOI
    10.1109/ICNS.2010.57
  • Filename
    5460621