TY - GEN
T1 - A service-centric multicast architecture and routing protocol
AU - Yang, Yuanyuan
AU - Wang, Jianchao
AU - Yang, Min
PY - 2006
Y1 - 2006
N2 - In this paper, we present a new multicast architecture and the associated multicast routing protocol for providing efficient and flexible multicast services over the Internet. Traditional multicast architectures construct and update the multicast tree In a distributed manner, which causes 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 the complete Information, broadcast Is often used when transmitting control packets or 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, m-routers handle most of multicast related tasks, while other routers only need to perform minimum functions for routing, m-routers are designed to be able to handle simultaneous many-to-many communications efficiently. The new multicast routing protocol, called Service Centric Multicast Protocol (SCMP), builds a dynamic shared multicast tree rooted at the m-router for each group. The multicast tree can satisfy the QoS constraint on maximum end-to-end delay and minimize tree cost as well. The tree construction Is performed by a special type of self-routing packets to minimize 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.
AB - In this paper, we present a new multicast architecture and the associated multicast routing protocol for providing efficient and flexible multicast services over the Internet. Traditional multicast architectures construct and update the multicast tree In a distributed manner, which causes 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 the complete Information, broadcast Is often used when transmitting control packets or 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, m-routers handle most of multicast related tasks, while other routers only need to perform minimum functions for routing, m-routers are designed to be able to handle simultaneous many-to-many communications efficiently. The new multicast routing protocol, called Service Centric Multicast Protocol (SCMP), builds a dynamic shared multicast tree rooted at the m-router for each group. The multicast tree can satisfy the QoS constraint on maximum end-to-end delay and minimize tree cost as well. The tree construction Is performed by a special type of self-routing packets to minimize 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.
UR - https://www.scopus.com/pages/publications/34547440820
U2 - 10.1109/ICPP.2006.13
DO - 10.1109/ICPP.2006.13
M3 - Conference contribution
SN - 0769526365
SN - 9780769526362
T3 - Proceedings of the International Conference on Parallel Processing
SP - 425
EP - 432
BT - ICPP 2006
T2 - ICPP 2006: 2006 International Conference on Parallel Processing
Y2 - 14 August 2006 through 18 August 2006
ER -