Title :
One-to-all wormhole broadcasting in star graph networks using single port communication
Author :
Latifi, Shahram ; Srimani, Pradip K.
Author_Institution :
Dept. of Electr. Eng., Nevada Univ., Las Vegas, NV, USA
Abstract :
The problem of broadcasting in an n-dimensional star graph with wormhole routing is studied. We have used the regular single-port communication model with intermediate node reception capability. The lower bound under the model is derived and efficient algorithms are developed to achieve broadcasting in O(n) communication time which is sub logarithmic in the number of nodes in the network
Keywords :
broadcasting; communication complexity; graph theory; network topology; telecommunication channels; telecommunication network routing; algorithms; communication complexity; communication time; intermediate node reception; lower bound; network nodes; one to all wormhole broadcasting; regular single-port communication model; single port communication; star graph networks; wormhole routing; Broadcasting; Communication system control; Computer science; Delay effects; Hypercubes; Intelligent networks; Routing; System recovery; Tin; Topology;
Conference_Titel :
Performance, Computing, and Communications Conference, 1997. IPCCC 1997., IEEE International
Conference_Location :
Phoenix, Tempe, AZ
Print_ISBN :
0-7803-3873-1
DOI :
10.1109/PCCC.1997.581550
