• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.270-273
• /
• 2007

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the advancement of the network techniques to enforce routing in application-level. But, The overlay multicast is a problem of delay and the load of the traffic control. In this paper, we suggested to an effective transmission routing tree between users based on overlay multicast of Internet broadcasting Service. And we evaluated an optimal value of transmission delay about Internet broadcasting using this suggest model.

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

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.955-957
• /
• 2010

P2P VoD 스트리밍에서 비디오 서비스를 제공받는 사용자의 시청 패턴은 비디오의 시작부터 끝까지 순차시청 모델에 기초하고 있다. 최근 비디오 재생지점의 임의 변경을 허용하는 VCR 기능과 같은 사용자 interactivity 지원과 재생지점 변경 시 지연을 최소화 하는 연구가 활발하게 진행되어 왔다. 본 논문에서는 VCR 동작 시 오버레이 상에서 필요로 하는 컨텐츠를 소유한 피어를 신속하게 찾고 비디오 구간별 인기도에 근거하여 prefetching 을 지원하는 시스템을 제안한다. 비디오의 균등한 구간에서의 인기도를 측정하여 인기구간과 비인기구간에 대해서 동적으로 앵커 피어들을 링크드 리스트로 오버레이를 구성한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.923-926
• /
• 2008

오버레이 멀티캐스트는 하드웨어적인 인프라 구축 없이도 시스템의 자원과 네트워크 대역폭을 효율적으로 사용할 수 있는 기법이며 중간 노드의 이탈이 발생하게 될 경우 멀티캐스트 트리를 재구성 한다. 그러나 빈번한 멀티캐스트 트리의 재구성은 심각한 성능 저하를 가져오게 된다. 본 논문에서는 이러한 성능저하를 보완하기 위해 각 자식 노드들로부터 소스 노드에게 주기적으로 피드백 되어오는 정보를 기반으로 트리 성능 최적화 알고리즘을 제안한다. 제안된 모델은 서비스 하는 부모노드가 트리의 성능을 저하 시키는 원인으로 판단되어질 때 수행하는 메커니즘이고, 이 메커니즘을 수행하여 성능 최적화 트리를 구성함으로써 전체적인 서비스 트리의 성능을 향상시켰다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.682-685
• /
• 2007

P2P 기술의 발달로 기존 클라이언트-서버 형태인 중앙 집중형 방식의 단점을 극복하고 있다. 이러한 P2P 기술의 진화로 P2P 응용 기술에 대한 많은 발전이 있었다. 현재 P2P 구조에서 사용자는 P2P 네트워크에 참여하여 자신이 원하는 자료를 찾는 검색과정이 필요하다. 본 논문은 이러한 과정을 최소화하여서 검색과정을 줄일 수 있는 방법을 다룬다. P2P 네트워크에 존재하는 서비스 프로파일 목록들을 서비스를 제공하는 주체가 서비스를 소비하는 주체에게 보내주게 된다면 사용자는 최신의 서비스 목록을 유지하여 서비스 목록 검색 시간을 최소화 시킬 수 있다. 본 논문에서는 P2P 오버레이 네트워크상에서의 서비스 푸시 시스템에 대한 정의, 각 피어들의 행동모델을 정의 및 시스템 설계에 대해서 소개한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.415-417
• /
• 2006

분산형 P2P 그리드 시스템을 구축하는데 있어 연산 수행을 위한 노드 구성 기법과 구성된 토플로지에 적합한 연산 수행 보델 및 스케줄링 기법은 필수 요소이다. 하지만 기존 연구에서는 자원 제공자와 휘발성을 고려하지 않은 연산 수행 모델을 사용하였기 때문에 연산의 안정적인 수행이 보장되지 못하고, 시스템의 성능이 떨어지는 문제점이 발생한다. 이에 본 논문에서는 가용성 기반의 자가 조직적 계산 오버레이 네트워크(SelfCON:Self-organizing Computation Overlay Network) 구성 기법과 구성된 토폴로지에 적합한 연산 수행 모델 및 스케줄링 기법을 제안한다. 제안 기법은 자원 제공자 노드의 휘발성을 고려하여 안정성을 높임으로써 전체 연산 성능을 향상시킨다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1141-1153
• /
• 2010

