• Title/Summary/Keyword: end-host multicast

Search Result 8, Processing Time 0.019 seconds

The improvement of Tree-First algorithm on End Host Multicast (End Host Multicast : Tree-First 방식의 트리구성 알고리즘 개선 제안)

  • Pom, Choung-Ung;Kang, Mi-Young;Nam, Ji-Seung
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.751-752
    • /
    • 2006
  • In this paper, we propose a improved tree construction algorithm on End Host Multicast. By using concurrent connection information of nodes at RP, we could diminish the RDP and the amount of control messages used for tree construction at the same time.

  • PDF

End-Host Multicast Tree Protocol in Overlay Multicast Networks (오버레이 멀티캐스트 네트워크에서 종단 호스트 멀티캐스트 트리 프로토콜 기법에 관한 연구)

  • 노경택;이기영
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.4
    • /
    • pp.126-131
    • /
    • 2003
  • While the advantages of multicast delivery over multiple unicast deliveries is undeniable, the deployment of the IP multicast protocol has been limited to network domains under single administrative control. Deployment of inter-domain multicast delivery has been slow due to both technical and administrative reasons. For this reasons overlay multicasting technologies are recently proposed. We propose a End-Host Multicast Tree Protocol (EMTP) that searches two levels of the tree at a time until reaching to a leaf node and can select the nearest node that a new node try to join in the tree. Even if there is no available degree of the desirable node that a new node want to join, selecting the node as a potential parent by EMTP can reduce the number of tree switching with robustness of the tree and bring to ruduce the data delivery time.

  • PDF

Multicast Routing Protocol for Guaranting Host Mobility (호스트 이동성 보장을 위한 멀티캐스트 라우팅 프로토콜)

  • 양승제;박성한
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.133-136
    • /
    • 2003
  • In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IP based mobile networks. The proposed multicast routing protocol is a hybrid method employing the merits of the bi-directional tunneling and the remote subscription by considering the mobility of mobile hosts. The proposed protocol satisfies the bound of end-to-end delay and supports the seamless handoff. The simulation results show that the proposed protocol has better performance in the number of multicast tree reconstruction and tunneling length and packet loss time than the previous protocols.

  • PDF

A Overlay Transmission Method of End-to-end Host for Transmission Rate Improvement (전송률 향상을 위한 종단간 호스트의 오버레이 전송 기법)

  • Koo, Myung-Mo;Jeong, Won-Chang;Kim, Sang-Bok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.275-283
    • /
    • 2005
  • In this paper, we propose an overlay transmission method of end-to-end host to solve decrease in transmission rate caused by congestion in the application using multicast. In this proposed method, we've selected an overlay end-to-end host (OEH) for overcast transmission for each node, and the OEH can transmit duplicative packets. When the loss rate is more than the overcast threshold, the receivers of node in congestion are dropping from current layers and the OEH of lower nodes can request overcast transmission to OEH of non-congestion nodes for receiveing packets. In simulation results, it was known that the proposed method improves transmission rates over those of existing methods.

  • PDF

Reliable Hybrid Multicast using Multi-layer Transmission Path (다계층 전송경로를 이용한 신뢰성 있는 하이브리드 멀티캐스트)

  • Gu, Myeong-Mo;Kim, Bong-Gi
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.1
    • /
    • pp.35-40
    • /
    • 2019
  • It is important to constantly provide service in real-time multimedia applications using multicast. Transmission path reconstruction occurs in hybrid multicast using Internet Protocol (IP) multicast and ALM in order to adapt the network status to things like congestion. So, there is a problem in which real-time QoS is reduced, caused by an increase in end-to-end delay. In this paper, we want to solve this problem through multi-layer transmission path construction. In the proposed method, we deploy the control server and application layer overlay host (ALOH) in each multicast domain (MD) for hybrid multicast construction. After the control server receives the control information from an ALOH that joins the MD, it makes a group based on the hop count and sends it to the ALOH in each MD. The ALOH in the MD performs the role of sending the packet to another ALOH and constructs the multi-layered transmission path in order of priority by using control information that is received from the control server and based on the delay between neighboring ALOHs. When congestion occurs in, or is absent from, the ALOH in the upper MD, the ALOH selects the path with the highest priority in order to reduce end-to-end delay. Simulation results show that the proposed method could reduce the end-to-end delay to less than 289 ms, on average, under congestion status.

An Optimal Multicast Routing Protocol for Guaranting Host Mobility in IPv6-Based Mobile Networks (IPv6 기반 이동망에서 호스트 이동성 보장을 위한 최적화된 멀티캐스트 라우팅 프로토콜)

  • 양승제;강명규;박성한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.5
    • /
    • pp.1-9
    • /
    • 2004
  • In this paper, we propose a multicast routing protocol for the seamless delivery of multicast data to mobile hosts through the optimal route in IPv6-Based mobile networks. The proposed multicast routing protocol reduces the tree reconstruction overhead by limiting the tunneling length according to the mobility of mobile hosts. In this way, our protocol satisfies the bound of the end-to-end delay and supports the seamless handoff. Analytical and simulation results show that the proposed protocol has better performance in terms of the tree reconstruction, tunneling service and multicast packet loss than the previous protocols does.

Virtual Direction Multicast: An Efficient Overlay Tree Construction Algorithm

  • Mercan, Suat;Yuksel, Murat
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.446-459
    • /
    • 2016
  • In this paper, we propose virtual direction multicast (VDM) for video multicast applications on peer-to-peer overlay networks. It locates the end hosts relative to each other based on a virtualized orientation scheme using real-time measurements. It builds multicast tree by connecting the nodes, which are estimated to be in the same virtual direction. By using the concept of directionality, we target to use minimal resources in the underlying network while satisfying users' quality expectations. We compare VDM against host multicast tree protocol.We simulated the protocol in a network simulator and implemented in PlanetLab. Results both from simulation and PlanetLab implementation show that our proposed technique exhibits good performance in terms of defined metrics.

One-Time Overlay Multicast Techniques Considering Receipt Quality for m-to-n Comunication over Large Internet (다자간의 통신환경에서 다양한 수신품질을 고려한 One-Time 오버레이 멀티캐스트 기법에 관한 연구)

  • Yoon Mi-youn;Kim Ki-Young;Kim Dae-Won;Shin Yong-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1B
    • /
    • pp.27-38
    • /
    • 2005
  • IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.