Sharif Digital Repository

Efficient storage and handling of data stored in a peer-to-peer (P2P) network, proves vital for various applications such as query processing and data mining. This paper presents a distributed, scalable and robust layered overlay (L-overlay) to index and manage multidimensional data in a dynamic P2P network. The proposed method distinguishes between the data and peer layers, with efficient mapping between the two. The data is organized such that semantically similar data objects are accessed hastily. Grid and tree structures are proposed for the peer layer. As application examples of L-overlay in query processing and data mining, k-nearest neighbors query processing and distributed Naïve... 

Peer-to-peer networks (P2P) are beginning to form the infrastructure of future applications. One of the problems with unstructured P2P networks is their scalability limitation. This is also the problem in structured P2P networks that use broadcasting to find objects. These networks can't contain a large number of nodes because of the large amount of traffic that they have to handle. Local indexing is a method to reduce this traffic. But local indexes tend to become large with the growth of the network. Also limiting the size of these indexes causes loss of indexing information. In this paper we introduce a novel ontology based local index which limits the size of the local indexes without... 

Unlike those on Internet, the media providers on P2P networks are ordinary nodes whose contribution bandwidth is limited. Multi-sender methods are the best solutions known to video streaming on P2P networks. In this paper, we propose use of a multi-cast method on the top of an arbitrary multi-sender method so that all requesting peers receive almost the same expected bit-rate. That is while the existing multi-sender methods maximize the bit-rate delivered to the first receiver and cannot provide acceptable bit-rates to the next requesting nodes. © 2006 IEEE  

Large scale decentralized communication systems have motivated a new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. While a geometrical online routing scheme is expected to deliver each packet to the point in the network that is closest to the destination, geometrical greedy routing, when applied over generalized substrate graphs, does not guarantee such delivery as its forwarding decision might deliver packets to a localized minimum instead. This letter investigates the necessary and sufficient conditions of greedy... 

In this paper, we introduce a novel algorithm for rate allocation in media streaming P2P networks where multimedia contents are distributed among network members and streamed toward any requesting peer. The proposed algorithm is based on ant-colony optimization. It is capable of handling network dynamism, which is an inherent property of unstructured P2P networks. Another advantage of our algorithm is its ability to get over uncertainties in network state information, particularly the rate of supplying peers that could happen due to lack of accurate measurements. In addition, the suggested method does not rely on any information about the topology of the network. We have investigated both... 

Effectiveness of P2P systems highly depends on efficiency of their search algorithms. With existence of malicious and dishonest nodes, reputation systems are essential to evaluate the trustworthiness of participating peers and to combat subversive peer behaviours. Surprisingly majority of the available reputation systems, ignore the underlying search algorithm and assume it pre-existing. In this paper we propose TBSearch, a robust and efficient trust based search algorithm for unstructured P2P networks. TBSearch maintains limited size routing indexes combining search and trust data, to guide queries to most reputable nodes. We introduce a low overhead method of estimating peers' reputation... 

Since the emergence of peer to peer networks, search efficiency in such networks has been a matter of great concern, as it directly effects resource management of the network and influences users' satisfaction. In unstructured p2p networks, various search algorithms have been proposed so far that offer a tradeoff between scalability, congestion and user's satisfaction. In this paper, we survey newly introduced approaches to overcome search process problems. By reviewing these strategies and comparing them with previous search methods, we propose a new classification of informed search algorithms and we conclude that regarding this classification, informed search algorithms should be applied... 

The Gnutella protocol requires peers to broadcast messages to their neighbors when they search files. The message passing generates a lot of traffic in the network, which degrades the quality of service. We propose the new method to optimize the speed of search and to improve the quality of service in a Gnutella based peer-to-peer environment with using semantic routing and priority of nodes. Once peers generate their "friends lists", they use these lists to route queries in the network. This helps to reduce the search time and to decrease the network traffic by minimizing the number of messages circulating in the system as compared to standard Gnutella  

Effectiveness of Peer-to-Peer (P2P) systems highly depends on efficiency and scalability of their search algorithms. Moreover, managing trust is a key issue for wide acceptance of P2P computing. Surprisingly, the majority of the available trust systems ignore the underlying search algorithm and assume it is preexisting. We claim that combining search and trust systems yields significant performance gains in terms of network traffic and query success rate. In this paper, we propose a robust and efficient trust based search framework for unstructured P2P networks. Our framework maintains limited size routing indexes combining search and trust data to guide queries to most reputable nodes. By... 

In this paper, a new search algorithm in heterogeneous hierarchical unstructured p2p networks is presented which takes into account heterogeneity of peers such as upload bandwidth, life time in the network and process capacity in its peer discovery policy as factors that influence download performance and user satisfaction. One advantage of this algorithm is that it can be performed in a completely unstructured network without imposing any change on network topology and file replication. However, it obviously decreases file download time as it is designed to discover broad-bandwidth nodes with a higher probability. This property results in a fair distribution of load over heterogeneous p2p... 

