Search

File sharing, streaming media, collaborative computing, and other P2P systems are all unicast to establish the corresponding overlapping network. The superimposed network is generally carried out based on the existing primary network. In this way, the access of each node is random. At the same time, this will cause the topological structure of the upper and lower layers to be inconsistent. This will increase the communication delay between nodes and cause an excellent bandwidth burden to the underlying network. The existing topology matching methods still face problems, such as poor scalability and long node aggregation time. This paper aims to design a topological distributed node aggregation method based on network coordination and distributed hash table (DHT) algorithm. This paper established a two-dimensional mesh model of nodes based on equal-distance concentric circles and divided into two equal areas. The parts of multiple namespaces correspond one by one according to their location. Because nodes are kept close, neighbours can be aggregated through DHT's primary "publish" and "search" primitives. Experimental results show that the TANRA method can match the network's topology under a slight delay and a large number of nodes. The TANRA method can effectively reduce the path delay in structured networks. [ABSTRACT FROM AUTHOR]

Copyright of Indonesian Journal of Business & Entrepreunership is the property of IPB University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Encryption methods had been widely used for secure data transmission and communication in both public and private organizations against intruders. Rivest-shamir-adleman (RSA) encryption algorithm is one of the most popular and efficient encryption schemes that has been in used for decades. Due to technological advancement and innovation, there is a threat to this algorithm. It is believed that introduction of quantum computer will break RSA algorithm easily. In view of this, it is pertinent to research into how RSA algorithm could be strengthened against all adversaries. This research aim at protecting client/server communication and file sharing by generating dynamic public and private keys. The proposed method was implemented in visual basic.net 2008. The result shows that dynamic keys do not affect the performance of the system and it is capable of protecting communication and file sharing between client/server. As the key generated keeps changing at an interval, it will difficult for most advance computer to factor any of the keys before another key is generated. This is the basis of the security of the proposed system. [ABSTRACT FROM AUTHOR]

This study examines the relationship between interest rate and defunct platform risk of China's peer-to-peer (P2P) lending platforms. P2P lending provides an alternative funding source for individuals and micro-enterprises and offers a new investment tool for households. But the frequent collapses of many platforms were huge losses to market participants and even led to a decline in China's P2P lending industry. In this study, weekly data of 76 platforms from December 3, 2017, to October 6, 2019, are employed, and empirical research based on the normal and skew-normal panel data model respectively is conducted. Statistical indicators prove that the skew-normal panel data model is preferable to another one in modeling the data set of interest rates. The empirical results show that China's P2P market is efficient overall. But the positive correlation between the interest rate and risk is not significant for platforms with excessively high interest rates, whose interest rates are more determined by the types of ownership. The findings and implications are provided in the end. [ABSTRACT FROM AUTHOR]

Construction projects' performance is not self-regulating. Therefore, a continuous progress tracking and monitoring process is highly demanded to avoid potential deviations or misalignments. The current practice for the progress tracking and monitoring process suffers from heavily intermediated workflows, human errors, transfer latencies, inaccuracies, and/or information holes. Such issues could gradually lead to severe delays or even complete project failure. This research introduces a novel Peer-to-Peer (P2P) system that relies on Blockchain Technology (BT) and Inter-Planetary File System (IPFS) for managing progress information and as-built digital assets or files. The system is developed based on a three-step approach. First, two chaincodes are formulated for mapping and governing the data operations. Second, a private blockchain network is configured based on Hyperledger Fabric as a hosting platform, including the relevant stakeholders. Third, a private IPFS network is configured and coupled with a cluster service to manage and distribute the off-chain visuals and as-built digital assets. A case study for a non-residential construction project is utilized to test and verify the system's practicability and assess its performance. The research significance is anticipated in diverse practical areas, including but not limited to; boosting coordination and trust among stakeholders, tracing progressive elaboration of As-built digital assets, accelerating incremental payments processing, assessing overall project performance and on-site productivity, supporting delay analysis and claim/dispute management, and streamlining data flow between the construction phase and the operation and maintenance phase. Further, the system's future is mapped by evolving it as a sub-unit in a more advanced data model. [ABSTRACT FROM AUTHOR]

