An adaptable and distributed load adjustment algorithm

  • Authors:
  • Shmuel Rotenstreich

  • Affiliations:
  • Dept. of EE&CS, The George Washington University, Washington, D.C.

  • Venue:
  • CSC '88 Proceedings of the 1988 ACM sixteenth annual conference on Computer science
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

Load adjusting in a distributed system enables a distributed service path to perform its task without getting overloaded. This is achieved by accepting into the path only the amount of messages the path can serve within the acceptable bounds. A distributed algorithm is proposed to take care of this problem. The algorithm which has two distributed parts is shown to perform well under reasonable conditions, and even under a multitude of faults it still performs better than the original system. A major problem faced by the algorithm is the prediction of the system's behavior in the uncertain interval between the entrance of the messages into the system and their exit. To this end, several techniques are used and the comparison among them is done by simulation.