Optimal gossiping protocol in the Gaussian and Eisenstein-Jacobi networks.
by Pongphat Taptagaporn
Abstract: The Gaussian and Eisenstein-Jacobi (EJ for short) networks are graphs induced by the Gaussian and EJ integers respectively. We look at communication
protocols in these graphs, and here we focus on gossiping; where every
vertices send a distinct message to all the other vertices in the graph.
We will find the exact values of the gossip time and show that they are optimal under the store-and-forward, all-port and full-duplex model for
gossiping. We will also look at the edge and arc-forwarding indices in
Studies of these graphs were previously motivated by coding theory as they were known to generate "perfect" codes. More recently we have found that these graphs exhibit close connections to first-kind Frobenius graphs,
circulant graphs and tori.
For More Information: contact: David Wood. email: firstname.lastname@example.org