This paper introduces ONLIS(Overlay Multicast Network for Live IPTV Service), a novel overlay multicast network optimized to deliver live broadcast IPTV stream. We analyzed IPTV reference model of ITU-T IPTV standardization group in terms of network and stream delivery from the source networks to the customer networks. Based on the analysis, we divide IPTV reference model into 3 networks; source network, core network and access network, ION(Infrastructure-based Overlay Multicast Network) is employed for the source and core networks and PON(P2P-based Overlay Multicast Network) is applied to the access networks. ION provides an efficient, reliable and stable stream distribution with very negligible delay while PON provides bandwidth efficient and cost effective streaming with a little tolerable delay. The most important challenge in live P2P streaming is to reduce end-to-end delay without sacrificing stream quality. Actually, there is always a trade-off between delay & stream quality in conventional live P2P streaming system. To solve this problem, we propose two approaches. Firstly, we propose DSPT(Distributed Streaming P2P Tree) which takes advantage of combinational overlay multicasting. In DSPT, a peer doesn't fully rely on SP(Supplying Peer) to get the live stream, but it cooperates with its local ANR(Access Network Relay) to reduce delay and improve stream quality. When RP detects bandwidth drop in SP, it immediately switches the connection from SP to ANR and continues to receive stream without any packet loss. DSPT uses distributed P2P streaming technique to let the peer share the stream to the extent of its available bandwidth. This means, if RP can't receive the whole stream from SP due to lack of SP's uploading bandwidth, then it receives only partial stream from SP and the rest from the ANR. The proposed distributed P2P streaming improves P2P networking efficiency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.451-457
• /
• 2006

A peer-to-peer(P2P) network is inherently vulnerable to malicious attacks from participating peers because of its open, flat, and autonomous nature. This paper addresses the problem of effectively defending from active attacks of malicious peers at bootstrapping phase and at online phase, respectively. We propose a secure membership handling protocol to protect the assignment of ID related things to a newly joining peer with the aid of a trusted entity in the network. The trusted entities are only consulted when new peers are joining and are otherwise uninvolved in the actions of the P2P networks. For the attacks in online phase, we present a novel message structure applied to each message transmitted on the P2P overlay. It facilitates the detection of message alteration, replay attack and a message with wrong information. Taken together, the proposed techniques deter malicious peers from cheating and encourage good peers to obey the protocol of the network. The techniques assume a basic P2P overlay network model, which is generic enough to encompass a large class of well-known P2P networks, either unstructured or not.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12B
• /
• pp.1049-1057
• /
• 2006

Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without using hardware customization. Unlike in IP multicast, multicast tree reconstruction is required when non-leaf node leaves or fails. In this paper, we propose a proactive approach to solve this defect by using a resource reservation of the out degrees. This allows children of non-leaf node to connect to its new parent node immediately when its parent node leaves or fails. In our proposal, a proactive route maintenance gives a fast recovery time and reduces a delay effect in the new route. The simulation results show that our proposal takes shorter period of time than the other algorithms to reconstruct a similar tree and that it is a more effective way to deal with a lot of nodes that have lost their parent nodes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1058-1065
• /
• 2008

In the Internet, as computer resource is developed, multimedia data request being increase more and more. It is effective way that process both high capacity-data and real-time data. Overlay Multicast is an effective method for efficient utilization of system resources and network bandwidth without using hardware customization. Overlay Multicast is an effective method for multimedia data service to multi-users. Multicast tree reconstruction is required when a non-leaf host leaves or fails. In this paper, relay-frame interval is selected as revealed network-state with jitter. In our proposal, multi-user service control algorithm gives a delay effect in multimedia request time. The simulation results show that our proposal takes shorter period of time than the other algorithms to reconstruct a similar tree and that it is a more effective way to deal with a lot of nodes that have lost their multi-user nodes.