• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.15-21
• /
• 2010

This paper proposes the multimedia fingerprinting code insertion algorithm when video content is distributed in P2P environment, and designs the collusion codebook SRP(Small RISC Processor) embedded system for the collusion attack prevention. In the implemented system, it is detecting the fingerprinting code inserted in the video content of the client user in which it requests an upload to the web server and in which if it is certified content then transmitted to the streaming server then the implemented system allowed to distribute in P2P network. On the contrary, if it detects the collusion code, than the implemented system blocks to transmit the video content to the streaming server and discontinues to distribute in P2P network. And also it traces the colluders who generate the collusion code and participates in the collusion attack. The collusion code of the averaging attack is generated with 10% of BIBD code v. Based on the generated collusion code, the codebook is designed. As a result, when the insert quantity of the fingerprinting code is 0.15% upper in bitplane 0~3 of the Y(luminance) element of I-frame at the video compression of ASF for a streaming service and MP4 for an offline offer of video content, the correlation coefficient of the inserted original code and the detected code is above 0.15. At the correlation coefficient is above 0.1 then the detection ratio of the collusion code is 38%, and is above 0.2 then the trace ratio of the colluder is 20%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.777-780
• /
• 2007

인터넷 스트리밍 시스템은 스트리밍 소스를 공급하는 미디어 서버와 이로부터 미디어 스트림을 받아 분배하는 스트리밍 서버, 그리고 스트리밍 단말기들로 구성되며, 기존에는 하나의 스트리밍 서버에 다수의 단말기들이 직접적으로 연결되는 방식을 취하고 있다. 이러한 클라이언트-서버 형태의 중앙 구조의 단점을 극복하여 확장성을 제공하기 위해 P2P 스트리밍 시스템에 대한 연구가 최근 들어 진행되고 있다. 그러나 P2P 방식을 이용한 인터넷 스트리밍 시스템을 설계, 구현, 테스트를하기 위해서 많은 비용이 소비되는 현실적인 어려움이 있다. 그러므로 본 논문에서는 P2P 스트리밍 시스템에 대한 다양한 연구 및 실험을 지원하기 위해, P2P 스트리밍 시스템을 정의하고, NS2 시뮬레이션 라이브러리를 이용하여 P2P 스트리밍 시스템 시뮬레이터 P2PStreamSim을 설계 및 구현하였다. 또한 테스트 P2P 스트리밍 시스템을 사례로 적용하여 P2PStreamSim의 동작을 검증하고 성능을 평가하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.1-7
• /
• 2021

In this paper, optimized media data retrieval and transmission based on the Hybrid CDN/P2P architecture and selective storage through user's prediction of requestability enable seamless data transfer to users and reduction of unnecessary traffic. We also propose a new media management method to minimize the possibility of transmission delay and packet loss so that media can be utilized in real time. To this end, we construct each media into logical segments, continuously compute weights for each segment, and determine whether to store segment data based on the calculated weights. We also designate scattered computing nodes on the network as local groups by distance and ensure that storage space is efficiently shared and utilized within those groups. Experiments conducted to verify the efficiency of the proposed technique have shown that the proposed method yields a relatively good performance evaluation compared to the existing methods, which can enable both initial latency reduction and seamless transmission.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.5-23
• /
• 2011

One inevitable problem in Ad Hoc networks is the limited battery capacity, which explains why portable devices might shut down suddenly when the power of hardware is depleted. Hence, how to decrease the power consumption is an important issue in ad hoc networks. With the development of wireless technology, mobile devices can transmit voices, surf the Internet, download entertaining stuffs, and even support some P2P applications, like sharing real-time streaming. In order to keep the quality stable, the transmission must be continuous and it is thus necessary to select some managers to coordinate all nodes in a P2P community. In addition to assigning jobs to the staffs (children) when needed, these managers (ancestors) are able to reappoint jobs in advance when employees retire. This paper proposed a mechanism called Cluster-based Power Management (CPM) to stabilize the transmissions and increase Time to Live (TTL) of mobile hosts. In our new proposed method, we establish the clusters according to every node's joining order and capability, and adjust their sleep time dynamically through three different mathematical models. Our simulation results reveal that this proposed scheme not only reduces the power consumption efficiently, but also increases the total TTLs evidently.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.151-159
• /
• 2012

