Optimal Total Exchange in Anonymous Cayley Graphs

Date Added: Sep 2010
Format: PDF

Total exchange wherein each node in a network sends a message to every other node has been studied in Cayley graphs. To effectively discover an optimal solution in its graphs, one algorithm has also been proposed. This algorithm supposes that each unique identity of nodes in the network be the same as the elements of the group generated by the graph. 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, the authors present a time-optima 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.