In this paper, we propose a method which enables us to construct almost optimal broadcast schemes on an n-dimensional hypercube in the circuit switched, -port
model. In this model, an initiator must inform all the nodes of the network in a sequence of rounds. During a round, vertices communicate along arc-disjoint dipaths. Our construction is based on particular sequences of nested binary codes having the property that each code can inform the next one in a single round. This last property is insured by a flow technique and results about symmetric flow networks.We apply the method to design new schemes improving and generalizing the previous results. Our schemes are the best possible algebraic schemes, and they are optimal in the case n = 2 p , 1.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.