Introduction to algorithms
Nonblocking Broadcast Switching Networks
IEEE Transactions on Computers
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Communications of the ACM
Hypercube sandwich approach to conferencing
The Journal of Supercomputing - Special issue on parallel and distributed processing
Efficient Broadcast and Multicast on Multistage Interconnection Networks Using Multiport Encoding
IEEE Transactions on Parallel and Distributed Systems
A rearrangeable algorithm for the construction delay-constrained dynamic multicast trees
IEEE/ACM Transactions on Networking (TON)
A New Self-Routing Multicast Network
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Broadcast Ring Sandwich Networks
IEEE Transactions on Computers
A New Conference Network for Group Communication
IEEE Transactions on Computers
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
IEEE Communications Magazine
Multicast routing algorithms and protocols: a tutorial
IEEE Network: The Magazine of Global Internetworking
Based on MBMS: a general structure design of relay network for cellular system
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Proceedings of the Nineteenth International Workshop on Quality of Service
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
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.