IP multicasting: the complete guide to interactive corporate networks
IP multicasting: the complete guide to interactive corporate networks
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Topology-aware overlay networks for group communication
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Scattercast: an architecture for internet broadcast distribution as an infrastructure service
Scattercast: an architecture for internet broadcast distribution as an infrastructure service
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Computer Networks: The International Journal of Computer and Telecommunications Networking
Short Survey: A survey of application level multicast techniques
Computer Communications
A case for end system multicast
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Application-layer multicast (ALM) can solve most of the problems of IP-based multicast. Topology-aware approach of ALM is more attractive because it exploits underlying network topology data to construct multicast overlay networks. In this paper, a novel mechanism of overlay construction called Multi-domain Topology-Aware Grouping (MTAG) is introduced. MTAG manages nodes in the same domain by a special node named domain manager. It can save the time used to discover topology information and execute the path matching algorithm if there are some multicast members in the same domain. The mechanism can lower the depth of the multicast tree too. Simulation results show that nodes can acquire multicast service more quickly when the group size is large or the percentage of subnet nodes is high.