The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Performance improvements are quite significant for a complex protocol, such as BitTorrent protocol, but should take no harm to its functionality correctness as an inevitable precondition. In current performance analysis studies, various formal models are usually utilized to perform corresponding evaluations. However, most of those models do not support specifying and verifying the functionality for...
Peer-to-peer distributed storage systems aggregate the storage space of many peers spread over the Internet. Due to the dynamic and scalable nature of these systems, it is a challenging issue to access data in an available and reliable way through redundancy. Following the modeling methodology presented, we present the stochastic model to analyze redundancy evolution of these systems under churn....
Peer-to-Peer(P2P) network has some closer relation-ship with Internet while the scale of P2P network increases. Active P2P worms attack neighbour peers based on hit-list and pose a severe threat to both P2P network and Internet. Due to the complexity of P2P network, the traditional worms propagation model cannot be adequate to exact model P2P worms spread. Both the dynamic characteristic of P2P network...
In many applications, one class of data is presented by a large number of examples while the other only by a few. For instance, in our previous works on identification of peer-to-peer (P2P) Internet traffics, we observed that only about 30% of examples can be labeled as ldquoP2Prdquo using a port-based heuristic rule, and even fewer examples can be labeled in the future as more and more P2P applications...
The paper presents a hierarchical organization of two storage redundancy schemes to improve data availability caused by churn in structured overlay networks. To mask or hide the high churn from the portion of short-lived but frequent churn peers and permanent failure peers, we use replication among the nodes in a certain interval that can be considered as a virtual node. Then a set of virtual nodes...
CDN (Content Delivery Network) and P2P (Peer-to-Peer) are two dominant technologies in large-scale content distribution. However, they have their own advantages and disadvantages. In this paper, an efficient hierarchical content distribution scheme is proposed, integrating the traditional CDN and centralized P2P. In our approach, content distribution is divided into two stages. In the CDN-level core...
It is meritorious but hard to develop a scalable and manageable system to effectively distribute the large-scale multimedia contents. In this paper, an integrated hierarchical content distribution system is proposed, which utilizes the complementary advantages of both CDN (content delivery network) and P2P (peer-to-peer). The hybrid architecture and distribution operations are presented in detail...
We apply streaming data mining techniques, and in particular, concept-adapting very fast decision tree (CVFDT) to identify peer-to-peer (P2P) applications in Internet traffic, as the Internet data flows dynamically in large volumes (streaming data), and in P2P applications, new communities of peers often attend and old communities of peers often leave, requiring the identification methods to be capable...
This paper analyzes churn impact on replicated data duration with different node lifetime distributions. In structured overlay networks, churn includes node-join churn and node-failure churn, caused by the arrival and departure of nodes separately. The paper introduces a duration model of replicated data under node-failure churn for node failure directly leads to data loss. Furthermore, it investigates...
For practical deployment of peer-to-peer (P2P) systems, it is one of the most important and challengeable aspects to achieve high data availability in structured P2P systems since the environment is much scalable and dynamic. The paper utilizes the hybrid of two data redundancy schemes, namely replication and erasure coding, to improve system availability. To mask or hide the high churn from the short-lived...
The primary challenge in developing a peer-to- peer(P2P) file sharing system is implementing an efficient keyword search mechanism. Current keyword search approaches for structured P2P networks are built on the distributed inverted index by keywords. However, when executing multiple-attribute queries, they suffer from the problem of unscalable bandwidth consumption. Moreover, these approaches only...
Traditionally, full text retrieval over structure peer- to-peer network has been implemented by inverted index by keywords. However, search based on this index scheme only support literally word match, not taking into account the meaning of words. In this paper, we present a new index scheme, inverted index by concepts, for document retrieval over structure P2P network. We introduce ontology to capture...
Recent research has explored that if network churn is not very high, maintaining global lookup table at every node is reasonable. This paper presents GRBM protocol for maintaining global lookup table. In GRBM, events are merged into notification message in the dispatcher node. Then notification messages are sent to all nodes using a novel event dissemination algorithm. It shows that GRBM is able to...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.