检索结果-内蒙古大学图书馆

12th IEEE International Conference on Technologies for Homeland Security (HST)

作者： Harrison, Keith White, Gregory Univ Texas San Antonio Dept Comp Sci San Antonio TX 78249 USA

ISBN: (纸本)9781467327091;9781467327084

Communities, and the critical infrastructure that they rely upon, are becoming ever increasingly integrated into cyberspace. At the same time, communities are experiencing increasing activity and sophistication from a variety of threat agents. The effect of cyber attacks on communities has been observed, and the frequency and devastation of these attacks can only increase in the foreseeable future. Early detection of these attacks is critical for a fast and effective response. We propose detecting community cyber incidents by comparing indicators from community members across space and time. Performing spatiotemporal differentiation on these indicators requires that community members, such as private and governmental organizations, share information about these indicators. However, community members are, for good reasons, reluctant to share sensitive security related information. Additionally, sharing large amounts of information with a trusted, centralized location introduces scalability and reliability problems. In this paper we define the information sharing requirements necessary for fast, effective community cyber incident detection and response, while addressing both privacy and scalability concerns. Furthermore, we introduce a framework to meet these requirements, and analyze a proof of concept implementation.

关键词： community security network security intrusion detection collaborative intrusion detection distributed hash table information sharing privacy anonymity

来源：评论

学校读者我要写书评

暂无评论

A distributed full-text top-k document dissemination system in distributed hash tables

引用

WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS 2011年第5-6期14卷 545-572页

作者： Rao, Weixiong Chen, Lei Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Hong Kong Hong Kong Peoples R China HeNan Univ Sch Comp & Informat Engn Kaifeng Peoples R China

Recent years witnessed the explosive growth of 'live' web content in the World Wide Web like Weblogs, RSS feeds, and real-time news, etc. The popular usage of RSS feeds/readers enables end users to subscribe for favorite contents via input RSS URLs. However, the RSS feeds/readers architecture suffers from (i) the high bandwidth consumption issue, and (ii) limited filtering semantics. In this paper, we proposed a stateful full text dissemination scheme over structured P2Ps to address both issues. Specifically, for the semantic side, end users are allowed to subscribe for favorite contents via input keywords;for the network bandwidth side, the cooperative content polling, filtering and disseminating via DHT-based P2P overlay networks save the network bandwidth consumption. Our contributions include the novel techniques to (i) reduce the unit-publishing cost by pruning irreverent documents during the forwarding path towards destinations, and (ii) reduce the publication amount by selecting a very small number of meaningful terms. Based on real data sets, our experimental results show that the proposed scheme can significantly reduce the publishing cost with low maintenance overhead and a high document quality.

关键词： content dissemination distributed hash table p2p networks RSS

来源：评论

学校读者我要写书评

暂无评论

SDHT： Efficient One-Hop DHT Lookup Framework for P2P Live Streaming

引用

China Communications 2012年第8期9卷 88-104页

作者： Chen Zhuo Feng Gang Zhou Yang Lu Yi National Key Laboratory of Science and Technology on Communications University of Electronic Science and Technology of China Chengdu 611731 P. R. China College of Computing Georgia Institute of Technology Atlanta GA 30332 USA College of Computer Science and Engineering Chongqing University of Technology Chongqing 400054 P. R. China

Video data location plays a key role for Peer-to-Peer （P2P） live streaming applications. In this paper, we propose a new one-hop distributed hash table （DHT） lookup frarrework called Strearre ing-DHT （SDHT） to provide efficient video data location service. By adopting an enhanced events dissemination mechanism-EDRA＋, the accuracy of routing table at peers can be guaranteed. More importantly, in order to enhance the perforlmnce of video data lookup operation without incurring extra overhead, we design a so-called distributed Index Mapping and Management Mechanism （DIMM） for SDHT. Both analytical modeling and intensive simulation experiments are conducted to demonstrate the effectiveness of SDHT framework. Numerical results show that almost 90% requested video data can be retrieved within one second in SDHT based systems, and SDHT needs only 26% average bandwidth consumption when compared with similar one-hop DHT solutions such as D1HT. This indicates that SDHT framework is an appropriate data lookup solution for time-sensitive network applications such as P2P live streaming.

关键词： peer-to-peer distributed hash table streaming application live streaming EDRA

来源：评论

学校读者我要写书评

暂无评论

MHT: A mobilitity-aware distributed hash table

引用

IT-INFORMATION TECHNOLOGY 2007年第5期49卷 298-303页

作者： Landsiedel, Olaf Heer, Tobias Wehrle, Klaus Rheinisch Westfal Tech Hoch Achen Informat Verteilte Syst 4 D-52062 Aachen Germany

