To see the other types of publications on this topic, follow the link: Peer-to-Peer (P2P) Overlay.
Journal articles on the topic 'Peer-to-Peer (P2P) Overlay'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Peer-to-Peer (P2P) Overlay.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
GARCÉS-ERICE, L., E. W. BIERSACK, K. W. ROSS, P. A. FELBER, and G. URVOY-KELLER. "HIERARCHICAL PEER-TO-PEER SYSTEMS." Parallel Processing Letters 13, no. 04 (December 2003): 643–57. http://dx.doi.org/10.1142/s0129626403001574.
Full textAbstract:
Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.
2
Sawamura, Soichi, Ailixier Aikebaier, Valbona Barolli, and Makoto Takizawa. "Trustworthy acquaintances in Peer-to-Peer (P2P) overlay networks." International Journal of Business Intelligence and Data Mining 6, no. 1 (2011): 42. http://dx.doi.org/10.1504/ijbidm.2011.038273.
Full text
3
LE, HANH, DOAN HOANG, and ANDREW SIMMONDS. "PARM: A PHYSICALLY-AWARE REFERENCE MODEL FOR PEER-TO-PEER OVERLAY INTERNETWORKING." Journal of Interconnection Networks 07, no. 04 (December 2006): 451–74. http://dx.doi.org/10.1142/s0219265906001806.
Full textAbstract:
Peer-to-Peer (P2P) technologies developed rapidly in different directions with various applications and routing mechanisms. Each of them deals with a particular task, and/or provides a specific service. They were developed separately without a unified architecture taking into account all the performance factors of a P2P system. This makes the P2P systems incomplete and their performances far from optimal. This trend also restricts the interoperability amongst the systems because of the lack of standardization in functional architectures of the P2P systems. As a result, tangible benefits for Internet users are limited because the edge-Internet resources are not sharable amongst the systems. Inspired by TCP/IP model, this paper introduces PARM: a Physically-Aware Reference Model for Overlay Internetworking, which is an open reference structure for designing better performance P2P systems. PARM divides major functional P2P system tasks into layers so that they can be tackled individually and efficiently. A Peer Name Service was developed to evaluate the model. The service interprets peer names into their current locations. Simulation results indicate that PARM helps to produce excellent performance overlays. The overlays can achieve desirable features such as decentralization, self-organization, scalability, low overhead and minimal delay penalty.
4
Polaczyk, Bartosz, Piotr Chołda, and Andrzej Jajszczyk. "Peer-to-Peer Multicasting Inspired by Huffman Coding." Journal of Computer Networks and Communications 2013 (2013): 1–11. http://dx.doi.org/10.1155/2013/312376.
Full textAbstract:
Stringent QoS requirements of video streaming are not addressed by the delay characteristics of highly dynamic peer-to-peer (P2P) networks. To solve this problem, a novel locality-aware method for choosing optimal neighbors in live streaming multicast P2P overlays is presented in this paper. To create the appropriate multicast tree topology, a round-trip-time (RTT) value is used as a parameter distinguishing peers capabilities. The multicast tree construction is based on the Huffman source coding algorithm. First, a centrally managed version is presented, and then an effective use of a distributed paradigm is shown. Performance evaluation results prove that the proposed approach considerably improves the overlay efficiency from the viewpoint of end-users and content providers. Moreover, the proposed technique ensures a high level of resilience against gateway-link failures and adaptively reorganizes the overlay topology in case of dynamic, transient network fluctuations.
5
Gharib, Mohammed, Marzieh Malekimajd, and Ali Movaghar. "SLoPCloud: An Efficient Solution for Locality Problem in Peer-to-Peer Cloud Systems." Algorithms 11, no. 10 (October 2, 2018): 150. http://dx.doi.org/10.3390/a11100150.
Full textAbstract:
Peer-to-Peer (P2P) cloud systems are becoming more popular due to the high computational capability, scalability, reliability, and efficient data sharing. However, sending and receiving a massive amount of data causes huge network traffic leading to significant communication delays. In P2P systems, a considerable amount of the mentioned traffic and delay is owing to the mismatch between the physical layer and the overlay layer, which is referred to as locality problem. To achieve higher performance and consequently resilience to failures, each peer has to make connections to geographically closer peers. To the best of our knowledge, locality problem is not considered in any well known P2P cloud system. However, considering this problem could enhance the overall network performance by shortening the response time and decreasing the overall network traffic. In this paper, we propose a novel, efficient, and general solution for locality problem in P2P cloud systems considering the round-trip-time (RTT). Furthermore, we suggest a flexible topology as the overlay graph to address the locality problem more effectively. Comprehensive simulation experiments are conducted to demonstrate the applicability of the proposed algorithm in most of the well-known P2P overlay networks while not introducing any serious overhead.
6
WATANABE, KENICHI, NAOHIRO HAYASHIBARA, and MAKOTO TAKIZAWA. "CBF: LOOK-UP PROTOCOL FOR DISTRIBUTED MULTIMEDIA OBJECTS IN PEER-TO-PEER OVERLAY NETWORKS." Journal of Interconnection Networks 06, no. 03 (September 2005): 323–44. http://dx.doi.org/10.1142/s0219265905001459.
Full textAbstract:
Various types of applications take usage of multimedia objects like music and movies. Multimedia objects are distributed in peer-to-peer (P2P) overlay networks since the objects are downloaded and personalized in computers, mainly personal computers interconnected with the Internet. An application would like to take some service of a target object. A target peer is a peer which can manipulate a target object. First, the application has to find target peers which can support enough quality of service (QoS) of target multimedia objects. Due to the scalability and variety of peers in P2P overlay networks, it is difficult, possibly impossible to maintain a centralized directory showing in which peer each object is distributed. In this paper, we newly take an acquaintance approach where each peer maintains its acquaintance peers. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate in P2P overlay networks. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. In addition, we discuss a new type of flooding algorithm named charge-based flooding (CBF) algorithm to find target peers based on charge and acquaintance concepts so that areas in P2P overlay networks where target peers are expected to exist are more deeply searched. We evaluate the charge-based flooding (CBF) algorithm compared with a traditional TTL-based flooding algorithm in terms of the number of messages transmitted in networks.
7
PAPADAKIS, HARRIS, PARASKEVI FRAGOPOULOU, EVANGELOS P. MARKATOS, MARIOS D. DIKAIAKOS, and ALEXANDROS LABRINIDIS. "HASH-BASED OVERLAY PARTITIONING IN UNSTRUCTURED PEER-TO-PEER SYSTEMS." Parallel Processing Letters 19, no. 01 (March 2009): 57–71. http://dx.doi.org/10.1142/s0129626409000067.
Full textAbstract:
Unstructured peer-to-peer (P2P) networks suffer from the increased volume of traffic produced by flooding. Methods such as random walks or dynamic querying managed to limit the traffic at the cost of reduced network coverage. In this paper, we propose a partitioning method of the unstructured overlay network into a relative small number of distinct subnetworks. The partitioning is driven by the categorization of keywords based on a uniform hash function. The method proposed in this paper is easy to implement and results in significant benefit for the blind flood method. Each search is restricted to a certain partition of the initial overlay network and as a result it is much more targeted. Last but not least, the search accuracy is not sacrificed to the least since all related content is searched. The benefit of the proposed method is demonstrated with extensive simulation results, which show that the overhead for the implementation and maintenance of this system is minimal compared to the resulted benefit in traffic reduction.
8
Gottron, Christian, André König, and Ralf Steinmetz. "A Survey on Security in Mobile Peer-to-Peer Architectures—Overlay-Based vs. Underlay-Based Approaches." Future Internet 2, no. 4 (October 13, 2010): 505–32. http://dx.doi.org/10.3390/fi2040505.
Full textAbstract:
Mobile Ad hoc networks (MANET) and Peer-to-Peer (P2P) networks share central characteristics such as their distributed and decentralized nature. Combining both networking paradigms results in a Mobile Peer-to-Peer (MP2P) system that operates independently from a preexisting infrastructure. Securing MP2P networks in terms of availability and robustness as basic demands in envisioned application scenarios like first responder operations is a challenging task. In this article, we present a survey of selected threats and of state of the art countermeasures for MANETs and P2P networks. Further, we discuss the efficiency of MANET and P2P security mechanisms when applied in MP2P networks.
9
Zhang, Ming, and Jin Qiu Yang. "A Multi-Dimensional Query Scheme in Structured Overlays." Key Engineering Materials 439-440 (June 2010): 870–74. http://dx.doi.org/10.4028/www.scientific.net/kem.439-440.870.
Full textAbstract:
Structured peer-to-peer (P2P) systems are creating a large proportion of network traffic in today’s Internet. Peer-to-peer systems enable access to data spread over an extremely large number of machines. A P2P system typically involves thousands or millions of live peers in the network. Multi-dimensional data indexing has received much attention in a centralized database. In this paper, we propose and evaluate a multi-dimensional searching scheme in structured P2P networks. We present the design and implementation of a peer-to-peer index service for high dimensional data that is capable of handling complex queries. We design a VibIndex scheme in structured P2P overlay networks. We analyze this scheme’s performance and present simulation results. Our simulation results demonstrated the benefits of the proposed system and show that the approach is able to search efficiently.
10
Nath, Prem. "A Survey over Mechanisms for Reducing Free Riding Behaviour in Structured P2P Networks." Science & Technology Journal 5, no. 2 (July 1, 2017): 110–15. http://dx.doi.org/10.22232/stj.2017.05.02.07.
Full textAbstract:
P2P (peer-to-peer) overlays have attracted many researchers due to increase in Internet based P2P applications. A P2P overlay is a distributed system in which the independent nodes participate at their will to share resources in distributed manner. P2P overlays are designed for wired based communication systems but today P2P applications are becoming popular in wireless networks even in multi-hop wireless networks. Routing mechanism in P2P overlays is based on IP infrastructure and many protocols are deployed successfully for efficient and fair P2P applications. However, there are many challenges in designing and deployment of efficient and fair protocols for the P2P overlays. These overlays suffer from many challenges such as dynamic overlay management, lack of robust trust model, counterfeit content distribution, free riding, poor resource search scalability, security, etc. The churn rate of nodes (join and leave of nodes) in the P2P overlay makes overlay management and resource searching more challenging. The free riding nature of the nodes in a P2P overlay is undesirable and it creates unfairness in the P2P overlay. There are several mechanisms proposed such as Eigen Trust model, tit-for-tat policy, point-based incentive policy, Page Rank policy, layered taxation, advertisement of incentive, etc. for encouraging fairness in the P2P overlays. I have presented in-depth survey over free riding behaviour, its effect, and existing mechanisms to reduce free riding in structured P2P overlays.
11
GOTTHELF, PABLO, ALEJANDRO ZUNINO, and MARCELO CAMPO. "A PEER-TO-PEER COMMUNICATION INFRASTRUCTURE FOR GROUPWARE APPLICATIONS." International Journal of Cooperative Information Systems 17, no. 04 (December 2008): 523–54. http://dx.doi.org/10.1142/s0218843008001920.
Full textAbstract:
Many advances have been done to allow groups of people to work together and collaborate in the Internet. Collaborative systems are characterized by the way participants interact. In many cases, equal standing members should cooperate in a non-authoritative environment, where no entity or authority is or should be in charge of regulating the group. Therefore, decentralized communication infrastructures have been hailed as promising alternatives. Recently, decentralized infrastructures based on P2P approaches have drawn the attention of the research community because of their benefits in terms of scalability, robustness, availability and potentials for leveraging computational resources distributed across the Internet. In this paper, a scalable peer-to-peer (P2P) communication Infrastructure for groupware applications is presented. It enables a large number of people to join and cooperate in a robust, decentralized and easy deployable way, without requiring high capacity servers or any other special network infrastructure. The communication infrastructure is based on a binary tree as overlay structure, which implements all groupware communication functionality, including membership management and packet forwarding, at application level, making it an inexpensive and fast deployable solution for equal standing members, such as home users with a domestic connection to the Internet. Two applications, one for synchronous groupware and the other for asynchronous collaboration, have been developed to validate the approach. Comparisons with other communication infrastructures in aspects such as end-to-end propagation delay, group latency, throughput, protocol overhead, failure recovery and link stress, show that our approach is a scalable and robust alternative.
12
Lu, Ssu-Hsuan, and Yu-Wei Chan. "A Prediction System Using a P2P Overlay Network for a Bus Arrival System." Journal of Applied Mathematics 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/792029.
Full textAbstract:
Along with the evolution of times and the surge of metropolitan populations, government agencies often promote the construction of public transport. Unlike rail transportation or rapid transit systems, it is often difficult to estimate the vehicle arrival times at each station in a bus transportation system due to metropolitan transportation congestion. Traffic status is often monitored using wireless sensor networks (WSNs). However, WSNs are always separated from one another spatially. Recent studies have considered the connection of multiple sensor networks. This study considers a combination view of peer-to-peer (P2P) overlay networks and WSN architecture to predict bus arrival times. Each bus station, which is also a P2P overlay peer, is connected in a P2P overlay network. A sensor installed in each bus can receive data via peers to obtain the moving speed of a bus. Then, each peer can exchange its data to predict bus arrival times at bus stations. This method can considerably increase the accuracy with which bus arrival times can be predicted and can provide traffic status with high precision. Furthermore, these data can also be used to plan new bus routes according to the information gathered.
13
Bhushan, Shashi, M. Dave, and R. B. Patel. "Reducing Network Overhead with Common Junction Methodology." International Journal of Mobile Computing and Multimedia Communications 3, no. 3 (July 2011): 51–61. http://dx.doi.org/10.4018/jmcmc.2011070104.
Full textAbstract:
In structured and unstructured Peer-to-Peer (P2P) systems, frequent joining and leaving of peer nodes causes topology mismatch between the P2P logical overlay network and the physical underlay network. This topology mismatch problem generates high volumes of redundant traffic in the network. This paper presents Common Junction Methodology (CJM) to reduce network overhead by optimize the overlay traffic at underlay level. CJM finds common junction between available paths, and traffic is only routed through the common junction and not through the conventional identified paths. CJM does not alter overlay topology and performs without affecting the search scope of the network. Simulation results show that CJM resolves the mismatch problem and significantly reduces redundant P2P traffic up to 87% in the best case for the simulated network. CJM can be implemented over structured or unstructured P2P networks, and also reduces the response time by 53% approximately for the network.
14
Ardizzone, E., L. Gatani, M. La Cascia, G. Lo Re, and M. Ortolani. "Enhanced P2P Services Providing Multimedia Content." Advances in Multimedia 2007 (2007): 1–12. http://dx.doi.org/10.1155/2007/26070.
Full textAbstract:
The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on unique identifiers or small sets of keywords. Unfortunately, this approach is very inadequate and inefficient when a huge amount of multimedia resources is shared. To address this major limitation, we propose an original image and video sharing system, in which a user is able to interactively search interesting resources by means of content-based image and video retrieval techniques. In order to limit the network traffic load, maximizing the usefulness of each peer contacted in the query process, we also propose the adoption of an adaptive overlay routing algorithm, exploiting compact representations of the multimedia resources shared by each peer. Experimental results confirm the validity of the proposed approach, that is capable of dynamically adapting the network topology to peer interests, on the basis of query interactions among users.
15
LI, JUAN, and SON VUONG. "AN EFFICIENT CLUSTERED ARCHITECTURE FOR P2P NETWORKS." Journal of Interconnection Networks 05, no. 03 (September 2004): 279–98. http://dx.doi.org/10.1142/s0219265904001179.
Full textAbstract:
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some serious challenges. In this paper, we propose an Efficient Clustered Super-Peer P2P architecture (ECSP) to overcome the scalability and efficiency problems of existing unstructured P2P system. With ECSP, peers are grouped into clusters according to their topological proximity, and super-peers are selected from regular peers to act as cluster leaders and service providers. These super-peers are also connected to each other, forming a backbone overlay network operating as a distinct, yet integrated, application. To maintain the dynamically adaptive overlay network and to manage the routing on it, we propose an application level broadcasting protocol: Efa. Applying only a small amount of information about the topology of a network, Efa is as simple as flooding, a conventional method used in unstructured P2P systems. By eliminating many duplicated messages, Efa is much more efficient and scalable than flooding, and furthermore, it is completely decentralized and self-organized. Our experimental results prove that ESCP architecture, combined with the super-peer backbone protocol, can generate impressive levels of performance and scalability.
16
Müller, Julius, Thomas Magedanz, and Jens Fiedler. "Peer Assist Live Streaming Overlay for Next-Generation-Networks." International Journal of Handheld Computing Research 1, no. 4 (October 2010): 25–40. http://dx.doi.org/10.4018/jhcr.2010100102.
Full textAbstract:
The rapid evolution of the telecommunication domain increases the performance of different access networks continuously. New services, especially in the domain multimedia content distribution, require higher and higher bandwidth at the user’s and service provider’s side. Multimedia services like Video on Demand, IPTV, and live streaming were introduced in the past and are still improved in quality and quantity. Multimedia streams and Peer to Peer (P2P) file sharing dominates the worldwide Internet traffic nowadays and will continue further (Schulze, 2009). The user acceptance of enjoying multimedia content over the Internet will grow steadily together with the increasing quality of the available multimedia content. Network operators and service providers have to face the growths by increasing their service platform with higher performance and bandwidth or introducing a scalable solution. In this paper, the authors present an algorithm for scalable P2P live streaming in Next-Generation-Networks (NGN) that addresses this challenge. An evaluation proves the performance of the implementation of this algorithm in a demo scenario.
17
Liu, Yi, Shinji Sakamoto, Keita Matsuo, Makoto Ikeda, Leonard Barolli, and Fatos Xhafa. "Improvement of JXTA-Overlay P2P Platform." International Journal of Distributed Systems and Technologies 6, no. 2 (April 2015): 45–62. http://dx.doi.org/10.4018/ijdst.2015040104.
Full textAbstract:
JXTA-Overlay is a middleware built on top of the JXTA specification, which defines a set of protocols that standardize how different devices may communicate and collaborate among them. JXTA-Overlay provides a set of basic functionalities, primitives, intended to be as complete as possible to satisfy the needs of most JXTA-based applications. In this paper, the authors improve the reliability of our JXTA-Overlay P2P platform by implementing a new fuzzy-based Peer Reliability (PR) system. In the system, the authors considered three input parameters: Local Score (LS), Security (S) and Number of Interactions (NI). They evaluate JXTA-Overlay platform for medical applications and reliability. The experimental results show that by using JXTA-Overlay is possible to decide the situation of the patients. The simulation results have shown that the proposed system has a good performance and can choose reliable peers to connect in JXTA-Overlay platform.
18
Shi, Zhuo, and Ke Yu. "The Multiple Implied Overlay Tree P2P Progressive Transmission Method of Mixed Subdivision Mesh." Advanced Materials Research 230-232 (May 2011): 1384–88. http://dx.doi.org/10.4028/www.scientific.net/amr.230-232.1384.
Full textAbstract:
This paper presents a progressive transmission method of mixed subdivision mesh based on multiple implied overlay tree P2P network. Peer-to-Peer networks are widely used in media transmission because of its excellent network scalability. Scalable media service, especially mixed subdivision mesh is proposed to adapt to different terminal processing abilities. For stratified characteristics of progressive mesh, we use multiple implied tree cover P2P technology to transmit 3D mesh of mixed subdivision model. It effectively realizes to reduce MAX, average system load link and lower the average Relative delay penalty. Finally a complete set of solution is given, which is proved to be an effective method by simulation experiment.
19
MASUD, MD MEHEDI, ILUJU KIRINGA, and HASAN URAL. "UPDATE PROCESSING IN INSTANCE-MAPPED P2P DATA SHARING SYSTEMS." International Journal of Cooperative Information Systems 18, no. 03n04 (September 2009): 339–79. http://dx.doi.org/10.1142/s021884300900204x.
Full textAbstract:
We consider the problem of update processing in a peer-to-peer (P2P) database network where each peer consists of an independently created relational database. We assume that peers store related data, but data has heterogeneity wrt instances and schemas. The differences in schema and data vocabulary are bridged by value correspondences called mapping tables. Peers build an overlay network called acquaintance network, in which each peer may get acquainted with any other peer that stores related data. In this setting, the updates are free to initiate in any peer and are executed over other peers which are acquainted directly or indirectly with the updates initiator. The execution of an update is achieved by translating, through mapping tables, the update into a set of updates that are executed against the acquainted peers. We consider both the soundness and completeness of update translation. When updates are generated and propagated in the network initiated from a peer, a tree is built dynamically called Update Dependency Tree (UDT). The UDT depicts the relationships among the component updates generated from the initial update. We also discuss the issues of the update propagation when a peer is temporarily unavailable or offline. Our propagation mechanism keeps track of a peer when the peer is not available for a certain period of time and once the peer comes back online the system propagates the updates destined to the returning peer to keep it's database synchronized. Moreover, conflict detection and resolution strategies have been proposed for such a dynamic P2P database network. We have implemented and experimentally tested a prototype of our update processing mechanism on a small P2P database network. We show the results of our experiments.
20
Wei, Tsao-Ta, Chia-Hui Wang, Yu-Hsien Chu, and Ray-I. Chang. "A Secure and Stable Multicast Overlay Network with Load Balancing for Scalable IPTV Services." International Journal of Digital Multimedia Broadcasting 2012 (2012): 1–12. http://dx.doi.org/10.1155/2012/540801.
Full textAbstract:
The emerging multimedia Internet application IPTV over P2P network preserves significant advantages in scalability. IPTV media content delivered in P2P networks over public Internet still preserves the issues of privacy and intellectual property rights. In this paper, we use SIP protocol to construct a secure application-layer multicast overlay network for IPTV, called SIPTVMON. SIPTVMON can secure all the IPTV media delivery paths against eavesdroppers via elliptic-curve Diffie-Hellman (ECDH) key exchange on SIP signaling and AES encryption. Its load-balancing overlay tree is also optimized from peer heterogeneity and churn of peer joining and leaving to minimize both service degradation and latency. The performance results from large-scale simulations and experiments on different optimization criteria demonstrate SIPTVMON's cost effectiveness in quality of privacy protection, stability from user churn, and good perceptual quality of objective PSNR values for scalable IPTV services over Internet.
21
Miyoshi, Takumi, Yusuke Shimomura, and Olivier Fourmaux. "A P2P-based Communication Framework for Geo-Location Oriented Networks." Journal of Telecommunications and Information Technology 1 (March 29, 2019): 58–66. http://dx.doi.org/10.26636/jtit.2019.131119.
Full textAbstract:
This paper proposes a novel peer-to-peer communication framework to implement geographical location oriented networks, called G-LocON. Location-based services have been gaining in popularity, as proven by ridesharing and mobile games. Although these services have to construct geolocation oriented networks based on their users’ geographical locations, they completely rely on client/server models to communicate with neighboring terminals. G-LocON provides geolocation oriented device-to-device communication only with the current wireless technologies, such as LTE and Wi-Fi, cooperating with the global positioning system and peer-to-peer overlay networking. G-LocON will serve as a type of a mobile ad-hoc network in which devices located within the focusing area are capable of communicating directly. We developed a primitive Android application to implement the GLocON framework. Evaluation of the solution’s performance has verified the usefulness of the proposed system that offers an admissive transmission delay. Moreover, to confirm the application-related potential of the G-LocON framework, we also show a practical map software in which all neighboring mobile devices present in the focusing area are displayed.
22
Zeng, Jinlong, and Guifeng Zheng. "ISW." International Journal of Software Science and Computational Intelligence 4, no. 4 (October 2012): 26–40. http://dx.doi.org/10.4018/jssci.2012100102.
Full textAbstract:
Content location in unstructured peer-to-peer (P2P) networks is a challenging problem. In this paper, the authors present a novel Interest-based Small World (ISW) network to address the problem, by constructing a cluster overlay in the unstructured P2P network based on the small world paradigm and user interest. There are many attractive properties of a small world network, such as low average hop distance and high clustering coefficient. Interest locality can improve the awareness of user’s indeed intentions. The authors’ scheme combines their advantage to create a better solution. The simulation results show that our scheme outperforms other schemes significantly.
23
EISENHARDT, MARTIN, WOLFGANG MÜLLER, DANIEL BLANK, SOUFYANE EL ALLALI, and ANDREAS HENRICH. "CLUSTERING-BASED, LOAD BALANCED SOURCE SELECTION FOR CBIR IN P2P NETWORKS." International Journal of Semantic Computing 02, no. 02 (June 2008): 235–52. http://dx.doi.org/10.1142/s1793351x08000439.
Full textAbstract:
In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. One way to address this issue is using data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. There are several contributions of this article. We extend earlier work, adding a data source selection method for high-dimensional vector data, comparing different peer ranking schemes. Furthermore, we present two methods that use progressive stepwise data exchange between peers to better each peer's summary and therefore improve the system's performance. We finally examine the effect of these data exchange methods with respect to load balancing.
24
Merani, M. L., M. Capetta, and D. Saladino. "Cooperation Among Members of Online Communities." International Journal of Wireless Networks and Broadband Technologies 1, no. 3 (July 2011): 1–14. http://dx.doi.org/10.4018/ijwnbt.2011070101.
Full textAbstract:
Today some of the most popular and successful applications over the Internet are based on Peer-to-Peer (P2P) solutions. Online Social Networks (OSN) represent a stunning phenomenon too, involving communities of unprecedented size, whose members organize their relationships on the basis of social or professional friendship. This work deals with a P2P video streaming platform and focuses on the performance improvements that can be granted to those P2P nodes that are also members of a social network. The underpinning idea is that OSN friends (and friends of friends) might be more willing to help their mates than complete strangers in fetching the desired content within the P2P overlay. Hence, an approach is devised to guarantee that P2P users belonging to an OSN are guaranteed a better service when critical conditions build up, i.e., when bandwidth availability is scarce. Different help strategies are proposed, and their improvements are numerically assessed, showing that the help of direct friends, two-hops away friends and, in the limit, of the entire OSN community brings in considerable advantages. The obtained results demonstrate that the amount of delivered video increases and the delay notably decreases, for those privileged peers that leverage their OSN membership within the P2P overlay.
25
Li, Yanjun, Guoqing Zhang, and Guoqiang Zhang. "ISP-Friendly Data Scheduling by Advanced Locality-Aware Network Coding for P2P Distribution Cloud." Mathematical Problems in Engineering 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/968328.
Full textAbstract:
Peer-to-peer (P2P) file distribution imposes increasingly heavy traffic burden on the Internet service providers (ISPs). The vast volume of traffic pushes up ISPs’ costs in routing and investment and degrades their networks performance. Building ISP-friendly P2P is therefore of critical importance for ISPs and P2P services. So far most efforts in this area focused on improving the locality-awareness of P2P applications, for example, to construct overlay networks with better knowledge of the underlying network topology. There is, however, growing recognition that data scheduling algorithms also play an effective role in P2P traffic reduction. In this paper, we introduce the advanced locality-aware network coding (ALANC) for P2P file distribution. This data scheduling algorithm completely avoids the transmission of linearly dependent data blocks, which is a notable problem of previous network coding algorithms. Our simulation results show that, in comparison to other algorithms, ALANC not only significantly reduces interdomain P2P traffic, but also remarkably improves both the application-level performance (for P2P services) and the network-level performance (for ISP networks). For example, ALANC is 30% faster in distributing data blocks and it reduces the average traffic load on the underlying links by 40%. We show that ALANC holds the above gains when the tit-for-tat incentive mechanism is introduced or the overlay topology changes dynamically.
26
Zhao, Jia, Jianfeng Guan, Changqiao Xu, Wei Su, and Hongke Zhang. "Information Exchange rather than Topology Awareness: Cooperation between P2P Overlay and Traffic Engineering." Mathematical Problems in Engineering 2014 (2014): 1–12. http://dx.doi.org/10.1155/2014/792563.
Full textAbstract:
Solutions to the routing strategic conflict between noncooperative P2P overlay and ISP underlay go separate ways: hyperselfishness and cooperation. Unpredictable (possibly adverse) impact of the hyperselfish topology awareness, which is adopted in both overlay routing and traffic engineering, has not been sufficiently studied in the literature. Topology-related information exchange in a cooperatively efficient way should be highlighted to alleviate the cross-layer conflict. In this paper, we first illustrate the hyperselfish weakness with two dynamic noncooperative game models in which hyperselfish overlay or underlay has to accept a suboptimal profit. Then we build a synergistic cost-saving (SC) game model to reduce the negative effects of noncooperation. In the SC model, through information exchange, that is, the classified path-delay metrics for P2P overlay and peer locations for underlay, P2P overlay selects proximity as well as saving traffic transit cost for underlay, and ISP underlay adjusts routing to optimize network cost as well as indicating short delay paths for P2P. Simulations based on the real and generated topologies validate cost improvement by SC model and find a proper remote threshold value to limit P2P traffic from remote area, cross-AS, or cross-ISP.
27
Zou, Hua, Jin Xuan Hou, Rong Heng Lin, and Fang Chun Yang. "A Locality-Aware Peer Searching Scheme to Support VCR Functions in a Mesh-Based P2P VoD System." Advanced Materials Research 219-220 (March 2011): 1008–11. http://dx.doi.org/10.4028/www.scientific.net/amr.219-220.1008.
Full textAbstract:
With the wide penetration of broadband access, it is desirable to provide supporting user interactivity services such as Video-on-Demand (VoD). However, this introduces a challenge on how to efficiently support Video Cassette Recording (VCR) functions for VoD services in Peer-to-Peer (P2P) network. In this paper, we propose a locality-aware peer searching algorithm, called LAPS. In LAPS, peers are distributed in various areas by its physical location. For each peer, it could implement relocation of forward seek based on neighbors’ and trackers’ information. To decrease the backbone load, LAPS dedicated to download media content from local area. We explore several key issues in LAPS including overlay organization, three various situations of forward seek with neighbor circle. We evaluate its performance through simulations and compare it with existed system. The results show that LAPS is superior to a previous scheme in terms of latency and backbone load.
28
LOMBARDO, ALFIO, ANTONIO MASTO, DIEGO REFORGIATO, and GIOVANNI SCHEMBRA. "A DYNAMIC JITTER-CONTROLLED TREE-BASED P2P NETWORK TOPOLOGY FOR MULTIPOINT MULTIMEDIA APPLICATIONS." Journal of Interconnection Networks 13, no. 01n02 (March 2012): 1250003. http://dx.doi.org/10.1142/s021926591250003x.
Full textAbstract:
In the last few years peer-to-peer (P2P) systems have gained ground for multipoint video content distribution over IP networks. P2P technologies give new opportunities to define an efficient multimedia streaming application, but at the same time they involve a set of technical challenges and issues due to the best-effort service offered by the underlying Internet, and its dynamic and heterogeneous nature. Stringent requirements in terms of end-to-end delay for real-time applications motivates the choice of a tree-structured topology against other topologies that have been introduced in the last research works, but mainly aimed at non-real-time services like video on demand and live streaming. The target of this paper is to present a platform for multipoint multimedia transmission based on a tree overlay network with jitter control and to show through experiments on real environment that our platform performs better than a traditional tree overlay network system in terms of PSNR, frame loss and playout frozen time.
29
Pires, Carlos Eduardo Santos, Rocir Marcos Leite Santiago, Ana Carolina Salgado, Zoubida Kedad, and Mokrane Bouzeghoub. "Ontology-Based Clustering in a Peer Data Management System." International Journal of Distributed Systems and Technologies 3, no. 2 (April 2012): 1–21. http://dx.doi.org/10.4018/jdst.2012040101.
Full textAbstract:
Peer Data Management Systems (PDMSs) are advanced P2P applications in which each peer represents an autonomous data source making available an exported schema to be shared with other peers. Query answering in PDMSs can be improved if peers are efficiently disposed in the overlay network according to the similarity of their content. The set of peers can be partitioned into clusters, so as the semantic similarity among the peers participating into the same cluster is maximal. The creation and maintenance of clusters is a challenging problem in the current stage of development of PDMSs. This work proposes an incremental peer clustering process. The authors present a PDMS architecture designed to facilitate the connection of new peers according to their exported schema described by an ontology. The authors propose a clustering process and the underlying algorithm. The authors present and discuss some experimental results on peer clustering using the approach.
30
MONTANELLI, STEFANO, and SILVANA CASTANO. "Semantically routing queries in peer-based systems: the H-Link approach." Knowledge Engineering Review 23, no. 1 (March 2008): 51–72. http://dx.doi.org/10.1017/s0269888907001257.
Full textAbstract:
AbstractA challenging issue to advance the existing P2P semantic routing protocols is related to the capability of developing mechanisms for focused selection of the query recipients by taking into account a semantically rich description of the context of each peer. In this article, we present the H-Link semantic routing approach designed to exploit the results of an ontology matchmaking process for providing a semantic overlay network where peers having similar contexts are recognized and interlinked as semantic neighbors. In particular, H-Linkaims at advancing the existing semantic routing protocols by combining ontology-based peer context descriptions and ontology matching techniques for providing query forwarding on a real semantic basis, in a completely decentralized way.
31
WATANABE, KENICHI, and MAKOTO TAKIZAWA. "SERVICE ORIENTED COOPERATION AMONG TRUSTWORTHY PEERS." Journal of Interconnection Networks 07, no. 04 (December 2006): 507–33. http://dx.doi.org/10.1142/s0219265906001831.
Full textAbstract:
Various types of applications make access to objects distributed in peer-to-peer (P2P) overlay networks. Even if the locations of target objects are discovered by some look-up algorithm such as flooding and distributed hash table (DHT), applications cannot manipulate the target objects without access rights. It is critical to perceive which peer can manipulate an object in which method, i.e. only a peer authorized with an access right is allowed to manipulate an object. Hence, an application has to find peers which can manipulate a target object rather than detect the location of the target object. Due to the scalability, variety, and autonomy of peers, it is difficult, may be impossible to maintain a centralized directory showing in which peer each object is distributed. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. Acquaintance peers of a peer may notify the peer of different information on target peers due to communication and propagation delay. Here, it is critical to discuss how much a peer trusts each acquaintance peer. We first define the satisfiability of an acquaintance peer, i.e. how much a peer is satisfied by issuing an access request to the acquaintance peer. For example, if a peer p locally manipulates a target object o and obtains a response, p is mostly satisfied. On the other hand, if the peer p has to ask another peer to manipulate the object o, the peer p is less satisfied. We define the trustworthiness and ranking factor of an acquaintance peer obtained by accumulating the satisfiability of each interaction with the acquaintance peer. Differently from traditional reputation concepts, trustworthiness information only from trustworthy acquaintance peers can be used to obtain the ranking factor. The trustworthiness of an acquaintance peer shows how much a peer can trusts the acquaintance peer while the ranking factor of an acquaintance peer shows how much the acquaintance peer is trusted by other trustworthy acquaintance peers. Then, we evaluate the trustworthiness and ranking factor in presence of faulty peers.
32
Lei, Kai, Li Hua Li, Cheng Peng, and Long Yu Yu. "HIPPO: An Adaptive, Scalable, Hierarchical P2PLive Streaming System." Advanced Materials Research 989-994 (July 2014): 4556–61. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4556.
Full textAbstract:
P2P live streaming is a hot research topic of Internet, but for the defective of system architecture and scheduling policy, P2P streaming applications have poor user experience, such as long start-delay, long play-delay, and low play-continuity and so on. Firstly, based on the analysis of the advantages and disadvantages of previous works, this paper designed and implemented a hierarchical P2P streaming system. The system is composed by three layers: source management servers, region management servers, and peers. The underlying P2P overlay network is organized through Mesh-pull mechanism. We propose a new scheduling strategy to utilize the capacity of the peer. The new adaptive scheduling strategy considers the urgency and scarcity of the data blocks, and selects the appropriate neighbor nodes by monitoring neighbor nodes’ the maximum load. The study of a real-life system provides valuable insights for the future development of P2P live streaming systems.
33
FUJITA, SATOSHI. "Resilient Tree-Based Video Streaming with a Guaranteed Latency." Journal of Interconnection Networks 19, no. 04 (December 2019): 1950009. http://dx.doi.org/10.1142/s0219265919500099.
Full textAbstract:
In this paper, we propose a method to organize a tree-based Peer-to-Peer (P2P) overlay for video streaming which is resilient to the temporal reduction of the upload capacity of a node. The basic idea of the proposed method is: (1) to introduce the redundancy to a given tree-structured overlay, in such a way that a part of the upload capacity of each node is proactively used for connecting to a sibling node, and (2) to use those links connecting to the siblings to forward video stream to the siblings. More specifically, we prove that even if the maximum number of children of a node temporally reduces from m to m − k for some 1 ≤ k ≤ m − 1, the proposed method continues the forwarding of video stream to all of m children in at most 2x hops, where x is the smallest integer satisfying m − k ≥ m/2x. We also derive a sufficient condition to bound the increase of the latency by an additive constant. The derived sufficient condition indicates that if each node can have at least six children in the overlay, the proposed method increases the latency by at most one, provided that the number of nodes in the overlay is at most 9331; namely the proposed method guarantees the delivery of video stream with a nearly optimal latency.
34
Lombardo, Alfio, Diego Reforgiato, and Giovanni Schembra. "P2P and MPEG FGS Encoding: A Good Recipe for Multipoint Video Transmission on the Internet." International Journal of Digital Multimedia Broadcasting 2009 (2009): 1–21. http://dx.doi.org/10.1155/2009/453471.
Full textAbstract:
In the last years Peer-to-Peer (P2P) systems have gained ground for content sharing between communities, determining a real revolution on the Internet. The characteristics of P2P systems make them a very good choice for multimedia content distribution over IP networks. However, although P2P technology gives new opportunities to define an efficient multimedia streaming application, at the same time it involves a set of technical challenges and issues due to the best-effort service offered by the Internet and its dynamic and heterogeneous nature. The most of existent protocols for video communications over P2P mainly focus on tree topology maintenance, without paying any attention to the encoding problem. The idea of this paper is to propose a multipoint video broadcast framework over a heterogeneous content distribution P2P network. In the proposed system the source generates the video flow by using an MPEG-4/FGS encoder, in such a way that no losses occur at the Baselayer stream even in the presence of short-term bandwidth fluctuations. Although in the past the FGS was not employed due to its encoding complexity, today, thanks to advances in hardware technology, we were able to develop an MPEG-4/FGS encoder on low-cost PCs which turned out to be more feasible and appealing for its flexibility. The FGS layer is sent together with the Base layer, but with a lower priority. The source uses a rate controller to regulate the encoding rate of the Base layer. To this aim, a protocol is defined in order to provide the source with information related to the most stringent bottleneck link on the overlay network. A technique to reorganize the content distribution tree is proposed and discussed. To evaluate the performance of the proposed framework a case study is introduced; improvements obtained with respect to several reference cases where FGS is not applied are also shown.
35
Seddiki, Manel, and Mahfoud Benchaïba. "Gpop." International Journal of Distributed Systems and Technologies 6, no. 3 (July 2015): 51–64. http://dx.doi.org/10.4018/ijdst.2015070104.
Full textAbstract:
Unstructured overlays such as P2P networks and social networks stimulate many research areas. This kind of overlays is composed of a set of self-manageable entities which share objects between them in a spontaneous way. Getting a global knowledge such as popularity of shared objects or reputation of the entity is a challenging task because in such overlays, entities have only partial knowledge about the overlay state. In this paper, the authors focus on the file popularity measurement because this parameter can be efficiently used to improve object replication and object search performances. Some research works are proposed to measure this parameter, but these measurements are only based on local knowledge of peers. The authors propose Gpop, a global file popularity measurement for unstructured P2P networks which considers both local knowledge of the peer and knowledge of the other peers participating in the network to gain a global-like knowledge. Simulation results reinforce the authors' theoretical propositions and show that our measurement is closer to the real file popularity.
36
Oktian, Yustus Eko, Elizabeth Nathania Witanto, and Sang-Gon Lee. "A Conceptual Architecture in Decentralizing Computing, Storage, and Networking Aspect of IoT Infrastructure." IoT 2, no. 2 (March 28, 2021): 205–21. http://dx.doi.org/10.3390/iot2020011.
Full textAbstract:
Since the inception of the Internet of Things (IoT), we have adopted centralized architecture for decades. With the vastly growing number of IoT devices and gateways, this architecture struggles to cope with the high demands of state-of-the-art IoT services, which require scalable and responsive infrastructure. In response, decentralization becomes a considerable interest among IoT adopters. Following a similar trajectory, this paper introduces an IoT architecture re-work that enables three spheres of IoT workflows (i.e., computing, storage, and networking) to be run in a distributed manner. In particular, we employ the blockchain and smart contract to provide a secure computing platform. The distributed storage network maintains the saving of IoT raw data and application data. The software-defined networking (SDN) controllers and SDN switches exist in the architecture to provide connectivity across multiple IoT domains. We envision all of those services in the form of separate yet integrated peer-to-peer (P2P) overlay networks, which IoT actors such as IoT domain owners, IoT users, Internet Service Provider (ISP), and government can cultivate. We also present several IoT workflow examples showing how IoT developers can adapt to this new proposed architecture. Based on the presented workflows, the IoT computing can be performed in a trusted and privacy-preserving manner, the IoT storage can be made robust and verifiable, and finally, we can react to the network events automatically and quickly. Our discussions in this paper can be beneficial for many people ranging from academia, industries, and investors that are interested in the future of IoT in general.
37
Kerpez, Ken, Yuanqiu Luo, and Frank J. Effenberger. "Bandwidth Reduction via Localized Peer-to-Peer (P2P) Video." International Journal of Digital Multimedia Broadcasting 2010 (2010): 1–10. http://dx.doi.org/10.1155/2010/562832.
Full textAbstract:
This paper presents recent research into P2P distribution of video that can be highly localized, preferably sharing content among users on the same access network and Central Office (CO). Models of video demand and localized P2P serving areas are presented. Detailed simulations of passive optical networks (PON) are run, and these generate statistics of P2P video localization. Next-Generation PON (NG-PON) is shown to fully enable P2P video localization, but the lower rates of Gigabit-PON (GPON) restrict performance. Results here show that nearlyallof the traffic volume of unicast video could be delivered via localized P2P. Strong growth in video delivery via localized P2P could lower overall future aggregation and core network bandwidth of IP video traffic by 58.2%, and total consumer Internet traffic by 43.5%. This assumes aggressive adoption of technologies and business practices that enable highly localized P2P video.
38
Käfer, Benjamin. "Peer-to-Peer Lending – A (Financial Stability) Risk Perspective." Review of Economics 69, no. 1 (March 26, 2018): 1–25. http://dx.doi.org/10.1515/roe-2017-0020.
Full textAbstract:
AbstractThe aim of this survey article is to discuss P2P lending, a subcategory of crowdfunding, from a (financial stability) risk perspective. The discussion focuses on a number of dimensions such as the role of soft information, herding, platform default risk, liquidity risk, and the institutionalization of P2P markets. Overall, we conclude that P2P lending is more risky than traditional banking. However, it is important to recognize that a constant conclusion would be misleading. P2P platforms have evolved and changed their appearance markedly over time, which implies that although our final conclusion of increased riskiness through P2P markets remains valid over time, it is based on different arguments at different points in time.
39
Yeo, Eunjung, and Jooyong Jun. "Peer-to-Peer Lending and Bank Risks: A Closer Look." Sustainability 12, no. 15 (July 29, 2020): 6107. http://dx.doi.org/10.3390/su12156107.
Full textAbstract:
This study examined how the expansion of peer-to-peer (P2P) lending affects bank risks, particularly insolvency and illiquidity risks. We compared a benchmark case wherein banks are the only players in the loan market with a segmented market case wherein the loan market is segmented by borrowers’ creditworthiness, P2P lending platforms operate only in the low-credit market segment, and banks operate in both low- and high-credit segments. For the segmented market case compared with the benchmark one, we find that, while banks’ insolvency risk increases, their illiquidity risk decreases such that their overall risk also decreases. Our results imply that sustainable P2P lending requires an appropriate differentiation of roles between banks and P2P lending platforms—P2P lending platforms operate in the low-credit segment and banks’ involvement in P2P lending is restricted—so that the growth of P2P lending is not adverse for bank stability.
40
Kohardinata, Cliff, Noorlailie Soewarno, and Bambang Tjahjadi. "INDONESIAN PEER TO PEER LENDING (P2P) AT ENTRANT’S DISRUPTIVE TRAJECTORY." Business: Theory and Practice 21, no. 1 (February 17, 2020): 104–14. http://dx.doi.org/10.3846/btp.2020.11171.
Full textAbstract:
Peer to peer (P2P) lending in Indonesia has been growing rapidly, therefore there is the potential for disruptive innovation processes in the financial sector. The aim of this study is to examine the impact of the growth of P2P lending on the growth of bank lending for micro, small and medium enterprises (MSME) and Non-MSME debtors. Separating the scale of the debtor is important, given the initial process of disruptive innovation of reaching areas that are not the incumbent’s main target. The examination was conducted in this study using panel data regression, whereby the examination was done in stages. This was an overall examination without differentiating between the regions, further examination conducted with more detail by separating between the loans inside and outside Java Island. This is because the economic structure in Indonesia is still dominated by the regions in Java, but FinTech is generally able to grow in areas with less developed local economies. The result of this study is consistent overall, Java and outside Java Island, as shows that the growth in P2P lending in Indonesia does not have a significant impact on the growth of bank loans for Non-MSME lending. However, it does have a negative impact on the growth of bank loans for MSME lending. This is in line with the entrant’s disruptive trajectory process by which the entrants enter the competition through an underserved market (niche markets) and not through the main target market of the incumbent (MSME).
41
Chaudhary, Kaylash, Xiaoling Dai, and John Grundy. "Experiences in Developing a Micro-payment System for Peer-to-Peer Networks." International Journal of Information Technology and Web Engineering 5, no. 1 (January 2010): 23–42. http://dx.doi.org/10.4018/jitwe.2010010102.
Full textAbstract:
Micro-payment systems are an important part of peer-to-peer (P2P) networks and address the “free-rider” problem in most existing content sharing systems. To address this issue, the authors have developed a new micro-payment system for content sharing in P2P networks called P2P-Netpay. This is an offline, debit based protocol that provides a secure, flexible, usable and reliable credit service. This article compares micro-payment with non-micro-payment credit systems for file sharing applications and finds that this approach liberates the “free-rider” problem. The authors analyse the heuristic evaluation performed by a set of evaluators and present directions for research aiming to improve the overall satisfaction and efficiency of the proposed model.
42
Gibilaro, Lucia, and Gianluca Mattarocci. "Peer-to-peer lending and real estate mortgages: evidence from United Kingdom." Journal of European Real Estate Research 11, no. 3 (November 5, 2018): 319–34. http://dx.doi.org/10.1108/jerer-12-2016-0048.
Full textAbstract:
Purpose This paper aims to collect data from a unique database provided by LendInvest and to study the key differences in the lending features for the two types of lending solutions. Findings Peer-to-peer (P2P) loans are prevalently short-term financing solutions (bridge financing), and the size of the loan is above average of the market. The loan portfolio is normally more geographically concentrated with respect to the average for the overall market and the main geographical areas for P2P lending are not just the main markets served by traditional lenders. Areas served by P2P lending have a lower population income than the national average and are characterized by below-average real estate price performance. Research/limitations/implications The results support the hypothesis of a complementary relation between conventional and P2P lending, showing that the latter represents a solution that is servicing areas that, because of the lower value of the collateral and lower average income, do not have easy access to the traditional mortgage market. Originality/value The paper is a first empirical contribution on the analysis of the market served by P2P real estate lending financing solution.
43
Alqahtani, Amal, Heba Kurdi, and Majed Abdulghani. "HadithTrust: Trust Management Approach Inspired by Hadith Science for Peer-to-Peer Platforms." Electronics 10, no. 12 (June 16, 2021): 1442. http://dx.doi.org/10.3390/electronics10121442.
Full textAbstract:
Peer-to-peer (P2P) platforms are gaining increasing popularity due to their scalability, robustness and self-organization. In P2P systems, peers interact directly with each other to share resources or exchange services without a central authority to manage the interaction. However, these features expose P2P platforms to malicious attacks that reduce the level of trust between peers and in extreme situations, may cause the entire system to shut down. Therefore, it is essential to employ a trust management system that establishes trust relationships among peers. Current P2P trust management systems use binary categorization to classify peers as trustworthy or not trustworthy. However, in the real world, trustworthiness is a vague concept; peers have different levels of trustworthiness that affect their overall trust value. Therefore, in this paper, we developed a novel trust management algorithm for P2P platforms based on Hadith science where Hadiths are systematically classified into multiple levels of trustworthiness, based on the quality of narrator and content. To benchmark our proposed system, HadithTrust, we used two state-of-art trust management systems, EigenTrust and InterTrust, with no-trust algorithm as a baseline scenario. Various experimental results demonstrated the superiority of HadithTrust considering eight performance measures.
44
Masinde, Newton, Liat Khitman, Iakov Dlikman, and Kalman Graffi. "Systematic Evaluation of LibreSocial—A Peer-to-Peer Framework for Online Social Networks." Future Internet 12, no. 9 (August 20, 2020): 140. http://dx.doi.org/10.3390/fi12090140.
Full textAbstract:
Peer-to-peer (P2P) networks have been under investigation for several years now, with many novel mechanisms proposed as is shown by available articles. Much of the research focused on showing how the proposed mechanism improves system performance. In addition, several applications were proposed to harness the benefits of the P2P networks. Of these applications, online social networks (OSNs) raised much interest particularly because of the scalability and privacy concerns with centralized OSNs, hence several proposals are in existence. However, accompanying studies on the overall performance of the P2P network under the weight of the OSN applications outside simulations are very few, if any. In this paper, the aim is to undertake a systematic evaluation of the performance of a P2P framework for online social networks called LibreSocial. Benchmark tests are designed, taking into account the random behavior of users, effects of churn on system stability and effect of replication factor. We manage to run benchmark tests for up to 2000 nodes and show the performance against costs of the system in general. From the results it is evident that LibreSocial’s performance is capable of meeting the needs of users.
45
Azzedin, Farag. "Taxonomy of reputation assessment in peer-to-peer systems and analysis of their data retrieval." Knowledge Engineering Review 29, no. 4 (September 2014): 463–83. http://dx.doi.org/10.1017/s0269888914000174.
Full textAbstract:
AbstractThe need for reputation assessment is particularly strong in peer-to-peer (P2P) systems because the peers’ personal site autonomy is amplified by the inherent technological decentralization of the environment. However, the decentralization notion makes the problem of designing a P2P-based reputation assessment substantially harder in P2P networks than in centralized settings. Existing reputation systems tackle the reputation assessment process in an ad hoc manner. There is no systematic and coherent way to derive measures and analyze the current reputation systems. In this paper, we propose a reputation assessment process and use it to classify the existing reputation systems. Simulation experiments are conducted and focused on the different methods in selecting the recommendation sources and collecting the recommendations. These two phases can contribute significantly to the overall performance owing to precision, recall, and communication cost.
46
CHEN, ZHONGQIANG, ALEX DELIS, and PETER WEI. "IDENTIFICATION AND MANAGEMENT OF SESSIONS GENERATED BY INSTANT MESSAGING AND PEER-TO-PEER SYSTEMS." International Journal of Cooperative Information Systems 17, no. 01 (March 2008): 1–51. http://dx.doi.org/10.1142/s0218843008001750.
Full textAbstract:
Sessions generated by Instant Messaging and Peer-to-Peer systems (IM/P2Ps) not only consume considerable bandwidth and computing resources but also dramatically change the characteristics of data flows affecting both the operation and performance of networks. Most IM/P2Ps have known security loopholes and vulnerabilities making them an ideal platform for the dissemination of viruses, worms, and other malware. The lack of access control and weak authentication on shared resources further exacerbates the situation. Should IM/P2Ps be deployed in production environments, performance of conventional applications may significantly deteriorate and enterprise data may be contaminated. It is therefore imperative to identify, monitor and finally manage IM/P2P traffic. Unfortunately, this task cannot be easily attained as IM/P2Ps resort to advanced techniques to hide their traces including multiple channels to deliver services, port hopping, message encapsulation and encryption. In this paper, we propose an extensible framework that not only helps to identify and classify IM/P2P-generated sessions in real time but also assists in the manipulation of such traffic. Consisting of four modules namely, session manager, traffic assembler, IM/P2P dissector, and traffic arbitrator, our proposed framework uses multiple techniques to improve its traffic classification accuracy and performance. Through fine-tuned splay and interval trees that help organize IM/P2P sessions and packets in data streams, we accomplish stateful inspection, traffic re-assembly, data stream correlation, and application layer analysis that combined will boost the framework's identification precision. More importantly, we introduce IM/P2Ps "plug-and-play" protocol analyzers that inspect data streams according to their syntax and semantics; these analyzers render our framework easily extensible. Identified IM/P2P sessions can be shaped, blocked, or disconnected, and corresponding traffic can be stored for forensic analysis and threat evaluation. Experiments with our prototype show high IM/P2Ps detection accuracy rates under diverse settings and excellent overall performance in both controlled and real-world environments.
47
Huang, Hui, Shilin Nie, Jin Lin, Yuanyuan Wang, and Jun Dong. "Optimization of Peer-to-Peer Power Trading in a Microgrid with Distributed PV and Battery Energy Storage Systems." Sustainability 12, no. 3 (January 27, 2020): 923. http://dx.doi.org/10.3390/su12030923.
Full textAbstract:
Integrating distributed generation (DG) into the main grid is a challenge for the safety and stability of the grid. The application of peer-to-peer (P2P) technology in microgrids with distributed generation is expected to facilitate increased self-consumption of distributed and renewable energy, and the rise of prosumers’ monetary benefits. A P2P energy trading model in microgrids with photovoltaic (PV) distributed generation and battery energy storage systems (BESSs) is proposed in this paper. We additionally designed a P2P electricity trading mechanism based on coalition game theory. A simulation framework of this model is presented which assumed a local community with 30 households under comprehensive constraints encompassing a customer load profile, PV system, BESSs, market signals including feed-in tariffs, and retail prices. Firstly, individual customers can post orders (purchasing orders or selling orders) and exchange information in a P2P energy trading market. Secondly, the microgrid operator can validate the orders based on how to achieve the minimum overall energy consumption in microgrids and set reasonable real-time purchasing and selling prices for P2P energy transactions. Thirdly, the orders can be automatically conducted and completed at the designed optimal price. This mechanism can be a practical solution motivating individual customers to participate in P2P electricity trading, assist with electricity cost reduction, benefit from electricity supply increases, and help the grid operators to make the most economically and socially friendly decisions.
48
K, Hareesh, and Manjaiah D. H. "Peer to Peer Video on Demand Architecture using V-Chaining." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 3, no. 2 (October 30, 2012): 242–48. http://dx.doi.org/10.24297/ijct.v3i2a.2814.
Full textAbstract:
In the Internet, video streaming requires greater amount of network bandwidth and other resources as the number of user requests increases. In case of traditional centralized directory server approach all the users requests are directly handled by the centralized server and each user request will send dedicated stream by the server, which requires higher end server, server cost will become more and greater amount of network bandwidth utilized by this server. To solve these problems peer to peer technology as emerged for the distribution of video streams to the larger requests over the network. In P2P VoD architecture adopted both the peer to peer and proxy based architectural design of a VOD system for larger community of users over the network. Hence our proposed Peer to Peer Video on Demand Architecture using V-Chaining improves the overall performance of the system by efficient utilization of uplink bandwidth and smaller amount of buffer space among the peers. In this paper we have introduce architecture for handle the large number of user requests over the communication network and ease of implementation.
49
de Asís López-Fuentes, Francisco. "P2P video streaming combining SVC and MDC." International Journal of Applied Mathematics and Computer Science 21, no. 2 (June 1, 2011): 295–306. http://dx.doi.org/10.2478/v10006-011-0022-1.
Full textAbstract:
P2P video streaming combining SVC and MDC In this paper we propose and evaluate a combined SVC-MDC (Scalable Video Coding & Multiple Description Video Coding) video coding scheme for Peer-to-Peer (P2P) video multicast. The proposed scheme is based on a full cooperation established between the peer sites, which contribute their upload capacity during video distribution. The source site splits the video content into many small blocks and assigns each block to a single peer for redistribution. Our solution is implemented in a fully meshed P2P network in which peers are connected to each other via UDP (User Datagram Protocol) links. The video content is encoded by using the Scalable Video Coding (SVC) method. We present a flow control mechanism that allows us to optimize dynamically the overall throughput and to automatically adjust video quality for each peer. Thus, peers with different upload capacity receive different video quality. We also combine the SVC method with Multiple Description Coding (MDC) to alleviate the packet loss problem. We implemented and tested this approach in the PlanetLab infrastructure. The obtained results show that our solution achieves good performance and remarkable video quality in the presence of packet loss.
50
NAKAMURA, NOBUHIRO, LEONARD BAROLLI, SOUICHIROU TAKAHAMA, KAORU SUGITA, JIANHUA MA, and ARJAN DURRESI. "IMPLEMENTATION OF A PURE P2P COLLABORATION MULTIPLATFORM AND ITS APPLICATIONS." Journal of Interconnection Networks 06, no. 03 (September 2005): 229–44. http://dx.doi.org/10.1142/s021926590500140x.
Full textAbstract:
Peer-to-Peer (P2P) computing offers many attractive features, such as collaboration, self-organization, load balancing, availability, fault tolerance and anonymity. However, it also faces many serious challenges. In our previous work, we implemented a synchronous P2P collaboration platform called TOMSCOP. Based on the elementary peer group services offered by the JXTA general framework, TOMSCOP provides four types of services: synchronous message transportation, peer room administration, peer communication support and application space management. By using the four services, different kinds of shared applications for various specific purposes can be relatively easily developed and associated collaborative cyber spaces or communities can be quickly built across the JXTA virtual network overlaid on top of the existing physical networks. However, the TOMSCOP was implemented only in Windows XP OS. In this paper, we extend our previous work and present the implementation of a Multi-Platform P2P System (MPPS). The proposed system operates very smoothly in UNIX Solaris 9 OS, LINUX Suse 9.1 OS, Mac OSX, Windows XP and NetBSD.