Blockchain is often compared to the internet as a disruptive technology that will realign economic structures across the world. This analogy extends to law and regulation. Similar to internet-based services, digital assets raise a host of challenges for policymakers. They also pose general questions regarding the desirability and practicality of regulating decentralized systems. Such debates play out against a backdrop of concerns that regulatory action will chill innovation or push market activity to more tolerant jurisdictions. The story of internet policy in the late 1990s and early 2000s therefore provides important lessons for policymakers today when confronting digital assets. Two incidents are of particular significance: the Clinton administration’s 1997 Framework for Global Electronic Commerce and the judicial effort to address peer-to-peer (P2P) file sharing. The early internet regulatory debates demonstrated that action by all three branches of government was important to resolve uncertainties and distinguish legitimate from illegitimate market activity. The history illustrates that policymakers have many tools at their disposal beyond direct prohibitions or exclusions from requirements. Claims that regulation is inherently impossible or damaging to market development are generally overblown. Focusing on policy objectives, rather than starting from traditional categories that were historically developed based on those objectives, will help policymakers develop appropriate rules for novel digital asset markets such as decentralized finance (DeFi). [ABSTRACT FROM AUTHOR]

We are currently witnessing a global increase in the provision of software platforms and services, offered at «no cost» by large corporations, to higher education. The business model behind these services is largely based on the collection and analysis of massive quantities of user data and metadata, collected through educational packages, which include e-mail, videoconferencing, groupware, file sharing, and other integrated services. The penetration of these services in higher education worldwide is largely unknown. In this study we discuss a methodology and a software script developed to collected new data for all 448 public higher education institutions in all 13 countries in South America. The data show that for every ten higher education institutions in the region, eight have services and platforms offered by such businesses. We contend that the adoption of these services is largely due to disinvestment in public education, and threaten the operational autonomy of institutions in regards to research and teaching, while leading to concerns in regards to data control, privacy, and transparency for teachers, administrators and students. [ABSTRACT FROM AUTHOR]

Copyright of Pixel-Bit, Revista de Medios y Educacion is the property of Pixel-Bit, Revista de Medios y Educacion and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

There have recently been extensive studies on proportional response protocol, which is motivated by the successful BitTorrent system for file sharing over a P2P network. The proportional response protocol has been proved to be strategy-proof against weight cheating attacks and edge cheating attacks, in order to allocate a single type of resource on P2P networks. This strategy-proof property holds due to an elegant combinatorial structure: the bottleneck decomposition of the underlying network structure, and the utility function, defined as the total resources that one agent receives from its neighbors. However, Sybil attacks, under which an agent may form several fictitious players and split its resource among them, have been shown as a more difficult attack to defend against, and thus a strategic agent playing Sybil attacks may result in personal gain. Previous efforts have been made to show that an agent may generate a gain, but with limited gains by Sybil attacks on several special networks, including trees, cliques, and rings. This paper is the first to study the agent's incentives by adopting a Sybil attack on general networks. The main contribution is to prove that any agent cannot obtain more than three times as much as the revenue when it plays honestly. [ABSTRACT FROM AUTHOR]

In this paper, we study a new type of fuzzy relation system called fuzzy relational inequalities with addition-min-product composition operations to model a peer-to-peer (P2P) file sharing system. Some properties of this addition-min-product system are investigated. We then characterize the structure of the solution set. Furthermore, to reduce the network congestion and improve the stability of data transmission, a min–max programming problem with constraints of addition-min-product fuzzy relation inequalities is established and investigated. We divide this min–max programming problem into several subproblems with the constraint of a single equation. Based on the optimal solutions to these subproblems, we can solve the original fuzzy relation min–max programming problem. Two algorithms, with polynomial computational complexity, are developed to search for an optimal solution to our studied problem. The validity of the algorithms is examined through a numerical example. [ABSTRACT FROM AUTHOR]

