• Title/Summary/Keyword: 로컬 스왑

Search Result 2, Processing Time 0.015 seconds

Overlay Multicasting with Local Swap Option in a Personal Broadcasting System (로컬 스왑 기법을 적용한 오버레이 멀티캐스트 기반의 개인방송 시스템)

  • Kang, Mi-Young;Lee, Hyung-Ok;Nam, Ji-Seung
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.8
    • /
    • pp.1-8
    • /
    • 2008
  • Overlay Multicast is an effective method for optimal utilization of system resources and network bandwidth without a need for hardware customization. It is an effective method of providing Personal Internet Broadcasting Service for better Quality of Service to many users. In this paper, we propose a multicast tree that uses Local Swap method. In order to prove the effectiveness of the new technique suggested here, using the proposed method and personal internet broadcasting service, information is abstracted, compared and analyzed under various overlay multicast algorithm conditions. We have proved that the suggested local swap technique is more effective by comparing it with other existing techniques in various methods such as using various overlay based multicast algorithm simulation.

Performance Optimization Technique for Overlay Multicast Trees by Local Transformation (로컬 변환에 의한 오버레이 멀티캐스트 트리의 성능 최적화 기법)

  • Kang, Mi-Young;Kwag, Young-Wan;Nam, Ji-Seung;Lee, Hyun-Ok
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.8
    • /
    • pp.59-65
    • /
    • 2007
  • Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without a need for hardware customization. Multicast tree reconstruction is required when a non-leaf node leaves or fails. However frequent multicast tree reconstruction introduces serious degradation in performance. In this paper, we propose a tree performance optimization algorithm to solve this defect by using information(RTCP-probing) that becomes a periodic feedback to a source node from each child node. The proposed model is a mechanism performed when a parent node seems to cause deterioration in the tree performance. We have improved the performance of the whole service tree using the mechanism and hence composing an optimization tree. The simulation results show that our proposal stands to be an effective method that can be applied to not only the proposed model but also to existing techniques.