By Topic

One-to-all wormhole broadcasting in star graph networks using single port communication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Latifi ; Dept. of Electr. Eng., Nevada Univ., Las Vegas, NV, USA ; P. K. Srimani

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

Published in:

Performance, Computing, and Communications Conference, 1997. IPCCC 1997., IEEE International

Date of Conference:

5-7 Feb 1997