IP-based protocols for mobile internetworking
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Multicast routing extensions for OSPF
Communications of the ACM
MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
A new multicasting-based architecture for Internet host mobility
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
Cellular IP: a new approach to Internet host mobility
ACM SIGCOMM Computer Communication Review
Exploiting Reality with Multicast Groups
IEEE Computer Graphics and Applications
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
HAWAII: a domain-based approach for supporting mobility in wide-area wireless networks
IEEE/ACM Transactions on Networking (TON)
Core selection with end-to-end QoS support
Proceedings of the 2004 ACM symposium on Applied computing
A distributed algorithm for simultaneous group communication
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Networked Graphics: Building Networked Games and Virtual Environments
Networked Graphics: Building Networked Games and Virtual Environments
A distributed algorithm for ordered, atomic and simultaneous group communication
Future Generation Computer Systems
AINTEC'05 Proceedings of the First Asian Internet Engineering conference on Technologies for Advanced Heterogeneous Networks
Hi-index | 0.00 |
We present a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of multicast groups with a small number of receivers. Such a case occurs, for example, when multicast addresses are allocated to mobile hosts, as a mechanism to manage Internet host mobility or in large distributed simulations. For such cases, existing dense or sparse mode multicast routing algorithms do not scale well with the number of multicast groups. DCM is based on an extension of the centre-based tree approach. It uses several core routers, called Distributed Core Routers (DCRs) and a special control protocol among them. DCM aims: (1) avoiding multicast group state information in backbone routers, (2) avoiding triangular routing across expensive backbone links, (3) scaling well with the number of multicast groups. We evaluate the performance of DCM and compare it to an existing sparse mode routing protocol when there is a large number of small multicast groups. We also analyse the behaviour of DCM when the number of receivers per group is not a small number.