Distributed Approach for Fast Broadcasting and Gathering in Q-ary Cubes
Document Type
Conference Proceeding
Publication Date
3-27-1996
Publication Title
Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications, 1996
Publisher
IEEE
First page number:
406
Last page number:
412
Abstract
An interesting application of coding theory in network routing is presented. Certain error-correcting codes can be employed to specify a minimal subset of nodes called “stations” which are at distance t from the rest of the nodes. The stations, acting as relay agents, can then broadcast data/control information from central controller to all nodes (or conversely from the nodes to central controller) in no more than t steps. The network considered is the q-ary n-dimensional hypercube. The study shows that for a given t, perfect codes yield the minimal set of stations whereas quasi-perfect codes render suboptimal solutions
Disciplines
Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications
Language
English
Permissions
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
Repository Citation
Latifi, S.
(1996).
Distributed Approach for Fast Broadcasting and Gathering in Q-ary Cubes.
Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications, 1996
406-412.
IEEE.