Bit complexity of breaking and achieving symmetry in chains and rings

We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed but have distinct id...