Papers by Keyword: Peer-to-Peer (P2P)

Abstract: For the lack of management mechanism in P2P VoD system, this paper presents design of a manageable P2P VoD system, describes the system architecture and design of each module, and been tested on CERNET2. By using intelligence node management, it has resolved the inefficient management problem of traditional P2P distribution system.

Abstract: Voronoi-based Overlay Network (VON) has been proposed that promises to maintain high overlay topology consistency in a bandwidth-efficient manner. VoroCast constructs a spanning tree across all AOI neighbors based on Voronoi diagrams, while FiboCast dynamically adjusts the messaging range by a Fibonacci sequence. VoroCast improves the AOI scalability of P2P-based NVEs. However, one potential drawback of the schemes is that the child node degrees are only based on peers' positions, but not node capacities. Since each node in VoroCast has different capacity, packet loss will be unavoidable. VoroCast may lead to lower multicast efficiency in AOI. To these problems, an Advanced AOI-cast algorithm based on PCA is presented. In the algorithm, node capacity is related to node CPU (c), node bandwidth (b) and node memory (m), and the node capacity is calculated according to the PCA. An undirected graph is formed through all the nodes in the AOI and the edge weights are calculated by the Gaussian function. Through the prim algorithm, to generate the minimum spanning tree of the weighted undirected graph, and the minimum spanning tree is used as the final multicast tree. The message is delivered through the multicast tree. The simulation results show that the algorithm gains a greater improvement on multicast efficiency, and achieves better scalability.

Abstract: This paper expatiate the principle ,structure ,and the methods based on P2P resource searching technology by classifying the features，conclude and analyse present main developing directions and development state- Put forward a MRD algorithIT1 which is based on Distributed Hash Table(DHT), and conclude with efficiently searching probability of Networking resource searching by mathematic analysis alast.

Abstract: Relationship between nodes in peer-to-peer overlay, currently becomes a hot topic in the field of complex network. In this paper a model of peer-to-peer overlay was purposed. And then the paper focused on figuring out the mean-shortest path length (MSPL), clustering coefficient (CC) and the degree of every node which allowed us to discover the degree distribution. The results show that the degree distribution function follows approximately power law distribution and the network possesses notable clustering and small-world properties.

Abstract: Now 3G mobile technologies is the research focus in the field of mobile communication. Streaming media technology based on 3G networks is always difficult problems in this field. P2P streaming media technology has become the mainstream application form of internet. In this paper, we design a P2P streaming media cache allocation algorithm based on 3G networks. This algorithm use network protocols to connect 3G network with P2P network to minimize transmission delay and to improve the transmission efficiency. Simulation experiments show that this algorithm presented in this paper has the obvious performance advantage in transmission delay and transmission efficiency.

Abstract: The thesis puts forward the concept of Computer Supported Technical Assistance (CSTA) for the first time. CSTA is the main form for technical assistance in the information society. The process, technical feature and advantage of CSTA as well as the primary research content and the conventional form were analyzed in the paper. In order to be seasoned with the new requirement of technical assistance, the network architecture of CSTA based on P2P was discussed.

Abstract: Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, the heterogeneity is an inherent characteristic of P2P systems. In this paper, according to the previous researches in P2P resource sharing networks, we first conclude and classify the heterogeneity in P2P networks, and then analyze each type of P2P systems that utilize heterogeneity in P2P network. The above analysis and conclusion will become a good guidance to design new resource locating algorithm which takes advantage of heterogeneity in P2P networks.

Abstract: The platform of rural distance learning is an interactive tool used to farmers for the video training, interactive consulting, teaching and management with the features of resource integration, safe, and reliable. The platform was dual-network transmission structure via the Internet and E-government network, covering all the Beijing’s towns and villages, which is applied media asset management technology to build a municipal teaching resource library. The problems of the platform are solved such as complex network for rural areas, limited bandwidth resources and diverse user needs base on in-depth study of distance learning key technologies. The system was easy to deploy, highly scalable, and low cost operation. It is for farmers learning modern agricultural technology to provide a strong support.

Abstract: To solve the Grid resource discovery framework problem, this paper proposes the resource discovery mechanism based on Peer-to-Peer (P2P). The mechanism introduces the concept of super-node (SN) and virtual organization (VO), which combines both the advantage of decentralized and centralized resource discovery, and makes up a layered resource management model: SN manages user and storages resource information by MDS(Meta Data Service) mechanism in the VO; a P2P virtual level is composed of a large amount of peer service (PS) among VOs, which utilizes the querying and transmitting policy based on historical information and control the diffusion algorithm in resource discovery mechanism. And the simulation shows that the algorithm can find the most suitable resources and improve resource discovery efficiency.

Abstract: This paper proposes a novel breadth-first search algorithm and deals with the problem of duplicate web pages removing and page ranking by the principle of Small World phenomena. The features of algorithm in this paper are as follows: 1) it proposes the Unit Tree-based Breadth-First Search Algorithm and performs a qualitative analysis and simulated calculation of the performance, with the results demonstrating that the algorithm in this paper reduces the number of neighboring nodes to which messages shall be forwarded and redundant messages as compared with traditional Breath-First Search algorithm and Random Breath-First Search algorithm; 2) it proposes a solution to the problem of duplicate web pages removing and page ranking by Small World phenomena, with the results demonstrating that the method in this paper can effectively bring processing workload, waiting time and the pointless network bandwidth consumption of source node searching into balance.