Unstructured P2P networks have been widely used to implement resource location systems that support complex queries semantics. Unfortunately these systems usually rely on blind search algorithms, based on flooding, which generate a significant amount of duplicate messages. An effective way to minimize the cost of query flooding in unstructured P2P networks is the use of super-peers. On the othe...

P2P Networks are highly dynamic structures since their nodes – peer users keep joining and leaving continuously. In the paper, we study the effects of network change rates on query routing efficiency. First we describe some background and an abstract system model. The chosen routing technique makes use of cached metadata from previous answer messages and also employs a mechanism for broken path...

A significant part of the Internet traffic today is generated by peer-to-peer (P2P) applications used originally for file sharing, and more recently for real-time communications and live media streaming. Such applications discover a route to each other through an overlay network with little knowledge of the underlying network topology. As a result, they may choose peers based on information ded...

Peer-to-Peer systems form logical overlay networks on top of the Internet. Essentially, peers randomly choose logical neighbours without any knowledge about underlying physical topology. This may cause inefficient communications among peers. This topology mismatch problem may result in poor performance and scalability for Peer-to-Peer systems. A possible way to improve the performance of Peer-t...

Location-based services promise to offer highly personalized content based on the users current geographical position. A typical example is a restaurant finder service that returns a list of restaurants in specified proximity of the users ́ current position (via GPS or mobile phone triangulation). Building the infrastructure necessary to offer competitive global location based services of differ...

Peer-to-peer (P2P) systems have enjoyed immense attention and have been widely deployed on the Internet for well over a decade. They are often implemented via an overlay network abstraction atop the Internet’s best-effort IP infrastructure. P2P systems support a plethora of desirable features to distributed applications including anonymity, high availability, robustness, load balancing, quality...

0957-4174/$ see front matter 2009 Elsevier Ltd. A doi:10.1016/j.eswa.2009.01.045 * Corresponding author. Tel.: +886 3 4227151x353 E-mail address: [email protected] (S.J.H. Yan As a large amount of information is added onto the Internet on a daily basis, the efficiency of peer-to-peer (P2P) search has become increasingly important. However, how to quickly discover the right resource in a la...

Even though recent research has identified many different uses for peer-to-peer (P2P) architectures, file sharing remains the dominant (by far) P2P application on the Internet. Despite various legal problems, the number of users participating in these file-sharing systems, and number of files transferred, continues to grow at a remarkable pace. Filesharing applications are thus becoming an incr...

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 index...

Blockchain systems rely on peer-to-peer (P2P) overlay networks to propagate transactions and blocks. The node management of P2P affects the overall performance reliability system. traditional structure is based random connectivity, which known be an inefficient operation. Therefore, we propose MSLT, a multiscale blockchain network method improve transaction performance. This approach involves c...