P2P Network Model Research Articles

Analysis of P2P network system based on two‐stage service and failure repairability

SummaryAlong with the rapid development of the information technology revolution, P2P technology has been more and more widely and deeply researched in the field of mobile wireless, and mobile P2P has become an emerging and popular research field. The particularity of the mobile environment has extremely high requirements on the P2P network topology, resource transition paths and network security. In this paper, a two‐stage queueing model with negative customers and asynchronous failure is established based on a hybrid mobile network model combining the semi‐distributed topology and the fully‐distributed topology. Using the matrix‐geometric solution and Gauss‐Seidel iterative method, the probability distribution of the network model in steady‐state is obtained, and expressions for performance indicators such as the average number of peers in the two stages are given. Numerical experiments were conducted using programming software to analyze the effect of parameters on each indicator. The optimal parameters were solved by constructing the average cost unit time function and social benefit function to provide decision foundation for the mobile P2P network model.

A Secure and Anonymous Communicate Scheme over the Internet of Things

Anonymous exchange of data has a strong demand in many scenarios. With the development of IoT and wireless networks, plenty of smart devices are interconnected through wireless technologies such as 5G and Wi-Fi, making it possible to use them for information exchanging. The authors find a P2P network model for secure and anonymous communication, which is a typical Crowds system and the operating mechanism meets the characteristics of limited-resources of IoT devices. Based on this network model, the authors design a lightweight communication scheme for the remote-control system in this work, using two kinds ofVirtual-Spaces to achieve the purpose of identity announced and data exchanged. The authors implemented a prototype system of the scheme and tested it over theFreenet, proving that the scheme can effectively resist the impact of flow analysis on the anonymity of communication while ensuring communication data security. By analyzing the scheme’s performance, the author believes that the scheme is practical and is suitable for scenarios that are not time-sensitive but require high anonymity.

P2P Network Based on Neighbor-neighbor Lists

In order to solve the vulnerability of the network structure in the real world, this paper constructs a P2P network model based on neighbor-neighbor lists. We propose two algorithms, network repairing and pruning, to improve the effectiveness and robustness of the network. Simulation experiments show that the proposed model and algorithms can effectively enhance the self-healing of P2P network.

An Analytical Method of Network Service Scalability

The research of network service scalability is essentially the research of the capability of providing service, which is based on services and the relationship among the services. However, most of the researches ignore the systematic research on analytical methods of service scalability in network systems, owing to the complexity and the diversity of the network system. In this paper, we propose an analytical method of network service scalability, which is composed of a network description model and a service evaluation model. The method uses the network description model to describe services and the relationship among them. After presenting the network description, the method uses the service evaluation model to analyze the network service scalability. For analyzing and simulating purposes, we select three P2P network models, which are different with each other in network topologies as an example. Our simulation results which are in accord with the results of the example analysis verify the correctness and applicability of the analytical method.

Dynamical Analysis of an Internet-Based Video System

The dissemination of video applications across the Internet still remains the driving force for Internet traffic growth. Generally, video streaming systems are characterized with irregular transmitting pattern and fluctuation which usually leads to transmission delay and frame loss. Furthermore, the democratic platform created by peer-to-peer (P2P) network for video streaming suggests complex dynamical behaviour with difficult predictable performance. The existence of flash crowd and peer churn situations in P2P streaming systems obtained from random arrival and departure of peers exhibits chaotic attributes. In this paper, a P2P streaming system(UStream) was modelled using a system of first order differential equations. The dynamics of UStream were analysed using equilibrium points and eigenvalues structure. Instability region was tracked through numerical investigation. The numerical simulation conducted using the Mathematica package software showed that UStream exhibits spiral fixed point and strange attractors with certain initial conditions which confirms experimental measurement and observations. Also, the system responds exponentially with time and reflects instability pattern for the first 20 seconds and 500 seconds when investigated with client-to-server(CS)and P2P network models respectively.

CDN and P2P Network Model Based on HCDN Technology

CDN and P2P Network Model Based on HCDN Technology

