This Article 
 Bibliographic References 
 Add to: 
Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks
August 1998 (vol. 9 no. 8)
pp. 788-802

Abstract—This paper addresses the one-to-all broadcasting problem and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Broadcasting is the information dissemination problem in which a node of a network sends the same piece of information to all the other nodes. Multicasting is a partial broadcasting in the sense that only a subset of nodes forms the destination set. Both operations have many applications in parallel and distributed computing. In this paper, we study these problems in both line model, and cut-through model. The former assumes long distance calls between nonneighboring processors. The latter strengthens the line model by taking into account the use of a routing function. Long distance calls are possible in circuit-switched and wormhole-routed networks, and also in many networks supporting optical facilities.

In the line model, it is well known that one can compute in polynomial time a $\left\lceil {\log_2n} \right\rceil$-round broadcast or multicast protocol for any arbitrary network. Unfortunately, such a protocol is often inefficient from a practical point of view because it does not use the resources of the network in a balanced way. In this paper, we present a new algorithm to compute broadcast or multicast protocols. This algorithm applies under both line and cut-through models. Moreover, it returns protocols that efficiently use the bandwidth of the network. From a complexity point of view, we also show that most of the optimization problems relative to the maximization of the efficiency of broadcast or multicast protocols in terms of switching time or vertex load are NP-complete. We have, however, derived polynomial efficient solutions for tree-networks.

[1] J.-C. Bermond, L. Gargano, S. Perennes, A. Rescigno, and U. Vaccaro, "Efficient Collective Communication in Optical Networks," Technical Report 95-65, I3S, Sophia-Antipolis, France, 1995.
[2] J. Edmonds, "Maximum Matching and a Polyhedron With 0,1-Vertices," J. Research Nat'l Bureau of Standards-B, vol. 69B, pp. 125-130, 1965.
[3] A. Farley, "Minimum-Time Line Broadcast Networks," Networks, vol. 10, pp. 59-70, 1980.
[4] R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, and P. Mysliwietz, "Optimal Algorithms for Dissemination of Information in Generalized Communication Modes," Discrete Applied Mathematics, vol. 53, nos. 1-3, pp. 55-78, 1994.
[5] E. Fleury and P. Fraigniaud, "Strategies for Multicasting in Meshes," Proc. 23rd Int'l Conf. Parallel Processing (ICPP'94), 1994.
[6] E. Fleury and P. Fraigniaud, "Analysis of Deadlock-Free Path-Based Wormhole Multicasting in Meshes in Case of Contentions," Proc. Sixth Symp. Frontiers of Massively Parallel Computing (Frontiers '96),Annapolis, Md., Oct. 1996.
[7] Message Passing Interface Forum, "MPI: A Message-Passing Interface Standard," Technical Report CS-93-214, Univ. of Tennessee, Apr. 1994.
[8] P. Fraigniaud, "Broadcasting in Trees," Research Report 95-26, Laboratoire de l'Informatique du Parallélisme, ENS-Lyon, France, 1995.
[9] P. Fraigniaud and J. Peters, "Structured Communication in Torus Networks," Proc. 28th Ann. Hawaii Int'l Conf. System Sciences, pp. 584-593, 1995.
[10] W. Gropp, E. Lusk, and A. Skjellum, Using MPI: Portable Parallel Programming with the Message Passing Interface. MIT Press, 1994.
[11] S.M. Hedetniemi, S.T. Hedetniemi, and A. Liestman, "A Survey of Gossiping and Broadcasting in Communication Networks," Networks, vol. 18, pp. 319-349, 1986.
[12] C.-T. Ho and M.-Y. Kao, "Optimal Broadcast in All-Port Wormhole-Routed Hypercubes," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 2, pp. 200-318, Feb. 1995.
[13] J. Hromkovic, R. Klasing, and E. Stohr, "Dissemination of Information in Vertex-Disjoint Paths Mode," Computer and Artificial Intelligence, vol. 15, no. 4, pp. 295-318, 1996.
[14] J. Hromkovic, R. Klasing, E. Stohr, and H. Wagener, " Gossiping in Vertex-Disjoint Paths Mode in d-Dimensional Grids and Planar Graphs," Information and Computation, vol. 123, no. 1, pp. 17-28, 1995.
[15] J. Hromkovic, R. Klasing, W. Unger, and H. Wagerer, "Optimal Algorithm for Broadcast and Gossip in the Edge-Disjoint Path Mode," Proc. Fourth Scandinavian Workshop Algorithm Theory (SWAT'94), pp. 219-230, 1994.
[16] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133-172, 1987.
[17] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[18] J.O. Kane and J. Peters, "Line Broadcasting in Cycles," Discrete Applied Mathematics, to appear.
[19] G. Kortsarz and D. Peleg, "Approximation Algorithms for Minimum Time Broadcast," Proc. 1992 Israel Symp. Theory of Computer Science, 1992.
[20] C. Laforest, "Broadcast and Gossip in Line-Communication Mode," Technical Report 1005, Laboratoire de Recherche en Informatique, Univ. Paris-Sud, Orsay, France, 1995.
[21] C. Laforest, "Gossip in Trees Under Line-Communication Mode," Proc. Euro-Par'96, L. Bougé, A. Mignotte, and Y. Robert, eds., pp. 333-340. Springer Verlag, 1996.
[22] Y. Lan, A.-H. Esfahanian, and L.M. Ni, "Multicast in Hypercube Multiprocessors," J. Parallel and Distributed Computing, vol. 8, pp. 30-41, Jan. 1990.
[23] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[24] X. Lin and L.M. Ni, "Multicast Communication in Multicomputer Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 10, pp. 1,104-1,117, 1993.
[25] M. Ajmone Marshan, A. Bianco, E. Leonardi, and F. Neri, “Topologies for Wavelength-Routing All-Optical Networks,” IEEE/ACM Trans. Networking, vol. 1, pp. 534-546, Oct. 1993.
[26] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.
[27] J. Peters and M. Syska, "Circuit-Switched Broadcasting in Torus Networks," IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 3, pp. 246-255, 1996.
[28] Y. Saad and M.H. Schultz, "Data Communication in Hypercubes," J. Parallel and Distributed Computing, vol. 6, pp. 115-135, 1989.
[29] Y. Saad and M.H. Schultz, "Data Communication in Parallel Architectures," Parallel Computing, vol. 11, pp. 131-150, 1989.
[30] P. Slater, E. Cockayne, and S. Hedetniemi, "Information Dissemination in Trees," SIAM J. Computing, vol. 10, no. 4, pp. 692-701, 1981.
[31] P. Winter, "Steiner Problem in Networks: A Survey," IEEE Networks, vol. 17, no. 2, pp. 129-167, 1987.
[32] H. Xu, P. McKinely, and L. Ni, "Efficient Implementation of Barrier Synchronization in Wormhole-Routed Hypercube Multicomputers," J. Parallel and Distributed Computing, vol. 16, pp. 172-184, 1992.

Index Terms:
Broadcasting, multicasting, wormhole, circuit-switched networks.
Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud, "Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 8, pp. 788-802, Aug. 1998, doi:10.1109/71.706050
Usage of this product signifies your acceptance of the Terms of Use.