The Internet of Things is enriching our life with an ecosystem of interconnected devices. Object cooperation allows us to develop complex applications in which each node contributes one or more services. Therefore, the information moves from a provider to a requester node in a peer-to-peer network. In that scenario, trust management systems (TMSs) have been developed to prevent the manipulation of data by unauthorized entities and guarantee the detection of malicious behaviour. The community concentrates effort on designing complex trust techniques to increase their effectiveness; however, two strong assumptions have been overlooked. First, nodes could provide the wrong services due to malicious behaviours or malfunctions and insufficient accuracy. Second, the requester nodes usually cannot evaluate the received service perfectly. For this reason, a trust system should distinguish attackers from objects with poor performance and consider service evaluation errors. Simulation results prove that advanced trust algorithms are unnecessary for such scenarios with these deficiencies. [ABSTRACT FROM AUTHOR]

With the increasing number of fibre access users, P2P file sharing download traffic has gradually become one of the enormous bandwidth consumptions for the access network. Localizing traffic could save bandwidth and reduce latency, but it caused optical line terminal (OLT) overload problems. A cloud‐edge collaboration technology (IRS‐CECT) based P2P redirection strategy is proposed for this problem. OLT assumes the role of the cloud computing centre in the strategy. Optical network unit (ONU) serves as an edge computing node to share traffic load for the cloud computing centre. ONU intercepts the upstream query packets for OLT. This strategy can reduce the problem of OLT overload caused by increasing users. Simulation results indicate that the IRS‐CECT strategy can reduce the delay by nearly half and reduce the traffic load on the cloud computing centre OLT. [ABSTRACT FROM AUTHOR]

The article discusses a research study conducted to unravel the reasons piracy thrives in the Nigerian environment in the face of a virile copyright law meant to protect the rights of copyright holders, punish infringers and defaulters of the law. It also analyzes factors responsible for the high level of piracy in Nigeria. Due to technological advancement, the Piracy business has become sophisticated and global in nature and scope.

Peer-to-peer (P2P) content distribution and file sharing systems aim to facilitate the dissemination of large files over unreliable networks. Network coding is a transmission technique that has captured the interest of researchers because of its ability to increase throughput and robustness of the network, and decrease the download time. In this survey paper, we extensively summarize, assess, compare, and classify the most recently used techniques to improve P2P content distribution systems performance using network coding. To the best of our knowledge, this survey is the first comprehensive survey that specifically focuses on the performance of network coding based P2P file sharing systems. [ABSTRACT FROM AUTHOR]

Peer-to-peer (P2P) networks play an important role in communication and resource sharing. In recent years, the importance of(P2P) networks has increased due to their scalability and simple, cost-efficient model. P2P file-sharing systems with decentralized file storage have emerged to allow peers to share resources and download files directly from one another. However, one major problem hindering the success of these services is a type of behavior called free-riding, in which a peer consumes system resources for free without sharing anything in return. In this article, we propose an approach based on points for overcoming the effect of free-riding. To evaluate the performance of our proposed algorithm, we compared it to the original BitTorrent protocol. The simulation results show that the proposed algorithm provides fairness between peers and prevents free-riders from downloading files when they reach the credit limit. [ABSTRACT FROM AUTHOR]

The article presents an analysis of the impact of peer-to-peer (P2P) computer file sharing on the music and motion picture industries. The drop in sales of compact discs (CDs) and DVD-Video discs after 1999 has been largely attributed to internet piracy facilitated by P2P technology. Information on how industry efforts to intensify copyright law enforcement have had a positive effect on the stock prices of the firms involved is presented. The question of whether the pre-P2P entertainment media business model has been rendered obsolete is also addressed.

