Round-robin distribution · adding a node reflected automatically

requests spread across nodes A and B (request 3 back to A) · new node C reflected automatically via a store row

Round-robin distribution · adding a node reflected automatically requests spread across nodes A and B (request 3 back to A) · new node C reflected automatically via a store row calling node · channel client · Architecture component calling node channel client processing node A · :5600 · Architecture component processing node A :5600 processing node B · :5601 · Architecture component processing node B :5601 processing node C · :5602 · Architecture component processing node C :5602 request 1 request 3 (A again) request 2 node added → store row auto

Round-robin and automatic reflection

  • • When connected servers have equal weight, new requests are distributed evenly by round-robin — request 1 → A, request 2 → B, request 3 → A again.
  • • Adding a new node C (:5602) is reflected automatically as a descriptor row in the location store, so it joins the candidates without restarting the caller (dashed).