We present an attention-based ring processor for
distributed message handling. Messages (queries) and nodes
(keys/values) live in an embedding space; dispatch chooses targets
via attention weights over a ring topology with optional smallworld shortcuts. We quantify latency, hop count, throughput,
embedding alignment, and resilience under node failure.
Our Sponser:
