• 지식경영연구
• /
• 제17권1호
• /
• pp.113-133
• /
• 2016

Why illegal digital contents sharing happens? This study pays attention to the fact that file sharing is an exchanging behavior between people and it is expanding despite of an illegal behavior and proposes that it is necessary for the phenomenon to be understood from social cultural point of view beyond a personal dimension. Based on the social exchange theory, this study demonstrates effects of file sharing attitudes and continuity, regarding 'group norm', 'popular demand', 'reciprocity' and 'social solidarity' as main factors. The main findings of this study are as followed;- First, it is shown that a tacit agreement of a group on file sharing is a determinant of positive attitude to file sharing and the intent of continual file sharing. Second, it is not found that the social relationship factors that are regarded as potential influential factors on file sharing attitude have effects on file sharing behavior, except for 'group norm'. Unlike previous studies, the results may come from the fact that this study deals with an illegal behavior. The third finding indicates a structural relationship between social relationship factors. When members of a group have more amicable attitude to file sharing including silence or a tacit agreement on file sharing, more people ask illegal sharing of files that they need. Such public demand creates expectation of reciprocity. As reciprocity maintains, social connectedness is strengthened. Then, strong social connectedness escalates the intent to maintain file sharing. It is important to notice that this study promotes understanding of how digital contents sharing happens by structuring and demonstrating influential relationship between characteristic factors of the social relationship.

• 한국IT서비스학회지
• /
• 제7권3호
• /
• pp.47-70
• /
• 2008

File sharing technology is the most popular methodology through which consumers gain music from online. However, music file sharing and free downloads of music have caused terrible recession of traditional music industry. The purpose of this paper is to develop the underlying theory for understanding the acceptance of music file sharing technology and empirically test our theoretical model. We develop extended TAM model and explore the influencing factors on the user acceptance of music file sharing technology. Our study delivers a better understanding on consumers’ attitudes towards music downloads. By understanding the fundamental characteristics of technology that makes consumers enthusiastic, traditional music industry will gain managerial implications.

• 한국정보전자통신기술학회논문지
• /
• 제4권2호
• /
• pp.135-140
• /
• 2011

최근 수행되는 연구들에 따르면, 인터넷 관련한 에너지 소비는 날이 갈수록 증가하고 있는 추세이며, 이미 우리사회가 소비하고 있는 전체 에너지 소비량의 상당부분을 차지하고 있음을 알 수 있다. 이로 인해 현재 인터넷 프로토콜, 응용 프로그램 등의 개발에 있어서도 에너지 효율을 높일 수 있는 기법들이 중요한 연구이슈로 떠오르고 있다. 현재 네트워크에서 소비되는 에너지의 대부분은 개인용 PC나 데이터센터에서 발생하고 있으며, 특히 사용자 PC에서 소비되는 전력소비가 큰 비중을 차지하고 있다. 이에 본 논문에서는 사용자들이 P2P등 파일 다운로드 등을 목적으로 PC전원을 끄지 않고 있는 문제점에 착안, File sharing사용자들을 위한 서비스 품질은 그대로 유지하면서, 에너지 소비는 절감하기위한 File Sharing Proxying시스템을 기반으로 한 Green File Sharing아키텍처에 대해 기술하고자 한다. File sharing 사용자들로 하여금 다운로드 실행기능을 Proxy 시스템에 위임한 뒤 사용 중인 PC전원을 끄도록 함으로써, 에너지 소비효율을 향상시키는 기법이다. 특히 실험을 통해 Proxy 시스템을 기반으로 평균 파일공유시간을 획기적으로 줄이면서 에너지 소비효율을 50%이상 줄일 수 있음이 증명되었다.

• 정보처리학회논문지A
• /
• 제12A권6호
• /
• pp.493-498
• /
• 2005

P2P 서비스는 인터넷 상에서 서버를 거치지 않고 정보를 찾는 사람과 정보를 가진 사람의 컴퓨터간의 직접적인 연결을 통해 다양한 정보를 공유할 수 있는 방식으로, 파일의 자유로운 교환을 위한 방법으로 많은 인기를 얻고 있다. 그러나 P2P 파일 공유 시스템에서 서비스를 이용하는 모든 사용자들은 동등한 접근 권한으로 자유롭게 여러 사용자들의 공유 파일을 이용할 수 있기 때문에, 자신의 파일에 대한 공유 없이 다른 사용자들의 공유 파일을 다운로드만 하는 "free riding" 문제가 빈번하게 발생하고 있으며, 바이러스나 웜을 포함한 파일을 공유하거나 실제내용과 다른 제목을 가지는 파일을 공유하는 사용자라 하더라도 제한 없이 파일 공유 서비스를 이용할 수 있다. 이에 본 논문에서는 파일 공유서비스를 이용하는 사용자들의 신뢰도를 나타낼 수 있는 평판(Reputation) 정보를 이용하여 빈번한 다운로드를 행하는 "free rider"의 접근을 제한하고, 정상적인 실행이 되지 않는 파일을 공유한 사용자들에 대해서도 다른 사용자들의 공유 파일에 대한 사용을 제한하고자 한다.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.228-239
• /
• 2013

