The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2008 vol.19)
pp: 35-51
ABSTRACT
In this paper, we present a new multicast architecture and the corresponding multicast routing protocol for providing efficient and flexible multicast services over the Internet. Traditional multicast protocols construct and update the multicast tree in a distributed manner, which may cause two problems: first, since each node has only local or partial information on the network topology and group membership, it is difficult to build an efficient multicast tree; second, due to lack of complete information, broadcast is often used for sending control packets and data packets, which consumes a great deal of network bandwidth. In the newly proposed multicast architecture, a few powerful routers, called m-routers, collect multicast-related information and process multicast requests based on the information collected. The m-routers handle most of multicast related tasks, while other routers in the network only need to perform minimum functions for routing. The m-routers are designed to be able to handle simultaneous many-to-many communications efficiently. The new multicast routing protocol, called the Service Centric Multicast Protocol (SCMP), builds a shared multicast tree rooted at the m-router for each group. The multicast tree is computed in the m-router by employing the Delay Constrained Dynamic Multicast (DCDM) algorithm which dynamically builds a delay constrained multicast tree and minimizes the tree cost as well. The physical construction of the multicast tree over the Internet is performed by a special type of self-routing packets in order to minimize the protocol overhead. Our simulation results on NS-2 demonstrate that the new SCMP protocol outperforms other existing protocols and is a promising alternative for providing efficient and flexible multicast services over the Internet.
INDEX TERMS
Multicast, network architecture, routers, routing protocols, multicast routing protocols, servicecentric, many-to-many communications
CITATION
Yuanyuan Yang, Jianchao Wang, Min Yang, "A Service-Centric Multicast Architecture and Routing Protocol", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 1, pp. 35-51, January 2008, doi:10.1109/TPDS.2007.70711
REFERENCES
[1] L.H. Sahasrabuddhe and B. Mukherjee, “Multicast Routing Algorithms and Protocols: A Tutorial,” IEEE Network, vol. 14, pp. 90-102, Jan.-Feb. 2000.
[2] P. Paul and S.V. Raghavan, “Survey of Multicast Routing Algorithms and Protocols,” Proc. 15th IEEE Int'l Conf. Computer Comm. (ICC '02), Aug. 2002.
[3] M. Bishop, R. Sanjay, and K. Sripanidkulchai, “Considering Priority in Overlay Multicast Protocols under Heterogeneous Environments,” Proc. IEEE INFOCOM '06, Apr. 2006.
[4] J. Ni and D.H.K. Tsang, “Large-Scale Cooperative Caching and Application-Level Multicast in Multimedia Content Delivery Networks,” IEEE Comm. Magazine, vol. 43, no. 5, May 2005.
[5] T. Ballardie, P. Francis, and J. Crowcroft, “Core Based Trees (CBT): An Architecture for Scalable Inter-Domain Multicast Routing,” Proc. ACM SIGCOMM '93, pp. 85-95, Oct. 1993.
[6] Internet Group Management Protocol Version 2 (IGMPv2), Internet draft, work in progress, 1996.
[7] D. Waitzman and C. Partridge, Distance Vector Multicast Routing Protocol, RFC 1075, Nov. 1988.
[8] J. Moy Multicast Extension to OSPF, Internet draft, work in progress, 1998.
[9] J. Moy, OSPF Version 2, RFC 2328, 1998.
[10] A. Ballardie, B. Cain, and Z. Zhang Core Based Trees (CBT Version 3) Multicast Routing, Internet draft, work in progress, 1998.
[11] S. Deering et al., , Protocol Independent Multicast-Sparse Mode (PIM-SM): Motivation and Architecture, Internet draft, work in progress, 1998.
[12] R. Perlman et al., Simple Multicast: A Design for Simple, Low-Overhead Multicast, Internet draft, work in progress, 1999.
[13] A. Adams, J. Nicholas, and W. Siadak, Protocol Independent Multicast—Dense Mode (PIM-DM): Protocol Specification, draft-ietf-pim-dm-new-v2-05.txt, June 2004.
[14] H. Eriksson, “The Multicast Backbone,” Comm. ACM, vol. 37, no. 8, pp. 54-60, Aug. 1994.
[15] Y. Yang, and G.M. Masson, “Nonblocking Broadcast Switching Networks,” IEEE Trans. Computers, vol. 40, no. 9, pp. 1005-1015, Sept. 1991.
[16] R. Sivaram, D.K. Panda, and C.B. Stunkel, “Efficient Broadcast and Multicast on Multistage Interconnection Networks Using Multiport Encoding,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 10, pp. 1004-1028, Oct. 1998.
[17] C. Lee and A.Y. Oruç, “Design of Efficient and Easily Routable Generalized Connectors,” IEEE Trans. Comm., vol. 43, nos. 2-4, pp.646-650, 1995.
[18] 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.
[19] Y. Yang and G.M. Masson, “Broadcast Ring Sandwich Networks,” IEEE Trans. Computers, vol. 44, no. 10, pp. 1169-1180, Oct. 1995.
[20] 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.
[21] Y. Du and G.M. Masson, “Strictly Nonblocking Conference Networks Using High-Dimensional Meshes,” Networks, vol. 33, no. 4, pp. 293-308, July 1999.
[22] Y. Yang, “A New Conference Network for Group Communication,” IEEE Trans. Computers, vol. 51, no. 9, pp. 995-1010, 2002.
[23] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach. Morgan Kaufmann, 2002.
[24] E. Aharoni and R. Cohen, “Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks,” Proc. IEEE INFOCOM '97, Apr. 1997.
[25] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
[26] http://www.cc.gatech.edu/projectsgtitm/, 2007.
[27] NP3400, MMC Networks, Inc., http:/www.mmcnet.com/, 2000.
[28] C-Port Network Processors, Motorola Inc., http:/e-www. motorola.com, 2002.
[29] B. Waxman, “Routing of Multipoint Connections,” IEEE J. Selected Areas in Comm., pp. 1617-1622, Dec. 1988.
[30] M. Imase and B.M. Waxman, “Dynamic Steiner Tree Problem,” SIAM J. Discrete Math., vol. 4, no. 3, pp. 369-384, 1991.
[31] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press, 1990.
[32] L. Kou, G. Markowsky, and L. Berman, “A Fast Algorithm for Steiner Trees,” Acta Informatica, vol. 15, pp. 141-145, 1981.
[33] V.P. Kompella, J.C. Pasquale, and G.C. Polyzos, “Multicast Routing for Multimedia Communication,” IEEE/ACM Trans. Networking, pp. 286-292, June 1993.
[34] R. Sriram, G. Manimaran, and C. Murthy, “A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees,” IEEE/ACM Trans. Networking, vol. 7, no. 4, pp.514-529, Aug. 1999.
[35] M. Yang and Y. Yang, “Constructing Minimum Cost Dynamic Multicast Trees under Delay Constraint,” Proc. 14th Int'l Conf. Computer Comm. and Networks (IC3N '05), pp. 133-138, Oct. 2005.
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool