A general broadcasting scheme for recursive networks with complete connection

A recursive network is said to be with complete connection if its subnetwor ks are connected as a complete graph. In this paper, a general broadcasting scheme is proposed for recursive networks with complete connection. The sc heme is simple, efficient, and easy to be implemented. Besides, there is no redundant message generated. Broadcasting algorithms for the hypercomplete , hypernet, WK recursive, and star networks can result from this scheme. No broadcasting algorithm for the hypernet networks was proposed before. (C) 2001 Elsevier Science B.V. All rights reserved.