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]

In order to guarantee the downloading quality requirements of users and improve the stability of data transmission in a BitTorrent-like peer-to-peer file sharing system, this article deals with eigenproblems of addition-min algebras. First, it provides a sufficient and necessary condition for a vector being an eigenvector of a given matrix, and then presents an algorithm for finding all the eigenvalues and eigenvectors of a given matrix. It further proposes a sufficient and necessary condition for a vector being a constrained eigenvector of a given matrix and supplies an algorithm for computing all the constrained eigenvectors and eigenvalues of a given matrix. This article finally discusses the supereigenproblem of a given matrix and presents an algorithm for obtaining the maximum constrained supereigenvalue and depicting the feasible region of all the constrained supereigenvectors for a given matrix. It also gives some examples for illustrating the algorithms, respectively. [ABSTRACT FROM AUTHOR]

In order to guarantee the downloading quality requirements of users and improve the stability of data transmission in a BitTorrent-like peer-to-peer file sharing system, this article deals with eigenproblems of addition-min algebras. First, it provides a sufficient and necessary condition for a vector being an eigenvector of a given matrix, and then presents an algorithm for finding all the eigenvalues and eigenvectors of a given matrix. It further proposes a sufficient and necessary condition for a vector being a constrained eigenvector of a given matrix and supplies an algorithm for computing all the constrained eigenvectors and eigenvalues of a given matrix. This article finally discusses the supereigenproblem of a given matrix and presents an algorithm for obtaining the maximum constrained supereigenvalue and depicting the feasible region of all the constrained supereigenvectors for a given matrix. It also gives some examples for illustrating the algorithms, respectively. [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]

Biological dosimetry is used to estimate one's dose by biological phenomena. The most popular and 'gold standard' phenomenon is the appearance of dicentric chromosomes in metaphases. The metaphase finder is a tool for biological dosimetry that finds metaphase cells on glass slides. It consists of an automated microscope, auto-focus system, X-Y stage, camera and computer. It does the image analysis of the microscopic images of the glass slides and displays the positions of metaphase cells. In this paper, the author reported that the prototype of AI-implemented metaphase finder was combined with the microscope system by file sharing and image transfer program, and that the metaphase finder system's accuracy was compared with previous non-AI system, using the same samples. [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]

A Peer-to-peer (P2P) network system has proved to be a popular and efficient approach for large-scale live video streaming and file sharing over the Internet. Such a system is always challenged by various issues and requires to be monitored and controlled for significant performance. Among them, one of the major performance issues in P2P networks is the flash crowd. When many users switch to a popular channel in a short span of time, the P2P system suffers from a serious join congestion problem, called the flash crowd problem. In such situations, systems can scale only up to a limit, both by available surplus bandwidth and intense competition among peers for their start-up, and hence, it not only decreases the efficiency but also creates a blockage of services for connected peers. Therefore, management of the flash crowd has been important and becoming paramount with the increased use of online services and the proliferation of various technologies like IoT, Edge & Mobile Computing, Crypto Currencies, and Torrenz-like services. A hierarchy-based admission control model with multiple threshold layers is proposed to mitigate the flash crowd in the P2P network paradigm. A fuzzy logic-based prediction mechanism is proposed to predict the control scheme applicable to the requested peers based on the parameters such as buffer size, bandwidth, etc. In case of the occurrence of the flash crowd, the model applies different control schemes depending upon which threshold layer it is predicted. These include saving the system resources, granting preferences to best-performing peers, dropping requests of worst-performing peers, a slight decrease in service quality, etc. We also characterize the credit score of peers, which denotes their performances. The model is simulated in OMNET++ along with the OverSim framework. Results from the simulation reveal a reduction in request drops, processing delays, and startup delays compared to other management schemes. [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]