Research on the Risk Characteristics and Regulation Paradigm of Internet Financial

Based on introducing the Internet finance and its development course, it combed the Internet finance related theory and analyzed the Internet financial P2P network model. The raised platform model has big data financial mode and third-party payment mode and development mode and puts forward the thinking of Internet financial risk and regulation.

On exploiting social relationship and personal background for content discovery in P2P networks

Content discovery is a critical issue in unstructured Peer-to-Peer (P2P) networks as nodes maintain only local network information. However, similarly without global information about human networks, one still can find specific persons via his/her friends by using social information. Therefore, in this paper, we investigate the problem of how social information (i.e., friends and background information) could benefit content discovery in P2P networks. We collect social information of 384,494 user profiles from Facebook, and build a social P2P network model based on the empirical analysis. In this model, we enrich nodes in P2P networks with social information and link nodes via their friendships. Each node extracts two types of social features–Knowledge and Similarity–and assigns more weight to the friends that have higher similarity and more knowledge. Furthermore, we present a novel content discovery algorithm which can explore the latent relationships among a node’s friends. A node computes stable scores for all its friends regarding their weight and the latent relationships. It then selects the top friends with higher scores to query content. Extensive experiments validate performance of the proposed mechanism. In particular, for personal interests searching, the proposed mechanism can achieve 100% of Search Success Rate by selecting the top 20 friends within two-hop. It also achieves 6.5 Hits on average, which improves 8x the performance of the compared methods.

A Network Model of P2P Extending to Private Network

With the expansion of private network scale, the shared resource is very rich in its internal. How does the P2P network extend to the private network, and conduct good integration of the resources becomes a much valuable research subject. The paper puts forward a new P2P network model, and describes the network organization mode, the cooperation relations between the nodes, and node join and exit algorithm in detail. The model has highly self-organized and scalability in private internal network; it does not need public network nodes involved in.

Research on P2P Overlay Network Model with Small-world Features

Topology structure of P2P network decides its system performance. However, the existing P2P network models don’t take clustering and symmetry of nodes into account. Based on the algebra and graph theory method of Cayley graph, this paper proposes a novel P2P overlay network model with small-world features. Its simplicity and symmetry can ensure the self-organization and scalability of P2P network. The results of analysis and experiment shows that this model provides better robustness, higher enquiry efficiency and better load balance than the existing P2P Overlay Network models such as Chord and CAN. Furthermore, it possesses the property of high clustering.

Design on the Network Model of Cloud Computing Based on P2P

Cloud computing has already became one of the most sought-after center topics in the global IT industry, not only IT companies and the famous Internet enterprise, but also in each fields related to computer and the Internet are research and apply the cloud computing. The technology related to Cloud computing has also changed. This paper presents a hybrid P2P network model in the environment of cloud computing, defines the model, research and design the structure of the model, using DHT algorithm located the resource of Hash ring and analyzed the ring node in-and-out in detail. Finally, using the related mathematical theory deduce the performance evaluation results that the model of node can be hierarchical classification, improve the efficiency of information positioning and searching.

P2P Overlay Network Based on Resource Routing Table

In unstructured P2P network, mismatch between logical topology and physical topology cause communication latency increasing and network load heaving. Consider the position and attribute of peers, the issues proposed a three layers mixed P2P network model. In the model, neighbor peers form domain, peers with the similar character compose groups in every domain. In the third layer of model, resource routing table is introduced to performance resource searching cross-domain. Simultaneously, P2P network dynamic adaptability is described detaily. Simulation result show the model can effectively shorten resource search delay and reduce the network load.

A P2P Network Model Based on Hierarchical Interest Clustering Algorithm

A hierarchical clustering P2P network model based on user interest is presented in this paper to improve search efficiency. The routers in the network are abstracted as the activated peer node, and the activated routing table is constructed to depict the character of the interest cluster. The P2P network is divided into different subnets according into their interest character, and the corresponding topological structure is build. The corresponding search strategy is proposed based on the above mention method. The simulation results show that compared with the traditional algorithm the interest cluster method proposed in this paper can form cluster more rapidly, and gain the appropriate resources faster.

