10,456 Hits in 5.7 sec

Text-Based P2P Content Search Using a Hierarchical Architecture [chapter]

Junjie Jiang, Weinong Wang
2004 Lecture Notes in Computer Science  
In this paper, we propose a text-based peer-to-peer content search solution, which uses a hierarchical architecture.  ...  Structured peer-to-peer networks achieve good scalability and high reliability, and yet they can only support a single-key based lookup instead of content search by means of DHTs (Distributed Hash Tables  ...  In this paper, we propose a text-based content search solution for large scale structured peer-to-peer networks. In our solution, a hierarchical architecture is employed.  ... 
doi:10.1007/978-3-540-30544-6_46 fatcat:4az373pdsbcifbcoi4ozmforxq

Efficient Semantic-Based Content Search in P2P Network

Heng Tao Shen, Yanfeng Shu, Bei Yu
2004 IEEE Transactions on Knowledge and Data Engineering  
First, we propose a general and extensible framework for searching similar documents in P2P network. The framework is based on the novel concept of Hierarchical Summary Structure.  ...  Most existing Peer-to-Peer (P2P) systems support only title-based searches and are limited in functionality when compared to today's search engines.  ...  In each peer, there's a local index for the retrieval of locally stored information, built from summaries of all information units within the peer.  ... 
doi:10.1109/tkde.2004.1318564 fatcat:y6ldhgvplvdnfpcj6oqlu4ycqa

Workshop on large-scale distributed systems for information retrieval

Sebastian Michel, Gleb Skobeltsyn, Wai Gen Yee
2009 SIGIR Forum  
The 2008 edition of the Workshop on Large-Scale Distributed Systems for Information Retrieval (LSDS-IR'08) provided a forum for researchers to discuss these problems and to define new directions for the  ...  With the computational power of thousands or millions of computers in clusters or peer-to-peer systems, the challenges that arise are manifold, ranging from efficient resource discovery to issues in load  ...  Hans Witschel presented a study on ranking information resources in peer-to-peer text retrieval [13] .  ... 
doi:10.1145/1670598.1670606 fatcat:vwr3unmtgvbp3amzzbslmb5aq4

Using Information Retrieval Techniques to Route Queries in an InfoBeacons Network [chapter]

Brian F. Cooper
2005 Lecture Notes in Computer Science  
We present the InfoBeacons system, in which a peer-to-peer network of beacons cooperates to route queries to the best information sources.  ...  Results of experiments using a beacon network to search 1,000 information sources demonstrates how our techniques can be used to efficiently route queries; for example, our techniques require contacting  ...  Content searching using information retrieval in peer-to-peer networks has been studied before [27, 26, 30] .  ... 
doi:10.1007/978-3-540-31838-5_4 fatcat:sgjbvokuzbeuvenakrewkjhzr4

Routing Queries through a Peer-to-Peer InfoBeacons Network Using Information Retrieval Techniques

Sangeetha Seshadri, Brian F. Cooper
2007 IEEE Transactions on Parallel and Distributed Systems  
In the InfoBeacons system, a peer-to-peer network of beacons cooperates to route queries to the best information sources.  ...  Results of experiments using a beacon network to search 2,500 information sources demonstrates the effectiveness of our system; for example, our techniques require contacting up to 71 percent fewer sources  ...  Caching of data to improve performance has been well studied in many contexts, including the web [4] , database systems [14] , information retrieval [25] and peer-to-peer search [7] .  ... 
doi:10.1109/tpds.2007.1107 fatcat:f7gsemgbfbf7dokkc5vtmesoua

PROD: Relayed file retrieving in overlay networks

Zhiyong Xu, Dan Stefanescu, Honggang Zhang, Laxmi Bhuyan, Jizhong Han
2008 Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)  
In the second step, the client establishes direct connection(s) with the peer(s) who store a copy of that file to start the retrieving process.  ...  In this paper, we propose a novel and efficient algorithm -PROD to improve the file retrieving performance in DHT based overlay networks.  ...  We gratefully acknowledges the support of K. C. Wong Education Foundation, Hong Kong. We would also like to thank the anonymous reviewers for their valuable comments.  ... 
doi:10.1109/ipdps.2008.4536289 dblp:conf/ipps/XuSZBH08 fatcat:eavajqghsrh5vjguxqrljgyfdy

Precomputation schemes for QoS routing

A. Orda, A. Sprintson
2003 IEEE/ACM Transactions on Networking  
First, we show that, by exploiting the typical hierarchical structure of large-scale networks, one can achieve a substantial improvement in terms of computational complexity.  ...  Precomputation is highly desirable for QoS routing schemes due to the high computation complexity of selecting QoS paths on the one hand, and the need to promptly provide a satisfactory path upon a request  ...  Topology aggregation is useful for ATM [25] and IP networks [20] . A key issue in topology aggregation is how to provide the routing information of a domain to the outside world.  ... 
doi:10.1109/tnet.2003.815299 fatcat:vunnxdxd75hj5gj3tnn5pathsy

Distributed Document Sharing with Text Classification over Content-Addressable Network [chapter]

Tayfun Elmas, Oznur Ozkasap
2004 Lecture Notes in Computer Science  
Content-addressable network is a scalable and robust distributed hash table providing distributed applications to store and retrieve information in an efficient manner.  ...  We describe our system prototype in which a hierarchical text classification approach is proposed as an alternative hash function to decompose dimensionality into lower dimensional realities.  ...  Peer-to-peer (P2P) systems have become a popular alternative to build large-scale platforms for distributed information retrieval applications, as they provide a scalable, fault-tolerant and self-organizing  ... 
doi:10.1007/978-3-540-30483-8_9 fatcat:dvneqohssngqlnulhzljkaim4i

Emerging semantic communities in peer web search

R. Akavipat, L.-S. Wu, F. Menczer, A.G. Maguitman
2006 Proceedings of the international workshop on Information retrieval in peer-to-peer networks - P2PIR '06  
Many studies show that peer search systems perform better when a query is sent to a group of peers semantically similar to the query.  ...  To achieve good results for a text query, a peer search system must try to predict which peers are best suited for the query.  ...  Work supported in part by NSF Career Grant IIS-0348940 to FM.  ... 
doi:10.1145/1183579.1183581 fatcat:lcrtvp776vdelpzisbkt2gydji

A Literature Survey of Cooperative Caching in Content Distribution Networks [article]

Jing Zhang
2012 arXiv   pre-print
To minimize the retrieving delay experienced by a user with a request for a web object, caching strategies are often applied - contents are replicated at edges of the network which is closer to the user  ...  A recent research paper [15] in the field of large-scale caching for CDN was chosen to be the anchor paper which serves as a guide to the topic.  ...  Bjorkqvist et al. proposed two Peer Aware Content Caching(PACC) for CDN networks in [19] .  ... 
arXiv:1210.0071v1 fatcat:v2hbwhrt3bhc5ec53kag4hcy5y


2015 International journal of computer and communication technology  
Peer-to-peer overlay networks are a good solution for distributed computing than client-server model since nodes in P2P networks act both as client and server.  ...  This paper proposes an efficient algorithm for clustering nodes, classifying and replication of content on demand basis for content distribution in p2p overlay networks.  ...  For attaining the above it is needed to develop a query search retrieval algorithm which is adaptive to the peer-to-peer overlay networks.  ... 
doi:10.47893/ijcct.2015.1316 fatcat:mgcms7gia5c6xeizfj7v4ecvwm

Efficient Cache Management Model for Cooperative Reasoning in Wide Area Surveillance

Soomi Yang
2016 Journal of Security Engineering  
For such a collaborative network, ICN(Information Centric Network) is adopted and an effective cache management scheme that can help the efficient ontology integration.  ...  Our scheme shows the efficiency of model resulted in better and efficient context inference.  ...  Our scheme uses ICN in-network caching and conformity to update and share data in a cooperative way. Simulation studies are conducted to evaluate the effectiveness of our flexible cache scheme.  ... 
doi:10.14257/jse.2016.08.05 fatcat:gsqhlbcjjfejdop4v4l24dqda4

Profile Data Deploying Strategy for Efficient Cooperative Reasoning on Ontology

Soomi Yang
2011 International Journal of Distributed and Parallel systems  
Profile data contained in them if properly structured and is integrated, can induce a useful context information.  ...  This work builds a hierarchical profile data deploy structure and import related multimedia data to annotate rich data arriving from multiple sensor streams, in this case smart cameras.  ...  ACKNOWLEDGEMENTS This work is supported by the GRRC program of Gyeonggi province. [GGA0801-45700, Center for U-city Security and Surveillance Technology]  ... 
doi:10.5121/ijdps.2011.2602 fatcat:hlkxqnfvbfdirksqo44sopafja

Full-text federated search in peer-to-peer networks

Jie Lu
2007 SIGIR Forum  
We show in detail that the network search model is not a simple adaptation of existing solutions to full-text ranked retrieval.  ...  Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalable model for providing federated  ...  The objective of this dissertation is to study federated search in P2P networks from an information retrieval perspective, and to develop new techniques to complement existing approaches in P2P networks  ... 
doi:10.1145/1273221.1273233 fatcat:lf2ble62arcbvpogfoefryrhn4


Hanafy M. Ali, Mohamed Z. Abdelmegid, Mohamed M. Ali
2009 JES. Journal of Engineering Sciences  
This paper provides a single-node peer-to-peer (P2P) network architecture that integrates both active routing and P2P networking. The integrated architecture, as such is not full secure.  ...  Therefore, two security layers are added, one to compute the node reputation and the second to provide an authentication scheme. Such scheme may be either central or hierarchical.  ...  Unicast function is used to send data from peer 0 to peer 5 in a network shown in figure 5 .a.  ... 
doi:10.21608/jesaun.2009.128169 fatcat:k6vfe3hdofdbfc33wtfnfgtqoq
« Previous Showing results 1 — 15 out of 10,456 results