Design of an efficient load balancing algorithm on distributed networks by employing symmetric balanced incomplete block design

Access Full Text

Design of an efficient load balancing algorithm on distributed networks by employing symmetric balanced incomplete block design

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

To maintain load balancing in a distributed system, it is necessary to obtain workload information from all the nodes in the network. This processing requires O(v2) communication complexity, where v is the number of nodes. The authors present a new synchronous dynamic distributed load balancing algorithm on a (v, k+1, 1)-configured network applying a symmetric balanced incomplete block design, where v=k2+k+1. The algorithm needs only O (v√v) communication complexity and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.

Inspec keywords: telecommunication traffic; distributed algorithms; telecommunication network topology; communication complexity; resource allocation

Other keywords: network configuration; traffic amount; communication complexity; synchronous dynamic distributed load balancing algorithm; distributed network; workload information; symmetric balanced incomplete block design

Subjects: Communication network design, planning and routing; Computational complexity; Distributed systems software

References

    1. 1)
      • C.L. Liu . (1968) Block designs in introduction to combinatorial mathematics.
    2. 2)
      • S. Das , D. Harvey , R. Biswas . Parallel processing of adaptive meshes with load balancing. IEEE Trans. Parallel Distrib. Syst. , 12
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
      • S. Das , D. Harvey , R. Biswas . Adaptive load-balancing algorithms using symmetric broadcast networks. J. Parallel Distrib. Comput. , 6 , 1042 - 1068
    8. 8)
      • B.A. Shirazi . (1995) Scheduling and load balancing in parallel and distributed systems.
    9. 9)
      • C. Hui , S. Chanson . Hydrodynamic load balancing. IEEE Trans. Parallel Distrib. Syst. , 11 , 1118 - 1137
    10. 10)
      • L.R. Ford , D.R. Fulkerson . (1962) Flow in networks.
    11. 11)
      • H. Rim , J. Jang , S. Kim . Method for maximal utilization of idle links for fast load balancing. J. KISS, Comput. Syst. Theory , 12 , 632 - 641
    12. 12)
      • Padlipsky, M.: `A perspective on the ARPANET reference model', Proc. IEEE INFOCOM, 1983.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_20040704
Loading

Related content

content/journals/10.1049/ip-com_20040704
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading