The performance of distributed systems is partially dependent on system configuration parameters like session time (how long the conversational state with one node is maintained across multiple requests), maximum number of connected nodes (size of neighbourhoods), cache pool size (for storing temporary variables) and data store size.
Heuristics on a node's neighbourhood can possibly be used for autotuning. A heuristic function that will rank all the possible alternatives for a better tuned configuration based on the available information. It helps the algorithm to select the best route out of possible routes to find a better configuration (if exists). Each agent then has its own agent attributes to propagate to its neighbours.