Optimal total exchange in anonymous Cayley graphs

Abstract

Total exchange or all-to-all personalized communication problem is that each node in a network has a message to be sent to every other node. To solve this communication problem, we present a time-optimal algorithm in anonymous Cayley graphs as assuming a single-port full duplex model in which every node is able to send and receive at most one message in each time unit. © 2010 Springer-Verlag Berlin Heidelberg.