FJM: Fast Join Mechanism for End Host Multicast

摘要

We propose Fast Join Mechanism to search potential parents for new members in End Host Multicast. An existing method searches EM-tree one step at a time to find a potential parent The existing search method causes long join latency. To search quickly, we search EM-tree two steps at a time. In other words, we search children and grand-children at the same time. We look at the performance of Fast Join Mechanism using the following metrics: cost and search time by the number of group members and degree limit. Simulation results show that our mechanism searches potential parents faster than the existing method.