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.
Traditional text retrieval techniques greatly consume system resources. Although some file-sharing software realizes file positioning and high-speed downloads, they have no enough capacity to analysis variety format Chinese documents and to extract keywords. At the same time, during the operation of system, it exist hot issues in network routing. This paper proposes an intelligent distributed text...
Delay and Tolerant Network (DTN) techniques are designed to address data communication challenges in network scenarios, which suffer from intermittent connectivity and frequent partitions. A lot of work about routing has been done, but there is little to provide an efficient information retrieval scheme. A content based information retrieval system for DTNs is studied in this paper. Differing from...
In traditional P2P networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. However, it is a costly operation since it consumes node and link resources excessively, which are often unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not on the path to a...
Similarity searching is particularly important in distributed networks such as P2P systems, which use various routing schemes to submit queries to relevant peers. We investigate content-based information routing and retrieval using similarity search in clustered P2P overlay networks and focus on their maintenance cost models and performance issues. We present a query model for a cluster based P2P...
Mobile nodes in some challenging network scenarios suffer from intermittent connectivity and frequent partitions e.g. battlefield and disaster recovery scenarios. Disruption tolerant network (DTN) technologies are designed to enable nodes in such environments to communicate with one another. In an earlier work, we studied information retrieval schemes for single-attribute queries in DTNs. Our schemes...
Peer-to-Peer (P2P) web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations...
This paper introduces a suitable way for indexing multimedia metadata on a structured peer-to-peer overlay network, with special care to the management of rights metadata expressed by MPEG-21. We have selected a suitable subset of MPEG-21 rights expression language elements to be indexed, in order to map governed contents into a flat space and allow insertion and retrieval of digital contents. Furthermore,...
In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P application till today is file sharing, e.g., Gnutella, Kazza, etc. These systems are usually referred to as unstructured, and search in unstructured P2P networks usually involves flooding or random walking. On the other hand,...
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.