• Proceedings of the KAIS Fall Conference
• /
• 2006.05a
• /
• pp.540-544
• /
• 2006

사용자가 자료를 직접 송수신하기 위한 P2P 네트워크 환경에는 하이브리드 P2P 네트워크 환경과 순수 P2P 네트워크 환경이 있다. 하이브리드 P2P 네트워크 환경에서 모든 피어들은 서버에 연결되어 있기 때문에, 피어들 간 메시지를 전달할 수 없는 네트워크 고립 상태가 발생되지 않는다. 그러나 순수 P2P 네트워크 환경에서 각 피어들은 서버 없이 서로 직접 연결하여 다른 피어로부터 서비스를 제공받기 때문에, 각 피어들 간의 통신을 중재하는 특정 피어가 종료할 경우 대상 피어들과의 통신이 단절되는 네트워크 고립 현상이 발생될 수 있다. 본 논문에서는 이러한 문제점을 해결하기 위해 각 피어들로 하여금 인접한 피어로부터 IP 주소를 얻어 목록으로 관리하게 함으로써, 연결된 피어가 종료할 경우 목록으로 유지된 IP 주소로 연결하여 네트워크 그룹에 지속적으로 참여할 수 있게 하는 기법을 연구하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.538-541
• /
• 2006

Recently researches of P2P media streaming have been actively published, but the research what kind of P2P overlay networks are better to delivering media data has not been attended. This paper designs a P2P streaming media system model. In this system, we constructs a Half-Structure P2P overlay protocol based on node's capability as the infrastructure of streaming application, which utilizes the heterogeneity of the nodes to maintain topology, presents a active contents diffusing algorithm and Two-stage search algorithm, make it possible for nodes in P2P system to collect information according their capacity and reduces the number of forwarding packet compared with flooding. Also, we give an optimal scheme to scheduling media data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.69-76
• /
• 2014

In this paper, we propose a buffering scheme to improve the performance in P2P live streaming systems by adjusting the ratio of caching and prefetching portion of each peer. To this end, we assign all the peers into many groups depending on their playback periods. We then determine the ratio of caching and prefetching portion in each peer depending on its playback time position relative to those of other peers within the same group. In other words, as the playback position of a peer gets later, we increase the ratio of its caching portion. On the contrary, as the playback position of a peer gets eariler, we increase the ratio of its prefetching portion. This can significantly increase the degree of data duplication among peers that belong to each specific group. By simulation experiments, we show that our proposed an integrated prefetching/caching scheme can improve the performance considerably in terms of jitter ratio, initial playback delay and shared buffermap ratio when compared to the existing fixed portion buffering scheme.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

• Journal of Digital Convergence
• /
• v.13 no.5
• /
• pp.245-250
• /
• 2015

The P2P technology is becoming a technology for receiving a service, such as the latest YouTube and Facebook. P2P technology can be easily downloaded to a large amount of multimedia content over a distributed environment. However, pictures, music, a large amount of multimedia content such as videos each user is unable to manage the content management operating smoothly because, Song communication processing overhead caused when the reception is likely to remain the problem. In this paper, we propose a convergence content management technique that provides a low communication overhead of the frequency of use of the convergence content when trying to provide a large amount of convergence content to users in a distributed environment. Our method can be used to select the appropriate frequency is high among the shared content on the P2P multimedia environments that are distributed across a frequency of use of the convergence content and provides the service. Experimental evaluation proposed method, the convergence content browsing speed than conventional techniques improved communication about 13.3% and reduced overhead to about 9.5%.

• Proceedings of the Korea Contents Association Conference
• /
• 2010.05a
• /
• pp.67-69
• /
• 2010

본 논문에서는 이동 피어의 효율적인 콘텐츠 탐색을 지원하는 피어 지역 색인 기법을 제안한다. 제안하는 기법은 인덱스 테이블, 버디 테이블, 라우팅 테이블로 구성되며 타임스탬프 메시지를 이용하여 메시지 전송 비용을 감소시킨다. 제안하는 색인 구조는 동적인 이동성과 상황 정보를 고려하여 탐색정확도를 향상하고 탐색 비용을 감소시킨다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.40-42
• /
• 2004

Access Grid는 상호공동작업을 위하여 대용량의 컨텐츠 파일들을 주고받으며 공유한다. 특별히 중앙의 집중된 관리서버가 없는 Access Grid환경에서는 컨텐츠의 위치추적의 어려움, 부재, 병목 등의 현상이 발생하는데 이를 본 논문에서 1. 중앙 Hybrid서버의 구현 2. 집중컨텐츠의 거점노드복제 3. 중요컨텐츠의 24시간 공유보장 등의 기법으로 해결방안을 제안하였다. 그리고 이에 대한 효율성을 시뮬레이션 자료로 증명하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.4
• /
• pp.807-816
• /
• 2015

During the last decade most of coordinated security breaches are performed by the means of botnets, which is a large overlay network of compromised computers being controlled by remote botmaster. Due to high volumes of traffic to be analyzed, the challenge is posed by managing tradeoff between system scalability and accuracy. We propose a novel Hadoop-based P2P botnet detection method solving the problem of scalability and having high accuracy. Moreover, our approach is characterized not to require labeled data and applicable to encrypted traffic as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.791-798
• /
• 2015

It has been grown interests of the convergence technologies about communication systems and vehicular industry. Vehicular communications enable a number of infotainment applications to serve cars under high mobility environments. To achieve this goal, a robust and accurate channel estimation scheme is of great importance. This paper proposes an enhanced Decision-Directed channel estimation scheme called PTAU(Pilot Tone Aided Update) for IEEE 802.11p in vehicular communication environment. Existing approaches which use subsequent data symbols to estimate channel response in time domain will lead to the error propagation. In this paper, we use the pilot subcarriers to get initial channel response, then utilize the correlation characteristics to update channel response in frequency domain. Finally, Analysis and simulation results reveal that the proposed scheme outperforms in bit error rate(BER), significantly improve the performance of the estimation.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.11-19
• /
• 2004

P2P network environments provide users with direct data transmission and sharing facilities and those environments can be classified into hybrid P2P network environments and pure P2P network environments according to the arbitration mechanism among the peers in the network. In hybrid P2P network environments, there exists a server that maintains index information for the data to be shared and network isolation does not occur because every peer always keeps connection to the server. In pure P2P network environments, however, each peer directly connects to another peer and gets services without server intervention, and so, network isolation can occur when the mediating peer fails to work. In this paper. we propose a scheme for each peer to keep connection to other peers continuously by maintaining IP addresses of its neighbor peers and connecting to the peers when the mediating peer fails to work. Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiation, the application can do its job while maintaining connection to the network continuously and automatically. To evaluate our proposed scheme, we measured and analyzed the time for a peer to reconnect to the network when the mediating peer fails and the network isolation occurs.