• Title/Summary/Keyword: file sharing

Search Result 204, Processing Time 0.026 seconds

A Study on Copyright Infringement over Online Streaming Services by Reconstructing Web Cache (웹 브라우저 캐시 재조립을 통한 온라인 스트리밍 서비스 상의 저작권 침해 가능성에 관한 연구)

  • Lim, Yirang;Chung, Hyunji;Lee, Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.4
    • /
    • pp.559-572
    • /
    • 2020
  • As internet technology advances, users can share content online, and many sharing services exist. According to a recently published digital forensic study, when playing an online streaming service, you can restore the played video by reconstructing the Chrome cache file left on local device such as a PC. This can be seen as evidence that the user watched illegal video content. From a different point of view, copyright infringement occurs when a malicious user restores video stream and share it to another site. In this paper, we selected 23 online streaming services that are widely used both at home and abroad. After streaming videos, we tested whether we can recover original video using cache files stored on the PC or not. As a result, the paper found that in most sites we can restore the original video by reconstructing cache files. Furthermore, this study also discussed methodologies for preventing copyright infringement in online streaming service.

A Smart Traffic Management Scheme and Its System Design Based on User's Participating with the Mobile Application (모바일 앱을 통한 사용자 참여 기반의 스마트 트래픽 관리 방안 및 시스템 설계)

  • Kim, Bog-Soon;Park, Choon-Gul;Lim, Hyong-Muk;Cho, Gi-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.8
    • /
    • pp.674-682
    • /
    • 2013
  • Along with increasing of its subscribers and traffic for high-speed LTE service, it is widely expected to bring about the 2nd data explosion and results in any inconvenience of users. This paper proposes a smart traffic management scheme and its system design based on user's participating with the mobile application, in order to provide a fast and stable service for end users as well as to resolve the network overhead with increasing traffic. By making use of a time shift by users who want to reduce data usage amount and communication cost, the proposed scheme tries to reduce the peak traffic by shifting the delay-tolerant services, such as file sharing and software download, into the other time line. It also reduces the high volumed video traffics by transforming them into a user customized one. In addition, we suggest a mechanism to select video size and service time, then proposes an overall system design and its user service scenarios.

An Efficient Method for Determining Work Process Number of Each Node on Computation Grid (계산 그리드 상에서 각 노드의 작업 프로세스 수를 결정하기 위한 효율적인 방법)

  • Kim Young-Hak;Cho Soo-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.5 no.1
    • /
    • pp.189-199
    • /
    • 2005
  • The grid computing is a technique to solve big problems such as a field of scientific technique by sharing the computing power and a big storage space of the numerous computers on the distributed network. The environment of the grid computing is composed with the WAN which has a different performance and a heterogeneous network condition. Therefore, it is more important to reflect heterogeneous performance elements to calculation work. In this paper, we propose an efficient method that decides work process number of each node by considering a network state information. The network state information considers the latency, the bandwidth and latency-bandwidth mixture information. First, using information which was measured, we compute the performance ratio and decide work process number of each node. Finally, RSL file was created automatically based on work process number which was decided, and then accomplishes a work. The network performance information is collected by the NWS. According to experimental results, the method which was considered of network performance information is improved respectively 23%, 31%, and 57%, compared to the methods of existing in a viewpoint of work amount, work process number, and node number.

  • PDF

A Study of Music Recommendation System in P2P Network using Collaborative Filtering (P2P 환경에서 협업 필터링을 이용한 음악 추천 시스템에 대한 연구)

  • Won, Hee-Jae;Park, Kyu-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1338-1346
    • /
    • 2008
  • In this paper, we propose a new P2P-based music recommendation system. In comparison with previous system in client-server environment, the proposed system shows higher quality of music recommendation through real-time sharing of music preference information between peers. A collaborative filtering is implemented as a recommendation algorithm. As a user preference profile, we use the inherit KID music genre index contained in all legitimate music file instead of music feature vectors as in previous research so that the proposed system can mitigate the performance degradation and high computational load caused by feature inaccuracy and feature extraction. The performance of the proposed system is evaluated in various ways with real 16-weeks transaction data provided by Korean music portal, 5 company and it shows comparative quality of recommendation with only small amount of computational load.

  • PDF

A study on Convergence of the Digital Contents Industry and Possibility of Exportation (디지털콘텐츠 산업의 융합화와 수출 가능성)

  • Chun, Byung-June;Choi, Dong-Gil
    • International Commerce and Information Review
    • /
    • v.12 no.3
    • /
    • pp.55-78
    • /
    • 2010
  • This study analyses recent development of digital contents industry. The purpose of this study is to show how the convergence phenomenon is occurring in the digital contents industry. Furthermore, this study examines the influence of digital convergence on the digital contents industry. The characteristics of the digital contents industry falls roughly into three features. To begin with, technical aspect of the industrial feature is that digitalized contents can be used in various digital devices, namely OSMU(One Source Multi Use). The second feature is related to protection of copyright against illegal file sharing and downloading. One final point is that platform for distribution channels has been universal by digital convergence. To sum up, the notable feature of digital contents industry is high value-added. Also, digital contents industry is composed of users, digital device, network, and universal contents. Users are the key component of digital contents industry, who is distinguished from consumers. Digital devices such as mobile phone, PDA can play all kinds of digital contents and make users communicate in two-ways. Portable devices also allow the users to consume digital contents at any place. Digital contents can be distributed by both wire and wireless networks. And most of transactions can be made through networks. There are three key issues about digital convergence. Entry barriers for market become lowered; the age of contents users is changed from old generation to young generation. And the form of contents devices is changing rapidly. Traditional contents field such as movie, music, broadcasting, publishing, animations are combined into one digital contents territory. As a result, this paper suggests that digital convergence phenomenon will be accelerating for the future. According to the result of this study, the advent of digital convergence and e-Commerce will have significant influence on trade of digital contents.

  • PDF

