In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algorithm that we proposed earlier, with support of message routing in the wide-area networks. Our algorithm is suitable for two kinds of PAs collaboration: (1) within a local group of mobile individuals, who can communicat...

The use of under-utilized Internet resources is widely recognized as a viable form of high performance computing. Sustained processing power of roughly 40T FLOPS using 4 million volunteered Internet hosts has been reported for embarrassingly parallel problems. At the same time, peer-to-peer (P2P) file sharing networks, with more than 50 million participants, have demonstrated the capacity for s...

Distributing the crawling activity among multiple machines can distribute processing to reduce the analysis of web page. This paper presents the design of a distributed web crawler based on Peer-to-Peer network. The distributed crawler harnesses the excess bandwidth and computing resources of nodes in system to crawl the web. Each crawler is deployed in a computing node of P2P to analyze web pa...

Peer-to-peer systems have emerged as a significant social and technical phenomenon, and they are likely to gain popularity as low-cost individual computing and storage resources become more widely available and network connectivity increases. Unlike traditional distributed systems, P2P networks aggregate large numbers of computers that join and leave the network frequently and that might not ha...

SHARK is a novel concept and middleware service for search in peer-to-peer (P2P) networks. Rather than flooding a network like Gnutella or imposing numerical IDs on objects like distributed hash tables, it is based on directed routing of keywords in a multidimensional redundant metadata hierarchy. SHARK arranges nodes and objects in the network and in semantic clusters. In spite of its rich key...

With the flurry of research on P2P computing, many P2P technical challenges have emerged, one of which is how to efficiently locate desired resources. Advances have been made in this hot research field, where the pioneers are Pastry, CAN, Chord, and Tapestry. By using the functionality of distributed hash table, they have achieved fair effectiveness. However, they have many common limitations, ...

Peer-to-peer systems have emerged as a significant social and technical phenomenon, and they are likely to gain popularity as low-cost individual computing and storage resources become more widely available and network connectivity increases. Unlike traditional distributed systems, P2P networks aggregate large numbers of computers that join and leave the network frequently and that might not ha...

ZHANG, QINGHUA Improving performance of peer-to-peer systems by caching. (Under the direction of Dr. Douglas Reeves). Recently, Peer-to-Peer (P2P) has attracted a great deal of interest in industry and research literature. P2P systems are application layer networks, in which logically distinct computing elements peers, bear comparable roles and responsibilities. P2P enables peers to share resou...

Peer-to-peer (P2P) computing is currently attracting enormous attention. In P2P systems a very large number of autonomous computing nodes (the peers) pool together their resources and rely on each other for data and services. More and more P2P data management systems employ nowadays intensional (i.e., schema) information for integrating and querying peer bases in, so-called, Semantic Overlay Ne...

Abstract – Peer-to-Peer (P2P) networks and their applications gain increasing importance in today’s Internet, as already today the majority of IP traffic is caused by P2P applications. Since the upcoming of Napster a lot of research has been done in this area producing interesting and promising results. Still, growing demands like less data rate consumption, faster and more reliable search resp...