In classical broadcast models, information is disseminated in synchronous rounds under the constant communication time model, where a node informs only one neighbour per time unit – also known as the processor-bound model. These models assume either a leader coordinates actions or each node has a set of coordinated actions (or can compute them) optimized for each originator. In the latter case, nodes must have enough storage, processing power, and the ability to determine the originator. This assumption is not always ideal, and a broadcast model based on local knowledge can be more practical. Messy models address this by removing the leader, starting time knowledge, and originator information, leaving each node with only local knowledge. A new class of graphs, Hyper-cylinders, inspired by broadcast behaviour and the common use of Torus, Grid, and Hypercube structures, is introduced. This paper explores the broadcast time and optimum schemes for Hyper-cylinders under Messy models, deriving known theorems, including those for directed Torus and undirected Hypercube, as corollaries. Additionally, it provides corollary results for subtypes like Grid and Spider Web Graphs.
Read full abstract