Abstract
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 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 | 1333-1338 |
| Number of pages | 6 |
| Publication status | Published - 2003 |
| Event | Proceedings of 2003 IEEE Conference on Control Applications - Istanbul, Turkey Duration: 2003 Jun 23 → 2003 Jun 25 |
Other
| Other | Proceedings of 2003 IEEE Conference on Control Applications |
|---|---|
| Country/Territory | Turkey |
| City | Istanbul |
| Period | 03/6/23 → 03/6/25 |
Keywords
- Data transfer
- Distributed protocol
- End system multicast
- Group applications
- IP multicast
- Logical overlay network
- Multicast communication
ASJC Scopus subject areas
- Control and Systems Engineering