Peer-to-peer (P2P) networks play an important role in communication and resource sharing. In recent years, the importance of(P2P) networks has increased due to their scalability and simple, cost-efficient model. P2P file-sharing systems with decentralized file storage have emerged to allow peers to share resources and download files directly from one another. However, one major problem hindering the success of these services is a type of behavior called free-riding, in which a peer consumes system resources for free without sharing anything in return. In this article, we propose an approach based on points for overcoming the effect of free-riding. To evaluate the performance of our proposed algorithm, we compared it to the original BitTorrent protocol. The simulation results show that the proposed algorithm provides fairness between peers and prevents free-riders from downloading files when they reach the credit limit. [ABSTRACT FROM AUTHOR]

Considering the requirement of biggest download speed of the terminals, a BitTorrent-like Peer-to-Peer (P2P) file sharing system can be reduced into a system of max-min fuzzy relation inequalities. In this paper we establish an evaluation model by the satisfaction degree, for comparing two arbitrary potential solutions of such system. Besides, based on the evaluation model, concept of approximate solution is defined. It is indeed a potential solution with highest satisfaction degree. Furthermore, effective algorithm is developed for obtaining the approximate solutions to inconsistent system. Numerical examples are provided to illustrate our proposed model and algorithm. [ABSTRACT FROM AUTHOR]

The BitTorrent (BT) is a peer-to-peer (P2P) file sharing protocol that was developed approximately 20 years ago, is becoming increasingly popular, and has been widely accepted. The BT-based mass deployment system can be used to improve performance and scalability that cannot be achieved by the unicasting, broadcasting, and multicasting protocols. However, when the BT-based system is applied in massive deployments, a major issue related to insufficient temporary storage space to store the whole system image before deploying needs to be resolved. Such problems arose because the system is deployed to the disk space, meaning that it cannot be used for temporary storage. Therefore, a novel BT-based solution that can remove the limitations caused by the insufficient temporary storage issue is proposed. The BT-based mass deployment system was designed by using the file system blocks transferring (FSBT) mechanism. The receiver of the FSBT mechanism can obtain the blocks of the file system from other peers. Then, those blocks will be written directly to raw disks or partitions. The sender of the FSBT mechanism can read the blocks of file systems directly from raw disks or partitions. Then, the blocks can be sent to other peers. This approach solves the insufficient temporary storage issue. The novel BT-based mass deployment system was tested and verified for the configuration consisting of at most 32 personal computers (PCs). To demonstrate the achievable performance of the novel BT-based system, comparisons were made between the novel program and the traditional multicast solutions, as well as other solutions for mass deployment. The proposed BT solution can be much faster than the multicast solution when deploying 11 machines or more. The experimental results demonstrated the feasibility and superior performance of the proposed system. Furthermore, performance comparisons of the proposed BT-based mass deployment system versus other solutions demonstrated the feasibility and efficiency of the proposed solution. In the future, the BT parameters can be further optimized, and the simultaneous read and write features can be implemented to improve the deployment performance. In addition, the BT-based mass deployment system can serve as the basis for the development of other mass deployment systems. [ABSTRACT FROM AUTHOR]

Abstract Contemporary e-commerce platforms enable the exchange of idle resources among private individuals directly from peer to peer. The success of peer-to-peer sharing platforms largely depends on the capability of platform providers to understand the users' motives for engagement. To investigate the relative importance of consumer motives for and against peer-to-peer sharing, we develop a theoretical model based on a comprehensive set of potential consumer motives. We validate our model by means of a survey among 745 participants. Our findings suggest financial benefits, trust in other users, modern lifestyle, effort expectancy, and ecological sustainability as the five most important drivers and prerequisites of platform usage intentions. Based on our findings, we suggest directions for future research on peer-based sharing and discuss implications for both theory and practice. Highlights • Overview of user motives for taking part or evading peer-to-peer sharing (PPS). • Development of a corresponding survey-based measurement model. • Identification of the strongest motives for and against PPS usage intentions. • (+) Financial benefits, trust in other users, and modern lifestyle. • (−) Effort expectancy, independence through ownership, and process risk concerns. [ABSTRACT FROM AUTHOR]

