In this paper we propose a new protocol for unstructured and semantic-searching based p2p networks: Bittella. It forms a three level overlay network: the lowest level is the unstructured p2p network (e.g. Gnutella). The medium level is formed by clusters per content, we call the resulting structure Small World per Content structure. This level allows the utilization of Bittorrent-like download ...

The popularity of peer-to-peer (P2P) file sharing systems such as Napster, Gnutella and Freenet, has inspired a whole new breed of P2P storage systems, which aims to harness the rapid growth of network bandwidth and storage capacity to provide inexpensive, scalable, fault-tolerant, and highly-available storage without centralized servers. Many P2P storage systems have been proposed and describe...

In Peer-to-Peer networks, multi-keyword searching with wildcard support represents a difficult problem in which many trade-offs between efficiency and flexibility must be made. In Distributed Hash Tables, algorithms such as Squid must overcome the complexity of mapping a multi-dimensional address space onto a onedimensional address space whilst limiting or avoiding the amount of traffic and hot...

Free riding is a common phenomenon in P2P networks. Although several mechanisms have been proposed to handle free riding— mostly to exclude free riders, few of them have actually been adopted in practical systems. This may be attributed to the fact that they are nontrivial, and that completely eliminating free riders could jeopardize the sheer power created by the huge volume of participants in...

The research on P2P systems which support skewed key distributions has rapidly advanced in the recent years. Yet, the assumptions on the skews we are dealing with remained pretty simple: most of the existing literature assumes simple monotonous key distribution skews. However, this is not always the case. For example, Gnutella filename traces show that complex key-distributions rather than mono...

A lot of attention has recently been focused oti Peer-topeer file sharing systems. Cniitella is CI fu l ly distribiited peer-to-peer protocol, without the need for N central entity. This increcises the reliability of the system by uvoicfitig ci single point of failure as well making it more immune to legal attack. The two main featiires of the Gnutella protocol, discoven of peers and searching ...

The ever increasing growth of peer-to-peer networks calls for effective construction of overlays keeping in view the properties and capabilities of the underlay network. The capabilities of the peers participating in the network can be used effectively to bias the neighbor selection and improve the network performance by assigning more responsibility to nodes with high capabilities. This system...

In unstructured peer-to-peer (P2P) systems such as Gnutella, a general routing search algorithm is used to blindly flood a query through network among peers. But unfortunately, malicious nodes could easily make use of the search approach launching distributed denial of service (DDoS) attack which aims at the whole network. In order to alleviate or minimize the bad effect due to behavior of mali...

The measurement of a search algorithm for unstructured P2P network centres on the number of nodes not receiving their requested files (number of failures) and the number of hops per query. Most current search algorithms are unable to guarantee the success of the query. This study involves a comparison of the strengths and weaknesses of three algorithms of Gnutella P2P protocol, namely Flood, Ra...

International Journal of Parallel, Emergent and Distributed Systems Publication details, including instructions for authors and subscription information: http://www.informaworld.com/smpp/title~content=t713729127 On the session lifetime distribution of Gnutella Kevin Ho a; Jie Wu b; John Sum c a †Department of Computer Science and Communication Engineering, Providence University, Taichung, Taiwa...