Algebraic constructions of efficient broadcast networks

Details Algebraic constructions of efficient broadcast networks Algebraic constructions of efficient broadcast networks

1995-04-12

arxiv.org/abs/math/9504212v1

Mathematics

Combinatorics

7 pages

Scientific paper

Cayley graph techniques are introduced for the problem of constructing networks having the maximum possible number of nodes, among networks that satisfy prescribed bounds on the parameters maximum node degree and broadcast diameter. The broadcast diameter of a network is the maximum time required for a message originating at a node of the network to be relayed to all other nodes, under the restriction that in a single time step any node can communicate with only one neighboring node. For many parameter values these algebraic methods yield the largest known constructions, improving on previous graph-theoretic approaches. It has previously been shown that hypercubes are optimal for degree $k$ and broadcast diameter $k$. A construction employing dihedral groups is shown to be optimal for degree $k$ and broadcast diameter $k+1$.

Affiliated with

Also associated with

No associations

Rating

Algebraic constructions of efficient broadcast networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic constructions of efficient broadcast networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic constructions of efficient broadcast networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363578