FJM: Fast Join Mechanism for End Host Multicast

Sungyean Cho, Myong Soon Park

Research output: Contribution to conferencePaper

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 languageEnglish
Pages1789-1794
Number of pages6
Publication statusPublished - 2003
Event2003 International Conference on Communication Technology, ICCT 2003 - Beijing, China
Duration: 2003 Apr 92003 Apr 11

Other

Other2003 International Conference on Communication Technology, ICCT 2003
CountryChina
CityBeijing
Period03/4/903/4/11

Keywords

  • End Host Multicast
  • Join
  • Peer-to-peer
  • Potential parent

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'FJM: Fast Join Mechanism for End Host Multicast'. Together they form a unique fingerprint.

  • Cite this

    Cho, S., & Park, M. S. (2003). FJM: Fast Join Mechanism for End Host Multicast. 1789-1794. Paper presented at 2003 International Conference on Communication Technology, ICCT 2003, Beijing, China.