Mobile ad-hoc networks and distributed hash tables (DHT) share key characteristics in terms of self organization, decentralization, redundancy requirements, and limited infrastructure. However, node mobility and the continually changing physical topology pose a special challenge to scalability and the design of a DHT for mobile ad-hoc networks. In this paper, we show that with some local knowledge we can build a scalable and mobile structured peer-to-peer network, called Mobile hash table (MHT). Furthermore, we discuss practical challenges such as Churn, load balancing and security of MHT. A special focus is put on the differences and new challenges that the use of a DHT in a mobile environment poses.

关键词： C.2.4 [Computer Systems Organization: Computer-Communication Networks: distributed Systems]distributed applications peer-to-peer distributed hash table mobility ad-hoc network DHT

来源：评论

学校读者我要写书评

暂无评论

distributed hash table based design of Soft System Buses 07

Distributed hash table based design of Soft System Buses

引用

Proceedings of the 2nd international conference on Scalable information systems

作者： Mohammad Reza Selim Takumi Endo Yuichi Goto Jingde Cheng Saitama University Saitama Japan

ISBN: (纸本)9781595937575

Large scale computing systems which can run for unlimited time and can evolve over time have a growing demand in this modern information society. Soft System Buses (SSBs) were proposed to provide middleware platform support to such computing systems. This paper proposes a design of SSBs based on Chord -- a distributed hash table protocol for large scale peer to peer systems. Our design fulfills the requirements of SSBs like scalability, automatic recovery from failures, data preservation and incremental runtime upgradeability and maintainability. An assessment of our design from the view point of the requirements of SSBs is also presented.

关键词： chord protocol soft system bus middleware distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Hybrid Computing-Where HPC meets grid and Cloud Computing

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2011年第5期27卷 440-453页

作者： Mateescu, Gabriel Gentzsch, Wolfgang Ribbens, Calvin J. Natl Ctr Supercomp Applicat Urbana IL 61801 USA Open Grid Forum Joliet IL 60434 USA Virginia Tech Dept Comp Sci Blacksburg VA 24061 USA

We introduce a hybrid High Performance Computing (HPC) infrastructure architecture that provides predictable execution of scientific applications, and scales from a single resource to multiple resources, with different ownership, policy, and geographic locations. We identify three paradigms in the evolution of HPC and high-throughput computing: owner-centric HPC (traditional), Grid computing, and Cloud computing. After analyzing the synergies among HPC, Grid and Cloud computing, we argue for an architecture that combines the benefits of these technologies. We call the building block of this architecture, Elastic Cluster. We describe the concept of Elastic Cluster and show how it can be used to achieve effective and predictable execution of HPC workloads. Then we discuss implementation aspects, and propose a new distributed information system design that combines features of distributed hash tables and relational databases. (C) 2010 Elsevier B.V. All rights reserved.

关键词： distributed systems Scheduling Cloud computing HPC Statistical reservation Cloud bursting Virtualization distributed hash table

来源：评论

学校读者我要写书评

暂无评论

A decentralized search engine for dynamic Web communities

引用

KNOWLEDGE AND INFORMATION SYSTEMS 2011年第1期26卷 105-125页

作者： Wang, Daze Tse, Quincy Chi Kwan Zhou, Ying Univ Sydney Sch Informat Technol Sydney NSW 2006 Australia

Currently, most Web search engines perform search on corpus comprising nearly entire content of the Web. The same centralized search service can be performed on a single site as well. Nonetheless, there is little research on community-wide search. This paper presents a peer-to-peer search engine ComSearch. ComSearch is designed to provide small- and middle-scale online communities-the ability to perform text search within the community. Communities are formed in a self-organizing style. P2P IR system may suffer unnecessary internal traffic in answering a multi-term query. In this paper, we propose several techniques to optimize the multi-term query process. The simulation results show that our proposed algorithms have good scalability. Compared with baseline approach, our improved algorithm can reduce the communication cost by about two orders of magnitude in the best case. We also deploy the system in a small-scale network and conduct a series of experiments to estimate the actual query response time as well as to investigate the data movement effect caused by node joining. Experimental results show that multiple data movements are quite common during network expansion. However, the percentage of multiple data movements decreases when a network is getting stable after the initial frequent joining activities. This provides possibilities for improvement on P2P data movement management.

关键词： distributed hash table Bloom filter Information retrieval Community level search Web feed

来源：评论

学校读者我要写书评

暂无评论

EXPLOITING ATTRIBUTE POPULARITY DISTRIBUTION SKEW TO ENHANCE THE PERFORMANCE OF PEER TO PEER PUBLISH/SUBSCRIBE SYSTEMS

