This information comes from COOR as part of the client definition and is transmitted as commands during the client configuration phase. The start point for any changes to the configuration is, of course, the current configuration. Each node is assigned a list of clients and also a class. The figure to the right shows the generic flow chart of the algorithm. Note that the constraints implied by the above inputs are kept in mind as this algorithm executes.
Initial room is found for the new clients.
This means the minimum number of nodes for each client of a particular class is satisfied. Once the initial assignments are made, then the super tries to balance the node assignments out. At this point, a final configuration would be complete. The supervisor would then set about making the current state look like the final state by issuing commands to change the node's mode, etc. If a node no longer contains any clients, then it is marked as free, which means the supervisor will give it preferential treatment when trying to assign nodes in the next step.