FJM: fast join mechanism for overlay multicast

We propose fast join mechanism to search potential parents for new members in overlay multicast. An existing method searches overlay-tree one step at a time to find a potential parent. The existing search method causes long join latency. To search quickly, we search overlay-tree two steps at a time. In other words, we search children and grandchildren 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.