In this paper, we propose a new peer grouping scheme to consider locality among peers using TTL values in P2P-based IPTV systems. This scheme can select neighbor peers to minimize the number of intermediate routers between each pair of peers. Thus, it can save the network bandwidth as much as the amount of data that the reduced number of routers should transmit In addition, we have conducted various simulation experiments to show that our proposed TTL-based peer grouping scheme can outperform the conventional RTT-based grouping scheme. The experimental results show that our proposed scheme can reduce the jitter ratio as well as the number of data and control packets that all routers should transmit.

• Asia pacific journal of information systems
• /
• v.31 no.1
• /
• pp.17-42
• /
• 2021

This study examines the adoption of subscription-based video on demand (SVOD) streaming services among consumers. Primarily, we explore the moderating effect of the two models of streaming services, standalone streaming services and bundled streaming services, on the users' adoption. We employ the Unified Theory of Acceptance and Use of Technology (UTAUT2) model in this study. We utilize the data collected from 337 Indian respondents and find that all constructs of the UTAUT2 model act as motivators of adoption. Gender, age, and experience of the respondent also play a moderating role in the adoption of streaming services. We also find that providing bundled streaming service positively moderates price-value and hedonic motivation of adoption. The study is perhaps the first of its kind that aims to understand the motivations for adoption of SVOD services, particularly in the Indian context, which has the fastest-growing base of internet users in the world.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.557-558
• /
• 2009

P4P는 P2P 통신을 함에 있어서 가장 적절한 피어를 선택하여 P2P 어플리케이션의 성능을 향상 시키면서 네트워크 자원의 효율적인 사용을 극대화하기 위해 제안된 프레임워크이다. 본 논문에서는 P4P 프레임워크에 기존 CoolStreaming 시스템을 적용하는 방안을 설명하고, ISP 개체와 P2P 시스템 개체의 협력 동작과정 및 그 개체들이 유지/관리하는 정보 등을 설명한다.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.731-738
• /
• 2007

본 논문에서는 P2P 환경에서 사용자간에 멀티미디어 콘텐츠를 공유하는 목적의 시스템 구현에 초점을 맞추어 P2P 네트워크에서 피어들 간에 멀티미디어 콘텐츠를 공유하고 구간정보를 이용하여 효율적으로 스트리밍 하는 방법에 대하여 논한다. 피어들은 멀티미디어 콘텐츠의 관심 있는 부분만을 쉽고 편리하게 추출하려는 경향이 있기 때문에 멀티미디어 콘텐츠에서 구간정보를 색인한 파일을 만들어 검색서버에 등록한 후 피어들의 요청이 있을 때 이 구간정보를 이용하여 필요한 부분만을 스트리밍 서비스 할 수 있도록 한다. 많은 피어들의 서버 접속으로 인한 서버의 부하를 줄이기 위해 P2P 환경에서의 스트리밍 기술을 이용하여 피어의 PC가 필요에 따라 서버 기능을 할 수 있도록 기능을 구현하고, 검색서버에서 제공되는 구간정보에 따라 해당하는 피어가 구간별로 멀티미디어 콘텐츠를 스트리밍 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.249-254
• /
• 2007

일반 PC 자원만을 활용하는 기존 P2P 서비스 방식에서 Wibro망을 통한 다양한 이동 단말까지 P2P 네트워크를 구성하여, 기존 파일 공유 및 Instance Message 교환 등의 일반적 기능을 포함한 P2P 기반 실시간 Streaming Service를 제공하는 Application 구현 방안에 대해 설명한다. 또한 안전한 네트워크 구성을 위하여, P2P 네트워크 참여시 사용자 인증, 공개키 암호화 기반의 메시지 보안 적용 사항과 동영상 콘텐츠의 보안을 위하여, 스트리밍 데이터를 일부 구간(Chunk)단위로 나누어 별도의 Key로 암호화하여 제공함으로써, 인증된 사용자만이 요청된 콘텐츠만을 활용할 수 있는 방안을 제시한다.