By Topic

Broadcasting and multicasting in cut-through routed networks

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
$31 $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

4 Author(s)
Cohen, J. ; Ecole Normale Superieure de Lyon, France ; Fraigniaud, P. ; Konig, J.-C. ; Raspaud, A.

This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. In this paper, we study these problems under both line model, and cut-through model. The former assumes long distance calls between non neighboring processors. The latter completes the line model by taking into account the use of a routing function. It is known that one can find time optimal broadcast and multicast protocols in the line model in polynomial time. We present a new time optimal broadcasting and multicasting algorithm in the line model. This algorithm efficiently uses the bandwidth of the network. Moreover, it also applies to the cut-through model as soon as the routing function generates shortest paths only

Published in:

Parallel Processing Symposium, 1997. Proceedings., 11th International

Date of Conference:

1-5 Apr 1997