Multicast routing in internetworks and extended LANs
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
The MASC/BGMP architecture for inter-domain multicast routing
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
IP multicast channels: EXPRESS support for large-scale single-source applications
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Router level filtering for receiver interest delivery
COMM '00 Proceedings of NGC 2000 on Networked group communication
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Sender access and data distribution control for inter-domain multicast groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
PIMac: Multicast Access Control Implementation in PIM-SM
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is important to support sender access control in order to prevent group members from receiving irrelevant data, and also to protect the multicast tree from denial-of-service (DoS) attacks. Compared with source specific and uni-directional shared trees, where information sources can be authorized or authenticated at the single root or rendezvous point (RP), in bi-directional trees this problem is more pronounced since hosts can send data to the shared tree from any point in the network. In this paper we propose a scalable sender access control policy mechanism for bi-directional shared trees so that irrelevant data is policed and discarded once it arrives at an on-tree router. We consider both intra- and inter-domain routing, so that the mechanism can cope with large-scale multicast applications or many concurrent multicast sessions across multiple administrative domains.