Peer-to-Peer (P2P) networks is a distributed structure, which is widely used in file sharing, distributed computing, deep search engines. Each node plays the dual role of client and server, which makes the P2P network further exacerbates the insecurity of P2P systems. For the behavior of nodes in P2P systems, requesting nodes are abstracted into customers and service nodes are abstracted into servers. An M/M/c queueing model is developed with dynamically changing servers in almost unobservable cases, strategies are introduced, including start-up period, working sleep of service nodes and negative customers, etc. Using the matrix-geometric solution and Gauss-Seidel iteration method, average waiting length, average sojourn time, total energy consumption and throughput are derived. Through numerical experiments, the process of P2P file sharing is simulated, the optimal value of social utility is obtained using Nash equilibrium and social optimal strategy, and a theoretical basis is provided for node scheduling in P2P systems. [ABSTRACT FROM AUTHOR]

At school, we encounter different types of violence, but most often it is peer violence. In this paper, we present the definition of peer-to-peer violence and its most common forms. In the theoretical part of the paper, we focus on peer violence in the first grade, which as a long-term teacher of the first grade I encounter the most. In a practical example, we present the methods and forms of work that we used in the 1st grade and that proved to be successful in our work. The successful prevention of violence requires creation of positive bonds between students and creation of a sense of co-responsibility in resolving conflicts, as well as cooperation of the entire team, knowledge of professional guidelines and good support from the counseling service. We can help each other with advice, protocols, literature, and general laws. It is important that we all realize that violence exists and that when we detect it, we deal with it effectively. [ABSTRACT FROM AUTHOR]

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]

Peer-to-peer sharing has become increasingly popular in recent years. Many digital platforms exist that allow individuals to use others' belongings part-time. These platforms explicitly mention their green credentials, as the environmental benefits of such sharing initiatives are often taken for granted. However, there is a recent empirical literature showing evidence of the contrary. We propose a theoretical framework to analyze the economic and environmental implications of peer-to-peer sharing. We present a stylized model where a monopolist supplies a product that is suitable for rent on a sharing platform. Interestingly, we find that the existence of such a platform is typically beneficial for the monopolist, especially in the long run, when she can optimally anticipate the effects of her decisions on the sharing market. Such a scenario may not be beneficial for consumers, especially for those who rent the good rather than buy it. Moreover, the existence of the sharing platform induces higher use and (under some likely conditions) larger production levels and shorter product lifespans. The combination of these three aspects contributes to a worse environmental impact with sharing, which provides a theoretical rationale for the aforementioned empirical studies. [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.

This study examines the nature of temporary disposition and acquisition in the context of online peer-to-peer (P2P) renting. Although renting is becoming increasingly popular, little is known about the phenomenon as practised between peers. P2P renting is a form of non-ownership access that enables renters to temporarily access goods, but also provides those that rent the ability to temporarily dispose of their possessions. Theoretically driven thematic analysis identifies that P2P renting is characterised as a self-service exchange with extensive co-creation and a balanced market-mediated exchange involving short-term intermittent transactions driven by a desire for community, inspired by political consumerism. However, fear of negative reciprocity, the high-involvement nature of the transaction, limited access to products and the inflexible nature of P2P rental sites impede the practice. Having a better understanding of current attitudes towards P2P renting may help with the design of future online P2P systems. [ABSTRACT FROM PUBLISHER]

Peer-to-peer systems (P2P) have enjoyed great popularity in terms of sharing content in distributed environments. In mobile P2P networks, how to improve the efficiency of the resource lookup has been an important topic of research. Among the existing solutions, we find lookup mechanisms based on data replication that can increase data availability and reduce search latency. On the other side, these solutions have certain limits such as in the selection of resources to be replicated and in increasing the storage space of peers with additional data. Therefore, this work ZRR-P2P (Zone-based mechanism for data Replication and Research optimization in P2P) comes with the aim of partitioning the network zone on sub-zones and of replicating popular data shared in the network. Thus, in order to improve the research process without increasing storage space of peers. The simulation results show that our strategy manages to increase data availability and improve the search process in terms of hops count and search latency, while avoiding increasing the storage space of peers. [ABSTRACT FROM AUTHOR]