引用

INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL 2011年第7A期7卷 4047-4066页

作者： Chen, Chyouhwa Tsai, Chia-Liang Horng, Shi-Jinn Natl Taiwan Univ Sci & Technol Dept Comp Sci & Informat Engn Taipei 106 Taiwan

An inherent phenomenon in real-world publish/subscribe services is the skew in attribute popularity, where some attributes are much more popular than others. None of the many publish/subscribe systems in the literature proposed effective means to address this phenomenon, which results in workload imbalance among peers, excessive total computation cost, inefficient event delivery or all of the above. To combat these problems, we propose two fundamental architectural designs for these systems. First, we propose to exploit the attribute popularity distribution skew in the subscription installation process. A number of novel subscription installation strategies are presented in this paper that exploits the popularity of attributes to spread the load across a multitude of peers so that the peer workload both in subscription storage and in event matching computation is much more balanced. However, wide spreading of subscription storage and event computation workload usually result in inefficient event delivery. As our second contribution, we propose an architecture design where the subscription storage and event delivery components are decoupled. However, the two components are also seamlessly integrated so that event delivery remains extremely efficient. Using an extensive set of experiments, our proposed approach is shown to require only a modest level of subscription replication, require significantly less total computation cost, achieve better load balance among peers in subscription storage and event matching, and deliver events in an extremely efficient manner. In addition, our approach is shown to be scalable in the number of events, subscriptions, schema attributes and network peers.

关键词： Publish/subscribe services Subscription Event Structured P2P networks distributed hash table Rendezvous-based mapping function

来源：评论

学校读者我要写书评

暂无评论

A Memory Efficient Result Cache Scheme for P2P DHT Based on Bloom Filters

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2011年第8期E94D卷 1602-1609页

作者： Ariyoshi, Takahiro Fujita, Satoshi Hiroshima Univ Grad Sch Engn Dept Informat Engn Higashihiroshima 7398527 Japan

In this paper, we study the problem of efficient processing of conjunctive queries in Peer-to-Peer systems based on distributed hash tables (P2P DHT, for short). The basic idea of our approach is to cache the search result for the queries submitted in the past, and to use them to improve the performance of succeeding query processing. More concretely, we propose to adopt Bloom filters as a concrete implementation of such a result cache rather than a list of items used in many conventional schemes. By taking such an approach, the cache size for each conjunctive query becomes as small as the size of each file index. The performance of the proposed scheme is evaluated by simulation. The result of simulation indicates that the proposed scheme is particularly effective when the size of available memory in each peer is bounded by a small value, and when the number of peers is 100, it reduces the amount of data transmissions of previous schemes by 75%.

关键词： peer-to-peer distributed hash table conjunctive query bloom filter

来源：评论

学校读者我要写书评

暂无评论

Cooperative caching versus proactive replication for location dependent request patterns

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2011年第2期34卷 562-574页

作者： Sluijs, Niels Iterbeke, Frederic Wauters, Tim De Turck, Filip Dhoedt, Bart Demeester, Piet Univ Ghent Dept Informat Technol INTEC IBBT B-9050 Ghent Belgium

Today's trend to create and share personal content, such as digital photos and digital movies, results in an explosive growth of a user's personal content archive. Managing such an often distributed collection becomes a complex and time consuming task, indicating the need for a personal content management system that provides storage space transparently, is quality-aware, and is available at any time and at any place to end-users. A key feature of such a Personal Content Storage Service (PCSS) is the ability to search worldwide through the dataset of personal files. Due to the extremely large size of the dataset of personal content, a centralized solution is no longer feasible and an interesting approach for an efficient distributed PCSS implementation is to use a structured Peer-to-Peer network, and more in particular a distributed hash table (DHT), providing a logarithmic lookup performance in the number of network nodes. In order to further increase the lookup performance, a caching layer is typically used between the application layer and the DHT. These caching strategies are location neutral, and usually do not exploit location dependence of request patterns. In this article we present our cooperative caching framework and introduce the cooperative Request Times Distance (RID) caching algorithm. Since, lookup patterns in a PCSS typically have a power law popularity distribution and exhibit location dependent requests patterns, the proposed caching solution takes into account popularity and distance metrics. To enable cooperation between caches we introduce an update protocol, which only occasionally introduces one hop delay for a lookup operation. We present a systematic analysis of the caching framework and compare the cooperative caching algorithm to the state-of-the-art Beehive replication strategy. The cooperative RID caching solution shows that when request patterns are more localized, the increase in lookup performance through cooperation is significantly

关键词： Caching strategy distributed hash table Performance analysis Personal content Scalability

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：