The Probability of Load Balancing Success in a Homogeneous Network
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
IN THIS PAPER, WE STUDY THE PERFORMANCE CHARACTERISTICS OF SIMPLE LOAD SHARING ALGORITHMS FOR DISTRIBUTED SYSTEMS. IN THE SYSTEM UNDER CONSIDERA- TION, IT IS ASSUMED THAT NON-ELIGIBLE DELAYS ARE ENCOUNTERED IN TRANSFER- RING TASKS FROM ONE NODE TO ANOTHER AND IN GATHERING REMOTE STATE INFORMA- TION. BECAUSE OF THESE DELAYS, THE STATE INFORMATION GATHERED BY THE LOAD SHARING ALGORITHMS IS OUT OF DATE BY THE TIME THE LOAD SHARING DECISIONS ARE TAKEN. THIS PAPER ANALYZES THE EFFECTS OF THESE DELAYS ON THE PERFORM- ANCE OF THREE ALGORITHMS THAT WE CALL FORWARD, REVERSE AND SYMMETRIC. WE FORMULATE QUEUEING THEORETIC MODELS FOR EACH OF THE ALGORITHMS OPERATING IN A HOMOGENEOUS SYSTEM UNDER THE ASSUMPTION THAT THE TASK ARRIVAL PROCESS AT EACH NODE IS POISSON AND THE SERVICE TIMES AND TASK TRANSFER TIMES ARE EXPONENTIALLY DISTRIBUTED. EACH OF THE MODELS IS SOLVED USING THE MATRIX- GEOMETRIC SOLUTION TECHNIQUE AND THE IMPORTANT PERFORMANCE METRICS ARE DERIVED AND STUDIED.