This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Class of Multistage Conference Switching Networks for Group Communication
March 2004 (vol. 15 no. 3)
pp. 228-243
Jianchao Wang, IEEE Computer Society

Abstract—There is a growing demand for network support for group applications, in which messages from one or more sender(s) are delivered to a large number of receivers. In this paper, we propose a network architecture for supporting a fundamental type of group communication, conferencing. A conference refers to a group of members in a network who communicate with each other within the group. We consider adopting a class of multistage networks, such as a baseline, an omega, or an indirect binary cube network, composed of switch modules with fan-in and fan-out capability for a conference network which supports multiple disjoint conferences. The key issue in designing a conference network is to determine the multiplicity of routing conflicts, which is the maximum number of conflict parties competing a single interstage link when multiple disjoint conferences simultaneously present in the network. Our results in this paper show that, for a network of size n \times n, the multiplicities of routing conflicts are small constants (between 2 and 4) for an omega network or an indirect binary cube network; while it can be as large as {\sqrt{n}\over q}+1 for a baseline network, where q is the minimum allowable conference size. Thus, our design for conference networks is based on an omega network or an indirect binary cube network. We also develop fast self-routing algorithms for setting up routing paths in the newly designed conference networks. As can be seen, such an n \times n conference network has O(\log n) routing time and communication delay and O(n\log n) hardware cost. The conference networks are superior to existing designs in terms of routing complexity, communication delay and hardware cost. The conference network proposed is rearrangeably nonblocking in general, and is strictly nonblocking under some conference service policy. It can be used in applications that require efficient or real-time group communication.

[1] F.K. Hwang and A. Jajszczyk, “On Nonblocking Multiconnection Networks,” IEEE Trans. Comm., vol. 34, pp. 1,038-1,041, 1986.
[2] Y. Yang and G.M. Masson, “Broadcast Ring Sandwich Networks,” IEEE Trans. Computers, vol. 44, no. 10, pp. 1,169-1,180, Oct. 1995.
[3] J.F. Houlahan, L.J. Cowen, and G.M. Masson, Hypercube Sandwich Approach to Conferencing J. Supercomputing, vol. 10, no. 3, pp. 271-283, 1996.
[4] Y. Du and G.M. Masson, Strictly Nonblocking Conference Networks Using High-Dimensional Meshes Networks, vol. 33, no. 4, pp. 293-308, July 1999.
[5] Y. Yang, A New Conference Network for Group Communication Proc. 2001 Int'l Conf. Parallel Processing, pp. 141-148, Sept. 2001.
[6] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Morgan Kaufmann, 2002.
[7] C.K. Wong, M. Gouda, and S.S. Lam, “Secure Group Communications Using Key Graphs,” IEEE/ACM Trans. Networking, vol. 8, no. 1, pp. 16-30, Feb. 2000.
[8] M. Baldi, Y. Ofek, and B. Yener, “Adaptive Group Multicast with Time-Driven Priority,” IEEE/ACM Trans. Networking, vol. 8, no. 1, pp. 31-43, Feb. 2000.
[9] S. Mishra, L. Fei, X. Lin, and G. Xing, On Group Communication Support in CORBA IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 193-208, Feb. 2001.
[10] A. Gopal, I. Gopal, and S. Kutten, “Fast Broadcast in High-Speed Networks,” IEEE/ACM Trans. Networking, vol 7, no. 2, pp. 262-275, Apr. 1999.
[11] Y. Yang and J. Wang, “Optimal All-to-All Personalized Exchange in Self-Routable Multistage Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 3, pp. 261-274, Mar. 2000.
[12] Y.J. Suh and K.G. Shin, “All-to-All Personalized Communication in Multidimensional Torus and Mesh Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 1, pp. 38-59, Jan. 2001.
[13] S.-Y. Wang and Y.-C. Tseng, “Algebraic Foundations and Broadcasting Algorithms for Wormhole-Routed All-Port Tori,” IEEE Trans. Computers, vol. 49, no. 3, pp. 246-258, Mar. 2000.
[14] R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, “Tree-Based Multicasting in Wormhole-Routed Irregular Topologies,” Proc. Merged 12th Int'l Parallel Processing Symp. and the Ninth Symp. Parallel and Distributed Processing, pp. 244-249, Apr. 1998.
[15] D.R. Kumar, W.A. Najjar, and P.K. Srimani, “A New Adaptive Hardware Tree-Based Multicast Routing inK-AryN-Cubes,” IEEE Trans. Computers, vol. 50, no. 7, pp. 647-659, July 2001.
[16] Y. Yang and J. Wang, “A New Self-Routing Multicast Network,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 12, pp. 1299-1316, Dec. 1999.
[17] E.W. Zegura, M.H. Ammar, Z. Fei, and S. Bhattacharjee, Application-Layer Anycasting IEEE/ACM Trans. Networking, vol. 8, no. 4, pp. 455-466, Aug. 2000.
[18] D. Xuan, W. Jia, W. Zhao, and H. Zhu, A Routing Protocol for Anycast Messages IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 6, pp. 571-587, June 2000.
[19] C.-L. Wu and T.-Y. Feng, On a Class of Multistage Interconnection Networks IEEE Trans. Computers, vol. 29, no. 8, pp. 694-702, Aug. 1980.
[20] C.P. Kruskal and M. Snir, A Unified Theory of Interconnection Network Structure Theoretical Computer Science, vol. 48, pp. 75-94, 1986.
[21] D.P. Agrawal, Graph Theoretic Analysis and Design of Multistage Interconnection Networks IEEE Trans. Computers, vol. 32, no. 7, pp. 637-648, July 1983.
[22] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.

Index Terms:
Conferencing, switching, conference networks, group communication, many-to-many connections, multistage interconnection networks, self-routing.
Citation:
Yuanyuan Yang, Jianchao Wang, "A Class of Multistage Conference Switching Networks for Group Communication," IEEE Transactions on Parallel and Distributed Systems, vol. 15, no. 3, pp. 228-243, March 2004, doi:10.1109/TPDS.2004.1264808
Usage of this product signifies your acceptance of the Terms of Use.