FJM

Fast join mechanism for overlay multicast

Sungyean Cho, Myong Soon Park

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationIEEE Conference on Control Applications - Proceedings
Pages1333-1338
Number of pages6
Volume2
Publication statusPublished - 2003 Dec 1
EventProceedings of 2003 IEEE Conference on Control Applications - Istanbul, Turkey
Duration: 2003 Jun 232003 Jun 25

Other

OtherProceedings of 2003 IEEE Conference on Control Applications
CountryTurkey
CityIstanbul
Period03/6/2303/6/25

Fingerprint

Costs

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

Cite this

Cho, S., & Park, M. S. (2003). FJM: Fast join mechanism for overlay multicast. In IEEE Conference on Control Applications - Proceedings (Vol. 2, pp. 1333-1338)

FJM : Fast join mechanism for overlay multicast. / Cho, Sungyean; Park, Myong Soon.

IEEE Conference on Control Applications - Proceedings. Vol. 2 2003. p. 1333-1338.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cho, S & Park, MS 2003, FJM: Fast join mechanism for overlay multicast. in IEEE Conference on Control Applications - Proceedings. vol. 2, pp. 1333-1338, Proceedings of 2003 IEEE Conference on Control Applications, Istanbul, Turkey, 03/6/23.
Cho S, Park MS. FJM: Fast join mechanism for overlay multicast. In IEEE Conference on Control Applications - Proceedings. Vol. 2. 2003. p. 1333-1338
Cho, Sungyean ; Park, Myong Soon. / FJM : Fast join mechanism for overlay multicast. IEEE Conference on Control Applications - Proceedings. Vol. 2 2003. pp. 1333-1338
@inproceedings{9d386c99ea32460aae856de6e03389b5,
title = "FJM: Fast join mechanism for overlay multicast",
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.",
keywords = "Data transfer, Distributed protocol, End system multicast, Group applications, IP multicast, Logical overlay network, Multicast communication",
author = "Sungyean Cho and Park, {Myong Soon}",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2",
pages = "1333--1338",
booktitle = "IEEE Conference on Control Applications - Proceedings",

}

TY - GEN

T1 - FJM

T2 - Fast join mechanism for overlay multicast

AU - Cho, Sungyean

AU - Park, Myong Soon

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

KW - Data transfer

KW - Distributed protocol

KW - End system multicast

KW - Group applications

KW - IP multicast

KW - Logical overlay network

KW - Multicast communication

UR - http://www.scopus.com/inward/record.url?scp=0344926527&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0344926527&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 1333

EP - 1338

BT - IEEE Conference on Control Applications - Proceedings

ER -