• Knowledge Management Research
• /
• v.17 no.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.

• Journal of Information Technology Services
• /
• v.7 no.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.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.2
• /
• pp.135-140
• /
• 2011

Currently, studies have show that the network related energy consumption are increasing. and part of overall energy consumption of our society are too. So, that is important to look for energy-efficient network applications and protocols. A most of network energy consumption are due to network edge devices. in this paper, in order to cut down the emissions of carbon dioxide from ICT business, which contributes 2% of the global energy consumption, it is necessary to understand energy consumption in peer-to-peer system. In this paper, in this paper we propose a architecture based on the introduction of a p2p proxy. The model is analyzed analytically and numerically to reveal how these factors influence the overall power consumption in both steady state and flash crowd information exchange scenarios. Specifically, our results show that the proxy-based solution can provide up to 50% reduction in the energy consumption and, at the same time, a significant reduction in the average file download time.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.493-498
• /
• 2005

P2P service is a method that can share various information through direct connection between computer of a person who have information and a Person who have information without server in the Internet and it is getting a lot of popularity by method for free ex change of file. P2P file sharing systems have become popular as a new paradigm for information exchange. Because all users who use service in P2P file sharing system can use shared files of several users freely by equal access privilege, it is happening the 'free rider' that only download shared file of other users without share own files. Although a user share a malicious file including virus, worm or file that have title differing with actuality contents, can use file sharing service without limitation. In this paper, we propose a method that restrict access of 'free rider' that only download using reputation information that indicate reliability of user. Also, we restrict usage ons hared file of other users about users who share harmful file.

• Journal of Communications and Networks
• /
• v.15 no.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.

• Journal of Korean Society for Quality Management
• /
• v.34 no.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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• 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.

• The KIPS Transactions:PartA
• /
• v.17A no.2
• /
• pp.63-72
• /
• 2010

Recently, the need for multimedia devices, such as digital TV, and camcorder has increased. These devices provide many services on multimedia files such as playing, recording, and editing. Throughout these services, in case of storing edited large-scaled multimedia files, existing file system have several capability problems that are taking too much time and requiring disk I/O. In this paper, we propose the use of Linux Ext2 file system based 'Block-Link file (BL-file) system' in order to solve these problems. For the BL-file system, when editing and storing large-scaled files, there is no data input or output but only modification of the metadata. Additionally, by sharing data blocks between multimedia files, we can save disk spaces. Moreover, because the managing of data block sharing information is more convenient than the existing FWAE technique, we can lessen system overhead. The BL-file system is based on Ext2 file system and implemented in a Linux environment, and the usefulness of the proposed technique is validated by applying the Linux multimedia file-editing tool 'Avidemux'.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.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)
• /
• v.4 no.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.