YouTube and Girls' Generation Fandom (유투브와 소녀시대 팬덤)

  • Shim, Doo-Bo;Noh, Kwang-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.1
    • /
    • pp.125-137
    • /
    • 2012
  • In this paper we draw from recent theoretical discussions of fan culture and the new media technologies to explore how online communities contribute to new forms of K-pop fandom. We suggest that these online sites play an important role in setting the new stage of dissemination and dialogue of K-pop knowledge, through which particular forms and spaces of online fan culture are being created and sustained. Moreover, these web-based communities challenge the existing concepts that have embraced interrelations between culture, consumption and technology. Based on an empirical study of YouTube, carried out using netnographic methods, this study tackles the following questions: how fans construct themselves as Korean pop fans through the online activities; how they exchange information and opinions of Korean stars; and, what meaning they extract from online file-sharing activities.

Relationship between Digital Contents Characteristics and Consumer's Usage Behavior in the Online Environment (온라인 환경에서 디지털콘텐츠의 특성과 소비행동의 관계)

  • Lee, Han-Suk
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.10
    • /
    • pp.234-241
    • /
    • 2011
  • The recent technology boom has created a new digital age. With the help of information technology consumers can have more power than ever and they use digital contents more than ever. This study relates consumer attitude to the recent digital contents using behavior about digital file-sharing. Through the use of the multimethod approach, we identify four characteristics can affect illegal digital contents using behavior. The methodology used was to take in depth look at the consumer with phenomenology as a qualitative research. We select 6 participants who have experience of digital content using. We also examine the structural configurations of the relationship between digital contents characteristics and illegal downloading intention. We surveyed 200 people who also had experience of digital content. This research gives theoretical and practical implication to the marketers related to online communication.

History-Aware RED for Relieving the Bandwidth Monopoly of a Station Employing Multiple Parallel TCP flows (다수의 병렬 TCP Flow를 가진 스테이션에 의한 대역폭 독점을 감소시키는 History-Aware RED)

  • Jun, Kyung-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.11B
    • /
    • pp.1254-1260
    • /
    • 2009
  • This paper proposes history-aware random early detection (HRED), a modified version of RED, to lessen bandwidth monopoly by a few of stations employing multiple parallel TCP flows. Stations running peer-to-peer file sharing applications such as BitTorrent use multiple TCP flows. If those stations share a link with other stations with only a small number of TCP flows, the stations occupy most of link bandwidth leading to undesirable bandwidth monopoly. HRED like RED determines whether to drop incoming packets according to probability which changes based on queue length. However it adjusts the drop probability based on bandwidth occupying ratio of stations, thus able to impose harder drop penalty on monopoly stations. The results of simulations assuming various scenarios show that HRED is at least 60% more effective than RED in supporting the bandwidth fairness among stations and at least 4% in utilization.

Efficient Content Sharing in Ad Hoc Networks (애드 혹 네트워크에서의 효율적인 콘텐츠 공유 방법)

  • Kang, Seung-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.2 s.46
    • /
    • pp.209-220
    • /
    • 2007
  • Mobile devices become a pak of our daily life due to their versatility, such as the wireless phone calls, the wireless accessibility to Internet, the display of multimedia content, and the communication with nearby mobile devices. Third generation telecommunication service provides an easy access to the Internet for nubile devices. Mobile users pay a fee charged by the telecommunication provider based on the amount of data transferred. This paper introduces a special ad hoc network in which mobile devices cooperate each other to download an interesting content from the Internet in order to reduce the telecommunication cost. The mobile devices, called the peers, in the ad hoc network are assigned a portion of the target file, and are responsible for downloading the portion using their 3G connection. Then, the peers exchange their downloaded portion with other participating peers using their cost-free ad hoc connection in order to reconstruct the whole content. According to the simulation results, large number of participating peers saves the telecommunication cost up to 90% with as few as 10 peers, although it slightly increase the overall content reconstruction time.

  • PDF

Real-time Classification of Internet Application Traffic using a Hierarchical Multi-class SVM

  • Yu, Jae-Hak;Lee, Han-Sung;Im, Young-Hee;Kim, Myung-Sup;Park, Dai-Hee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.859-876
    • /
    • 2010
  • In this paper, we propose a hierarchical application traffic classification system as an alternative means to overcome the limitations of the port number and payload based methodologies, which are traditionally considered traffic classification methods. The proposed system is a new classification model that hierarchically combines a binary classifier SVM and Support Vector Data Descriptions (SVDDs). The proposed system selects an optimal attribute subset from the bi-directional traffic flows generated by our traffic analysis system (KU-MON) that enables real-time collection and analysis of campus traffic. The system is composed of three layers: The first layer is a binary classifier SVM that performs rapid classification between P2P and non-P2P traffic. The second layer classifies P2P traffic into file-sharing, messenger and TV, based on three SVDDs. The third layer performs specialized classification of all individual application traffic types. Since the proposed system enables both coarse- and fine-grained classification, it can guarantee efficient resource management, such as a stable network environment, seamless bandwidth guarantee and appropriate QoS. Moreover, even when a new application emerges, it can be easily adapted for incremental updating and scaling. Only additional training for the new part of the application traffic is needed instead of retraining the entire system. The performance of the proposed system is validated via experiments which confirm that its recall and precision measures are satisfactory.