Author's rights and copyright law have gone through quite a few changes in the 'post-print' culture of binary systems, digital formations and techno-practices. Technological development supports new concept of author's rights by promoting free internet and digital market, as well as new contemporary experience of culture that is being rooted in digital technology, mass communication and the world of multimedia and virtuality. Though computer and digital technology have served both authors and users in various ways, they have also served as a very fertile ground for sharing copyrighted content thus leading to numerous copyright infringements and conflicts with the copyright law. The aim of this paper is to identify and analyze the ways in which computer and digital technology have given rise to new trends in the production (e.g. remix culture) and consumption (e.g. peer-to-peer file sharing technology) of culture, but also to determine how new forms of distribution, use and sharing of digital content changed and shaped the perception of authorship in the 21st century. In order to analyze the dynamic, nature and structure by which new digital and networking technologies are affecting the concept of authorship and author's rights and to test the consistency of previously established hypotheses, we conducted a survey amongst general public. Altogether 535 questionnaires were completed. Data was analyzed using SPSS tool and quantitative method of analysis. In the analysis special attention was given to both, the concept of authorship in the digital environment and the concept of peer-to-peer file sharing technology as not so new, but still very popular networked architecture for distributing, using and sharing digital content. Results have shown that most of the respondents use peer-to-peer file sharing technology to access, consume and/or share different cultural content (e.g. movies, music, books, etc.) while violating the rights of copyright holders. That is one of the main reasons why copyright holders and creative industry constantly find new ways to fight peer-to-peer networking technology, especially commercial file sharing, thus sometimes restraining cultural production and even technological development. This leads to conclusion that this new dynamic, decentralized and distributed networked environment grounded in digital democracy and participating culture of prosumers asks for new legal initiatives and solutions. The research shows that the basic understanding of authorship and the right's of authors and other creative workers in the context of Internet culture and digital media hasn't changed a lot, but, by reason of new available digital means of production and tools of consumption, users attitudes, habits and practices towards them have. To resolve this conflict, law needs to find new mechanisms

The article presents abstracts of articles published elsewhere in the issue, including "The Impact of Illegal Peer-to-Peer File-Sharing on the Media Industry," by Sanjay Goel, Paul Miesing, and Uday Chandra; "Building Sustainable High-Growth Startup Companies: Management Systems as an Accelerator," by Antonio Davila, George Foster, and Nina Jia; and "Open Innovation and the Stage-Gate Process: A Revised Model for New Product Development," by Johan Grönlund, David Rönnberg Sjödin, and Johan Frishammar.

Sustainable business models are intended to create economic value while benefitting the environment and society. Their wider adoption and diffusion is necessary to tackle pressing societal problems. How they are implemented and what determines their success (or lack thereof) in the market is not yet well understood, however, and deserves further exploration. To help fill the gap in knowledge, this study examines an emerging and innovative type of sustainable business model based on the peer-to-peer (P2P) sharing of underutilised assets facilitated by digital platforms. Its aim is to identify possible reasons for their commercial success or failure. In particular, the study investigates the values of users of a successful P2P goods-sharing platform and to what extent they differ from values of users of a comparable, yet unsuccessful, platform. Previous research on a UK-based online marketplace, Ecomodo, measured people's motivations for joining and the value priorities of users using Schwartz's Portrait Value Questionnaire. Results were compared with data from a representative sample of the UK population and used to explain the platform's low market uptake. The same study is here replicated with members of Peerby, an online marketplace where people rent, lend and borrow their possessions with each other. The analysis shows similar value priorities and orientation in Ecomodo and Peerby respondents, which suggests that the failure of the former platform and the success of the latter may be more directly attributed to differences in their business model design and execution than the types of user. [ABSTRACT FROM AUTHOR]