Study of P2P network model based on distributed Agent memory mechanism

Since such problems of P2P network as node frequent offline,lack of trust mechanism and bandwidth limited influence the service quality,a distributed Agent memory mechanism of P2P network model was presented.In this model,the data were divided into several blocks of data,the block service was evaluated after the node visit,and data block content and service evaluation update were stored in the neighborhood node and subsequent node;when the node visits information,according to local strategy,optimize memory,and regularly update and delete for a low service evaluation memory.The model of distributed data blocks through memory and dynamic data updated Agent improves the data availability effectively,stops the spread of the virus document,reduces bandwidth pressure,improves the searching efficiency,and increases the system security and network performance.

Peer-to-peer-based resource discovery in global grids: a tutorial

An efficient resource discovery mechanism is one of the fundamental requirements for grid computing systems, as it aids in resource management and scheduling of applications. Resource discovery activity involves searching for the appropriate resource types that match the user's application requirements. Various kinds of solutions to grid resource discovery have been suggested, including centralized and hierarchical information server approaches. However, both of these approaches have serious limitations in regard to scalability, fault tolerance, and network congestion. To overcome these limitations, indexing resource information using a decentralized (e.g., peer-to-peer (P2P)) network model has been actively proposed in the past few years. This article investigates various decentralized resource discovery techniques primarily driven by the P2P network model. To summarize, this article presents a: summary of the current state of the art in grid resource discovery, resource taxonomy with focus on the computational grid paradigm, P2P taxonomy with a focus on extending the current structured systems (e.g., distributed hash tables) for indexing d-dimensional grid resource queries,1 a detailed survey of existing work that can support rf-dimensional grid resource queries, and classification of the surveyed approaches based on the proposed P2P taxonomy. We believe that this taxonomy and its mapping to relevant systems would be useful for academic and industry-based researchers who are engaged in the design of scalable grid and P2P systems.

Application of Peer-to-Peer Network for Real-Time Online Collaborative Computer-Aided Design

The Internet has revolutionized the way software systems work. Many applications, such as online games and instant messengers, have utilized Web-related technologies to cooperate over the Internet. Recently, some researchers have utilized Web-related technologies in computer-aided design to allow real-time collaboration between users over the Web. All these systems are based on the client-server model. In this kind of collaborative design environment, the system grouping, operation, and communication all have to rely on the central server. In order to improve accessibility and flexibility in collaborative design and to provide a more load-balanced and extensible environment, this paper presents a prototype implementation of collaborative design tools based on a peer-to-peer (P2P) model. The users can conveniently form design groups by connecting directly to each other, anytime and anywhere, without the presence of a central server. All peers are equal in functionalities and computing loads. In addition, application level multicast (ALM) technology is adopted in the proposed system to improve efficiency in Internet communication. Based on the P2P network model and ALM communication scheme, several mechanisms are proposed in this paper to form a working model of this system. Then, the object model design and implementation of this P2P system is presented.

A P2P Network Model with Multi-Layer Architecture Based on Region

Gnutella application layer protocol simply uses flooding algorithm to route peer’s querying, which is just implemented on application layer and doesn’t use down-layer’s information routing of Internet. So it has poor scalability and low efficiency. This paper uses the model of “small world and power law” as the theoretical foundation, and in the light of the users’ requirement and a shared organization layer and region of logic manage-unit, a new distributed peer-to-peer network model of RLP2P(region-layer P2P) with multi-layer structure based on region is proposed, and its prototype system is implemented. A new optimized Multilayer Light-Gossip route strategy is implemented. This paper studies the stress and stretch with the model which has two intuitive metrics of goodness defined to evaluate the quality of the data paths. At the same time, the idea is put forward about the tradeoffs between the stress and stretch. Simulation results about RLP2P’s protocol show that it could effectively solve the above problems, and the larger the network size is, the more obvious the superiority of its comprehensive performance is. So the model is reasonable and effective.