Peer-to-peer (P2P) systems have proved the most effective and popular file sharing applications in recent years. Previous studies mainly focused on equal service and differentiated service strategies when peers have no initial data before their downloads. For an upload-constrained P2P file sharing system, we model both the equal service process and the differentiated service process when the initial data distribution of peers satisfies some special conditions. Moreover, we show how to minimize the time required to distribute the file to any number of peers. The proposed fluid-based models can reveal the intrinsic relations among the initial data amount, the peer set size, and the minimum last finish time. The closed-form expressions derived from the extended models can closely approximate chunk-based models and systems, especially for relatively large files. As an application of the extended models, we show how to provide differentiated service efficiently to multiple peer sets. Since no limits are imposed on the upload bandwidth of peers or the size of each peer set, we believe that our analytic process and the results achieved can provide not only fundamental insights into bandwidth allocation and data scheduling but also a helpful reference for both improving system performance and building an effective incentive mechanism for P2P file sharing systems.

• 품질경영학회지
• /
• 제34권2호
• /
• pp.33-47
• /
• 2006

This study was designed to examine the casual relationships among trust evaluation factors, trust, customer satisfaction, and re-use intention in the P2P file sharing service. We applied structural equation model to test the hypotheses and research model. As a result of this study, trust evaluation factors affect trust and customer satisfaction and both of trust and customer satisfaction affect re-use intention respectively and significantly. Also trust affects customer satisfaction significantly. Specifically, trust was empirically confirmed as one of the important factors preceding customer satisfaction and re-use intetion in the P2P file sharing service. Therefore, this study shows that trust is important factor that P2P companies have to emphasize to raise user satisfaction and performance.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 춘계학술발표대회
• /
• pp.706-709
• /
• 2008

With the increasing popularity of P2P file sharing and advancement of mobile technologies, mobile P2P has revealed its attraction. Anonymity has become an increasing requirement in mobile networks. To reduce receiving garbage files, file validation and filtering are other requirements in the mobile P2P environment. If there are effective file filtering and validation mechanism, nodes' battery duration will be saved. In this paper, we do an analysis of security and anonymity in P2P file sharing and exchange system in mobile ad hoc environment, and propose a new efficient anonymous protocol, which can provide anonymity by broadcasting with a probabilistic algorithm and hiding real hop count information, the file validation by the file's special hash value and file filtering mechanism through the collaboration of middle nodes.

• 정보처리학회논문지A
• /
• 제17A권2호
• /
• pp.63-72
• /
• 2010

디지털 기술의 발달로 디지털 TV, 캠코더와 같은 멀티미디어 장치의 사용이 증가하고 있다. 이러한 장치들은 멀티미디어 파일 재생 및 녹화, 편집 등의 다양한 서비스를 제공하고 있다. 그 중 편집된 대용량 멀티미디어 파일을 저장하는데 있어, 기존 파일 시스템은 많은 시간과 디스크 입출력을 소요하는 성능상의 문제점을 갖고 있다. 본 논문에서는 앞서 언급한 문제를 해결하기 위한 기존 연구인 FWAE (Fast Writing after Editing) 기법보다 우수한 성능을 가진 리눅스 Ext2 파일 시스템 기반의 블록 링크 파일 시스템을 제안한다. 블록 링크 파일 시스템은 대용량 파일 편집저장 시, 실제 데이터의 입출력 없이, 메타데이터만을 수정한다. 또한, 멀티미디어 파일 간, 데이터 블록을 공유함으로써, 디스크 사용량을 줄일 수 있으며, 데이터 블록 공유 정보 관리가 기존 FWAE 기법보다 간단하여 시스템 오버헤드를 줄일 수 있다. 제안하는 파일 시스템은 Ext2 파일 시스템을 기반으로 하여 리눅스 환경에 구현하였으며, 유용성은 리눅스 Avidemux 편집 툴에 적용하여 검증하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1311-1326
• /
• 2010

Peer-to-peer (P2P) networks consume the most bandwidth in the current Internet and file sharing accounts for the majority of the P2P traffic. Thus it is important for a P2P file sharing application to be efficient in bandwidth consumption. Bandwidth consumption as much as downloaded file sizes is inevitable, but those in file search and bad downloads, e.g. wrong, corrupted, or malicious file downloads, are overheads. In this paper, we target to reduce these overheads even in the presence of high volume of malicious users and their bad files. Sybil attacks are the example of such hostile environment. Sybil attacker creates a large number of identities (Sybil nodes) and unfairly influences the system. When a large portion of the system is subverted, either in terms of the number of users or the number of files shared in the system, the overheads due to the bad downloads rapidly increase. We propose ELiSyR, a file search protocol that can tolerate such a hostile environment. ELiSyR uses social networks for P2P file search and finds benign files in 71% of searches even when more than half of the users are malicious. Furthermore, ELiSyR provides similar success with less bandwidth than other general efforts against Sybil attacks. We compare our algorithm to SybilGuard, SybilLimit and EigenTrust in terms of bandwidth consumption and the likelihood of bad downloads. Our algorithm shows lower bandwidth consumption, similar chances of bad downloads and fairer distribution of computation loads than these general efforts. In return, our algorithm takes more rounds of search than them. However the time required for search is usually much less than the time required for downloads, so the delay in search is justifiable compared to the cost of bad downloads and subsequent re-search and downloads.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.