Device-to-device (D2D) communications are not only featured by high spectral and energy efficiency, but also offer appealing benefits for applications, such as message dissemination, traffic offloading, and coverage expansion. In this paper, we consider a message dissemination scenario where a base station (BS) can direct message requests to be fulfilled by some source devices via D2D communications and thereby save the resource cost. Furthermore, a source device may be subject to a cost budget due to its limited resources. To minimize the overall cost or maximize the BS's cost saving from offloading, it is essential to properly assign the message request(s) for each source and decide the payment to incentivize participation. The request direction is an NP-hard problem, while the payment determination is also nontrivial. The payment should be sufficient to compensate for a source device's resource cost, and meanwhile, incentivize the source to truthfully declare its private cost and budget. Modeling the problem as a reverse auction, we develop both a deterministic mechanism and a randomized mechanism, which are truthful or truthful in expectation, respectively. Both mechanisms are individually rational and subject to a computational complexity lower than that of the well-known Vickrey–Clarke–Groves mechanism or its generalized version. While the deterministic mechanism performs well in an average sense, the randomized mechanism maintains an approximation guarantee for the worst case. Extensive numerical results demonstrate the effectiveness of the proposed mechanisms with various settings in the D2D content distribution scenario. [ABSTRACT FROM PUBLISHER]

Peer-to-Peer (P2P) applications especially in the domain of file sharing have become very popular during the past few years. These applications have huge traffic volume on the Internet as compared to any other application. In this paper, we propose a mobile P2P file-sharing framework that uses dedicated Session Traversal Utilities for NAT (STUN) servers for Network Address Translation (NAT) traversal. In our case, we divide the nodes into two types: Node Peers (mobile applications) and Super Peers (dedicated servers connected to a fixed P2P network). We develop the proposed framework for Android operating system and test it on a 3rd Generation (3G) network testbed. The experimental results obtained are quite positive and support the implementation of the system. [ABSTRACT FROM AUTHOR]

This communication presents the results of the first field measurement campaign to characterize the large- and small-scale propagation statistics of the peer-to-peer wireless link in an operating petroleum refinery. Results for ground level transmission and transmission between ground level and devices mounted 18 m from the ground on a distillation stack are included. The measurements characterize the 20-MHz $2 \times 1$ multiple-input, single-output channel at 2.45 GHz. Analysis of the measurement data reveals an environment with severe small-scale fading and multipath dispersion but very mild large-scale signal attenuation given the level of obstruction on the links. [ABSTRACT FROM PUBLISHER]

Due to the loosely coupled property of cloud computing environments, no node has complete knowledge of the system. For this reason, detecting a Sybil attack in cloud computing environments is a non-trivial task. In such a dynamic system, the use of algorithms based on tree or ring structures for collecting the global state of the system has unfortunate downsides, that is, the structure should be re-constructed in the presence of node joining and leaving. In this paper, we propose an unstructured Sybil attack detection algorithm in cloud computing environments. Our proposed algorithm uses one-to-one communication primitives rather than broadcast primitives and, therefore, the message complexity can be reduced. In our algorithmic design, attacker nodes forging multiple identities are effectively detected by normal nodes with the fail-stop signature scheme. We show that, regardless of the number of attacker nodes, our Sybil attack detection algorithm is able to reach consensus. [ABSTRACT FROM AUTHOR]

Peer-to-peer video on demand (P2P-VoD) is a solution to provide video service to a large number of users on the Internet. Due to the upload bandwidth bottleneck of VoD servers, the streaming capacity in the P2P-VoD system is limited. This paper proposes a new mechanism to improve the video streaming in P2P networks by using the idle peers upload bandwidth and storage, which are called helpers. The proposed method uses an XOR mechanism in the VoD server to encode chunks and reduce bandwidth use. The helpers receive encoded chunks from the VoD server and save them in their storage spaces and cooperate in sharing these chunks with the other peers. Simulation results using OMNET++ are provided to show the efficiency of the proposed mechanism in terms of the required upload capacity requirement of the server and deploying the storage and bandwidth of helpers. The results of simulation show that the upload bandwidth usage of the server has been reduced. On the other hand, the proposed method increases the memory usage of helpers. [ABSTRACT FROM AUTHOR]