An efficient searching algorithm in the absence of control over the object locations is a challenging issue in the design of unstructured peer-to-peer (P2P) networks. In this paper, we report files searching constraints in the unstructured P2P systems. Hence, we exploit learning automata adaptive probabilistic search (LAAPS) algorithm for those constraints which are distributed entirely with adequate bandwidth. LAAPS optimize the learning automata using file container nodes which are leveraged with the types of file. In the simulation, we compare the proposed algorithm with the random probabilistic walk, adaptive search algorithm, and improved adaptive probabilistic search algorithm. The numerical result demonstrates that LAAPS improves the number of hits per query, achieving high success rate with significant message reduction. [ABSTRACT FROM AUTHOR]

This study investigates the factors influencing the ‘illegal’ downloading of films and TV series through peer-to-peer (P2P) networks. Specifically, it examines how social and ethical orientations and attitudes towards downloading impact on downloading intentions. The neutralisation theory and theory of planned behaviour are used to underpin the research framework. The data analysis of 284 usable responses produced several significant relationships. Facilitating conditions, social factors, collectivism, and personal moral obligation were found to predict attitudes towards ‘illegal’ downloading. Social factors, collectivism, personal moral obligation, and attitudes towards ‘illegal’ downloading were also found to influence intentions to download. The findings derived from this study will provide marketers and policymakers with strategic and managerial initiatives to counteract this persistent problem. [ABSTRACT FROM PUBLISHER]

The focus of this paper is to design and develop a Peer-to-Peer Presentation System (P2P-PS) that supports E-learning through live media streaming coupled with a P2P shared whiteboard. The participants use the "ask doubt" feature to raise and resolve doubts during a session of ongoing presentation. The proposed P2P-PS system preserves causality between ask doubt and its resolution while disseminating them to all the participants. A buffered approach is employed to enhance the performance of P2P shared whiteboard, which may be used either in tandem with live media streaming or in standalone mode. The proposed system further extends P2P interactions on stored contents (files) built on top of a P2P file sharing and searching module with additional features. The added features allow the creation of mash-up presentations with annotations, posts, comments on audio, video, and PDF files as well as a discussion forum. We have implemented the P2P file sharing and searching system on the de Bruijn graph-based overlay for low latency. Extensive experiments were carried out on Emulab to validate the P2P-PS system using 200 physical nodes. [ABSTRACT FROM AUTHOR]

Transgender peer-to-peer support groups can provide an invaluable space for healing by fostering collective knowledge, resource sharing, and supportive self-determination. Historically, transgender people have facilitated these grassroots mental health and gender transition supports within their communities, picking up the slack where providers and healthcare systems have either fallen short, or worse, have actively sought to bar access. Peer models emerge from these community-based movements but have also started to become more formally integrated into some state-funded models of healthcare. The following article investigates the impacts of clinical work conducted in institutionally funded, peer-to-peer transgender mental health support groups through a narrative-driven conversation between the authors: a transgender service provider and a transgender service user. Drawing on our shared experience, we discuss the benefits and shortcomings of this innovative, yet delegitimized form of healthcare provision for transgender people. [ABSTRACT FROM AUTHOR]

In this paper, supereigenvalue and constrained supereigenvalue problems of an addition-min fuzzy matrix are investigated. In a peer-to-peer file sharing system, the download requirement of the terminals could be described by a constant constraint system with addition-min fuzzy relation inequalities. Without considering the constant constraint system, we first study the supereigenvalue problem. While considering the constant constraint system, the so-called constrained supereigenvalue is further proposed and investigated. A constrained supereigenvalue represents the ratio of the data-download quality to the data-sending quality under a constant constraint. In order to arouse the enthusiasm of the terminals to share their local file data, we aim to maximize the constrained supereigenvalue. A nonlinear programming approach is developed to find the unique maximum constrained supereigenvalue, with some illustrative examples. [ABSTRACT FROM AUTHOR]

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]