Today P2P networks are responsible for a large amount of traffic on the Internet, as many Internet users employ such networks for content distribution. At the same time, P2P networks are vulnerable to security threats such as Internet worms and facilitate their propagation. Internet worms and more generally malware are a major concern to the network security community. There are many different type of worms in the wild, mostly categorized based on how they find and infect their new victims (i.e. active, passive, etc.). In this paper, we investigate a new approach for detecting passive worms and malware in P2P networks based on the popularity of files in the network. As part of our... 

The minimum linear arrangement (MINLA) is a NP-hard problem in general. But there are some classes of graphs optimally solvable in polynomial time. In this paper, we solve the minimum linear arrangement problem for a new class of graphs (Chord graphs) in polynomial time. Also, we present a closed formula for the cost of optimal arrangement. Our motivation to solve the problem for this class of graphs is its application in optimization of peer-to-peer overlay networks. © 2008 Elsevier Inc. All rights reserved  

We present an ontology based indexing method for unstructured P2P networks. We maintain limited size indexes at each node to identify number of documents accessible on each concept without loosing any indexing information. Out method supports complex queries, combined of conjunction and disjunction phrases. We simulate our search algorithm on an unstructured P2P network and show that our method significantly reduces the network traffic. © 2008 Springer-Verlag  

Peer-to-peer networks are beginning to form the infrastructure of future applications. The use of semantic information to organize nodes in a P2P network is a prosperous approach. In this paper we present a novel method, called Semantic Partition Tree, which organizes nodes in a semantic space, using an upper ontology. In this approach each node can find a target in a time proportioned to the depth of the upper ontology, which is significantly less than the number of nodes in the network. Also we simulated our method with several configurations and measured its performance. The results of the simulation show that our scheme is highly scalable and can be used by real P2P networks. © 2007 IEEE... 

Almost all existing multi-description coding (MDC) schemes are designed for media streaming over Internet. In this work, a wavelet-based video MDC technique is introduced that fits the criteria of media streaming over peer-to-peer networks. Our proposed method assigns descriptions to the senders due to their characteristic (i.e. bandwidth and availability). In contrast to traditional MDC, different descriptions in the proposed method have different importance in remaking the original media. Our simulation results show considerable improvement of video quality at the receiver (up to 10 dB) as compared to the state-of-the-art. ©2007 IEEE  

There are two main scalable methods for streaming live video over the Internet: Content Delivery Networks (CDNs) and Peer-to-Peer (P2P) networks. Though both have their own problems, P2P streaming systems challenge delivering video with constant quality and CDNs approaches require deployment of large number of servers throughout the Internet that is costly. Recently, using hybrid architectures based on both CDN and P2P networks has shown to be an efficient approach for large-scale video distribution over the Internet. This paper is compared the performance of two main hybrid CDN-P2P architectures includes: (i) CDN-P2P unconnected mesh in which independent P2P mesh networks are constructed... 

Due to special constraints in peer-to-peer (P2P) networks (such as bandwidth limitation) and because of their highly dynamic characteristics, a single node cannot provide a reliable multimedia stream to the receivers. Several multi-sender algorithms are proposed to reliably deliver a media stream to the receiver through the intrinsically unreliable P2P networks. Based on upload bandwidths and availability of peers as well as the bandwidths of the links connecting the senders and the receiver, PROMISE selects a set of active senders to maximize the expected bit-rate delivered to the receiver. By careful investigation of PROMISE, in this paper, we present why and how it deviates from finding... 

In this paper, we propose a novel algorithm for rate allocation in multiple-source media streaming peer to peer networks. Our algorithm is based on ant-colony optimization and capable of handling network changes which occur quite often in unstructured P2P networks. The suggested algorithm does not need any information about the topology of the network. Moreover, it could get over uncertainties in network state information, particularly the rate of media provider nodes that could happen due to lack of accurate measurements. We show that our algorithm will reach the maximum achievable rate of the network quite fast and with relatively little overhead. In our simulations, we have demonstrated... 

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Heavy network traffic limits the scalability of P2P networks. Indexing is a method to reduce this traffic. But indexes tend to become large with the growth of the network. Also, limiting the size of these indexes causes loss of indexing information. In this paper we introduce a novel ontology based index (OI) which limits the size of the indexes without sacrificing indexing information. We show that the method can be employed by many P2P networks. The OI sits on top of routing and maintenance modules of a P2P network and enhances it. The OI prunes branches of search trees which have no chance to... 

The simplicity, low cost, preserving anonymity, and availability of Peer-to-peer (P2P) systems, especially with the advent of file-sharing networks, make them a favorite architecture for users. To reach this infrastructure, there are some challenges that must be addressed. One of the most important challenges is providing service security and trust. But due to the properties of P2P networks, it is difficult and complicated to design and implement a trust system. Some of the trust systems consider only one criterion to evaluate trust; it's simple but not so effective and has restricted applications. On the other side, considering multi-criteria is more effective but needs a systematic way to...