Crowdsourced research sharing takes place across social media platforms including Twitter hashtags such as #icanhazpdf, Reddit Scholar, and Facebook. This study surveys users of these peer-to-peer exchanges on demographic information, frequency of use, and their motivations in both providing and obtaining scholarly information on these platforms. Respondents also provided their perspectives on the database terms of service and/or copyright violations in these exchanges. Findings indicate that the motivations of this community are utilitarian or ideological in nature, similar to other peer-to-peer file sharing online. Implications for library services including instruction, outreach, and interlibrary loan are discussed. [ABSTRACT FROM AUTHOR]

The article examines the copyright regime in Hong Kong, China, as of December 2016. Topics discussed include copyright protection in the digital environment; challenges caused by peer-to-peer file-sharing technology; proposal for a moratorium on lawsuits against individual Internet users based on noncommercial copyright infringement; and need of laws to protect interests of Internet users.

In peer-to-peer (P2P) networks, each peer acts as the role of client and server. As a client, each peer is regarded as a service customer. It sends requests to other peers to download files and obtains resource allocation from them. As a server, each peer is thought as a service provider. It receives service requests from other peers and allocates its resources to them. To encourage cooperation between peers, fairness is very important in P2P networks since it fosters an incentive to the peers to offer resources to the network. We formulate a fair resource allocation model for P2P networks and investigate the utility optimization problem by Lagrangian method. In order to realize the optimal resource allocation, we present a novel price-based resource allocation scheme by applying the first order Lagrangian method and low-pass filtering scheme, so that a service provider can allocate its resources to its customers based on offered prices, achieving the efficient and fair allocation of the available resources to the serviced customers. Simulation results confirm that the proposed algorithm can achieve the optimum within reasonable convergence times. [ABSTRACT FROM AUTHOR]

Digital music services have provided more and more digital contents and service styles. The number of people paying to download music is on the rise. Digital music files, mainly in MP3 format, have become widespread on the internet. Downloading digital products for free may harm creators and music publishers, because it is very easy to obtain free-music through peer-to-peer sharing technologies over the internet. At the same time, portable entertainment devices and mobile phones are now able to carry music files, enabling people to access music much more easily. On the other hand, with the coming of the 5G in the telecom infrastructure, the rise in downloading music using mobile devices becomes possible. People can access online-music platform services through cable/ADSL with their digital devices (e.g., Personal computer, Notebook and Smart phone) or through the telecom services accompanying their mobile devices. Therefore, a critical issue for record publishers, or digital music service providers, is how to provide services to create value and fulfill customer needs. By determining customer music service needs and intentions, this study identifies the selection criteria necessary for customers to evaluate and select digital music service platforms. A novel MCDM (Multiple Criteria Decision Making) technique is developed that integrates the Decision making Trial and Evaluation Laboratory (DEMATEL), Principal Component Analysis (PCA), Analytical Network Procedure (ANP), and VlseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR). This technique ranks and improves the digital music service platforms to obtain the best win-win service selection. This paper will propose the key driving aspects of the digital music service platforms and rank them by using the model proposed. The conclusions are composed of suggestions for service providers to improve their existing functions and plan further utilities for the digital music service platforms. [ABSTRACT FROM AUTHOR]

In peer-to-peer (P2P) file sharing networks, it is common practice to manage each peer using reputation systems. A reputation system systematically tracks the reputation of each peer and punishes peers for malicious behaviors (like uploading bad file, or virus, etc). However, current reputation systems could hurt the normal peers, since they might occasionally make mistakes. Therefore, in this paper, we introduce forgiveness mechanism into the EigenTrust reputation system to reduce such malicious treatments and give them opportunities to gain reputation back. Particularly, we take four motivations (the severity of current offence, the frequency of offences, the compensation and the reciprocity of the offender) into consideration to measure forgiveness. The simulation work shows that the forgiveness model can repair the direct trust breakdown caused by unintentional mistakes and lead to less invalid downloads, which improves the performance of P2P file sharing systems. [ABSTRACT FROM AUTHOR]