Abstract
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.
| Original language | English |
|---|---|
| Pages | 1789-1794 |
| Number of pages | 6 |
| Publication status | Published - 2003 |
| Event | 2003 International Conference on Communication Technology, ICCT 2003 - Beijing, China Duration: 2003 Apr 9 → 2003 Apr 11 |
Other
| Other | 2003 International Conference on Communication Technology, ICCT 2003 |
|---|---|
| Country/Territory | China |
| City | Beijing |
| Period | 03/4/9 → 03/4/11 |
Keywords
- End Host Multicast
- Join
- Peer-to-peer
- Potential parent
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering