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

Motion-MiX DHT for Wireless Mobile Networks

IEEE TRANSACTIONS ON MOBILE COMPUTING 2016年第12期15卷 3100-3113页

作者： Shin, Seungjae Lee, Uichin Dressler, Falko Yoon, Hyunsoo Korea Adv Inst Sci & Technol Sch Comp Daejeon 305338 South Korea Korea Adv Inst Sci & Technol Dept Knowledge Serv Engn Daejeon 305338 South Korea Univ Paderborn Dept Comp Sci Paderborn Germany

Last encounter routing (LER) is an excellent routing paradigm that exploits distributed mobility diffusion to achieve both moving object tracking and packet networking services in dynamic mobile networks. From our observations, we discover that LER can be easily extended to a mobile DHT protocol that introduces excellent performance to high-speed mobility environments. This is of particular interest when higher level of mobility and membership dynamics go hand in hand. In our simple but powerful DHT paradigm, a data publish/look-up process consists of a sequence of spatial motion tracking of the rendezvous node that is responsible for the data resource. Thus, we name the protocol MX-DHT (Motion-MiX-DHT). As opposed to existing topology based DHT schemes, MX-DHT does not require additional management of logical or overlying look-up topologies, except for the one-hop encounter records of logical metadata carried by mobile nodes. Therefore, in high-speed mobility and dynamic membership environments, MX-DHT achieves a significant reduction in the communication costs of the publish/look-up and join/leave operations as compared to existing mobile DHT schemes. An extensive set of experiments showed that MX-DHT is a cost-effective solution to providing a content centric networking service in different types of networks with dynamic mobility and membership changes.

关键词： Wireless mobile network ad hoc network high-speed mobility dynamic membership change location service last encounter routing distributed hash table content centric network

来源：评论

学校读者我要写书评

暂无评论

A survey of DHT solutions in fixed and mobile networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION NETWORKS AND distributed SYSTEMS 2016年第1期17卷 14-42页

作者： Cherbal, Sarra Boukerram, Abdellah Boubetra, Abdelhak Bordj Bou Arrerij Univ Dept Comp Sci Bordj Bou Arrerij 34000 Algeria Bejaia Univ Dept Comp Sci Bejaia 06000 Algeria

Peer-to-peer (P2P) networks had experienced a great acceptance in recent years in the area of distributed computing, mainly attributed to their inherent management of some interests such as scaling, dynamic nature and heterogeneity that are required by the current network infrastructure. Specifically, structured P2P systems that have shown a great performance since their appearance due to the organisation they offer to the logical topology and objects placement according to specific algorithms. This survey presents a comprehensive and a critical study of research related to enhanced distributed hash tables (DHTs), by presenting a classification according to the used methods and a comparison based on some important points as the routing tables, maintenance cost, lookup process, etc. We discuss the strengths and the weaknesses of existing approaches, and then we highlight the research issues that still to be lacked in order to serve as a guide for interested researchers.

关键词： P2P distributed hash table DHT enhanced DHT chord locality awareness replication extended finger table energy

来源：评论

学校读者我要写书评

暂无评论

Template-Based Migration Between Data Centers Using distributed hash tables 12

Template-Based Migration Between Data Centers Using Distribu...

引用

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Zheng, Mian Hu, Xiaohui Chinese Acad Sci Inst Software Sci & Tech Integrated Info Syst Lab Beijing 100190 Peoples R China

ISBN: (纸本)9781467376822

Template-based migration between data centers (TM) refers to the inter-data center virtual machines (VMs) live migration with the template-based memory deduplication method. TM achieves significant migration performance improvement but incurs large memory overhead. In this paper, a new method of template-based migration between data centers using distributed hash tables (TMDHT) is presented. TMDHT slices the template pages into some pieces which are stored in the destination data center distributedly. The requests for template pages follow our routing rules. This method greatly improves the system's scalability and flexibility. Evaluation shows that the TMDHT only causes a slight performance loss compared with TM. And it still reduces the migration time by 21.1% and the network traffic by 26.9% on average compared to the default method of QEMU/KVM.

关键词： live migration data center deduplication template page distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Bringing secure Bitcoin transactions to your smartphone 15

Bringing secure Bitcoin transactions to your smartphone

引用

15th Workshop on Adaptive and Reflective Middleware (ARM)

作者： Frey, Davide Makkes, Marc X. Roman, Pierre-Louis Taiani, Francois Voulgaris, Spyros Inria Rennes Rennes France Vrije Univ Amsterdam Amsterdam Netherlands Univ Rennes 1 IRISA ESIR Rennes France

ISBN: (纸本)9781450346627

To preserve the Bitcoin ledger's integrity, a node that joins the system must download a full copy of the entire Bitcoin blockchain if it wants to verify newly created blocks. At the time of writing, the blockchain weights 79 GiB and takes hours of processing on high-end machines. Owners of low-resource devices (known as thin nodes), such as smartphones, avoid that cost by either opting for minimum verification or by depending on full nodes, which weakens their security model. In this work, we propose to harden the security model of thin nodes by enabling them to verify blocks in an adaptive manner, with regards to the level of targeted confidence, with low storage requirements and a short bootstrap time. Our approach exploits sharding within adistributed hash table (DHT) to distribute the storage load, and a few additional hashes to prevent attacks on this new system.

关键词： Blockchain Bitcoin Sharding distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Latency and Routing Efficiency Based Metric for Performance Comparison of DHT Overlay Networks 30

Latency and Routing Efficiency Based Metric for Performance ...

引用

30th IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Varyani, Nitin Nikhil, S. Shekhawat, Virendra S. BITS Pilani Comp Sci & Informat Syst Pilani Rajasthan India

ISBN: (纸本)9781509024612

The general method available for comparison between the distributed hash table (DHT) based structured overlay networks are average latency per successful lookup and percentage of successful lookups. For a DHT based lookup service with lookup retries for failed lookups, both average latency per successful lookup as well as percentage of successful lookups are key to evaluate the performance. Although, average latency per successful lookup may be less for a DHT overlay protocol, failure of lookups at high churn rates may degrade the protocol's performance if its routing efficiency is less. On the other hand, just routing efficiency is not sufficient to measure the performance of a DHT since an overlay network having higher routing efficiency may not have a good performance due to high average latency per successful lookup. We have developed a metric for DHT comparison which incorporates both average latency per successful lookup and routing efficiency in scenarios where applications do lookup retries. We have also modeled three different timeout mechanisms while developing the performance metric. The paper also incorporates a model where the probability of failure of a lookup is increasing at every retry of lookups.

关键词： Routing efficiency Latency distributed hash table Overlay Networks Performance metric

来源：评论

学校读者我要写书评

暂无评论

Surveying Indexing Methods for the Internet of Things 2nd

Surveying Indexing Methods for the Internet of Things

引用

2nd International Summit on Internet of Things - IoT Infrastructures( IoT 360)

作者： Kardeby, Victor Jennehag, Ulf Gidlund, Mikael Mid Sweden Univ Dept Informat & Commun Syst S-85170 Sundsvall Sweden

ISBN: (纸本)9783319470757;9783319470740

The Internet of Things is expected to expand several magnitudes in the coming decade surpassing over 50 billion devices. In the Internet of Things there is a need to support complex queries on the massive amount of information that will be made available. The scalability of the indexes used to support the queries is therefore critical. This paper therefore investigate what type of index that could scale to the size required by the Internet of Things. We find that range query is an approach that support continuously changing information and fast updates with the lowest increase in signaling per participating device. We find that a Chord- based distributed hash table hosting a NUBL range query indexing scheme will scale to the required size while supporting multidimensional range queries.

关键词： IoT Internet of things Survey Indexing method distributed systems distributed hash table

来源：评论

学校读者我要写书评

暂无评论

An Innovative Performance Analysis of Multi Attribute DHT Queries in Resource Discovery by H-LORM Techniques 1

An Innovative Performance Analysis of Multi Attribute DHT Qu...

引用

1st International Conference on Emerging Trends in Engineering, Technology and Science (ICETETS)

作者： Sathyalakshmi, K. Fernandez, M. George Kings Coll Engn Dept Informat Technol Pudukkottai Tamil Nadu India St Josephs Coll Engn & Technol Dept Comp Sci Engn Thanjavur Tamil Nadu India

ISBN: (纸本)9781467367257

Resource discovery is critical to the usability and accessibility of grid computing systems. distributed hash table (DHT) has been applied to grid systems as a distributed mechanism for providing scalable range-query and multi-attribute resource discovery. Multi-DHT-based approaches depend on multiple DHT networks with each network responsible for a single attribute. Single-DHT-based approaches keep the resource information of all attributes in a single node. Both classes of approaches lead to high overhead. In this paper, we propose a Heuristic Low-Overhead Range-query Multi-attribute (H-LORM) DHT-based resource discovery approach. Unlike other DHT-based approaches, H-LORM relies on a single compound graph-based DHT network and distributes resource information among nodes in balance by taking advantage of the compound graph structure. Moreover, it has high capability to handle the large-scale and dynamic characteristics of resources in grids. Experimental results demonstrate the efficiency of H-LORM in comparison with other resource discovery approaches. LORM dramatically reduces maintenance and resource discovery overhead. In addition, it yields significant improvements in resource location efficiency. We also analyze the performance of the LORM approach rigorously by comparing it with other multi-DHT-based and single-DHT-based approaches with respect to their overhead and efficiency. The analytical results are consistent with experimental results, and prove the superiority of the H-LORM approach in theory.

关键词： Multi-attribute range query distributed hash table peer-to-peer resource discovery grids

来源：评论

学校读者我要写书评

暂无评论

BPPGD: Budgeted Parallel Primal grAdient desCent Kernel SVM on Spark 1

BPPGD: Budgeted Parallel Primal grAdient desCent Kernel SVM ...

引用

1st IEEE International Conference on Data Science in Cyberspace (DSC)

作者： Sai, Jinchen Wang, Bai Wu, Bin Beijing Univ Posts & Telecommun Beijing Key Lab Intelligent Telecommun Software & Beijing Peoples R China

ISBN: (纸本)9781509011926

Stochastic Gradient Descent (SGD) is the best known method to optimize the primal objective for linear support vector machines (SVM) to dispose large data. However, when equipped with kernel functions, SGD performance is vulnerable that causes unbounded linear growth in model size and update time with data size. This paper describes a budgeted parallel pack gradient descent algorithm (BPPGD) that can improve SVM optimize problem with Gaussian Radial Basis Function (RBF) to large-scale data and run efficiently on Apache Spark with high degree of parallelization. Apache Spark is a fast and general engine for large-scale data processing which has advantage on big data parallel computing and dealing with iterative algorithms. BPPGD algorithm has constant time complexity per update. It uses a new distributed hash table-IndexedRDD to increase the parallel degree, packing strategy to improve SGD performance with reducing the number of communication and removal budget maintenance method to keep the number of support vectors (SVs). The experiment results show that BPPGD achieves higher accuracy than P-packSVM (Zhu et al., 2009) and BSGD (Zhuang et al., 2012) algorithms on Spark environment, and it takes shorter time.

关键词： stochastic gradient descent support vector machines Spark kernel method large-scale learning packing strategy budget maintenance distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Building Robust distributed Infrastructure Networks

Building Robust Distributed Infrastructure Networks

引用

作者： Brendan Benshoof Georgia State University

学位级别：博士

Many competing designs for distributed hash tables exist exploring multiple models of addressing, routing and network maintenance. Designing a general theoretical model and implementation of a distributed hash table allows exploration of the possible properties of distributed hash tables. We will propose a generalized model of DHT behavior, centered on utilizing Delaunay triangulation in a given metric space to maintain the networks topology. We will show that utilizing this model we can produce network topologies that approximate existing DHT methods and provide a starting point for further exploration. We will use our generalized model of DHT construction to design and implement more efficient distributed hash table protocols, and discuss the qualities of potential successors to existing DHT technologies.

关键词： P2P distributed hash table Decentralized Networking

来源：评论

学校读者我要写书评

暂无评论

LDEPTH: A Low Diameter Hierarchical P2P Network Architecture 14

LDEPTH: A Low Diameter Hierarchical P2P Network Architecture

引用

14th IEEE International Conference on Industrial Informatics (INDIN)

作者： Rahimi, Nick Sinha, Koushik Gupta, Bidyut Rahimi, Shahram Debnath, Narayan C. Southern Illinois Univ Dept Comp Sci Carbondale IL 62901 USA Winona State Univ Dept Comp Sci Winona MN USA

ISBN: (纸本)9781509028702

In this paper, we present a new approach to designing a scalable, hierarchical overlay P2P system which provides highly efficient data lookup operations as well fault tolerance. Instead of using a distributed hash table (DHT) based approach, we propose the use of Linear Diophantine Equation (LDE) as the mathematical basis to realize a hierarchical P2P architecture. LDE provides a significantly lighter weight mechanism to create and maintain the overlaid P2P structure as compared to DHT based schemes. To the best of our knowledge, ours is the first work that proposes the use of LDEs in designing P2P topologies. In our proposed hierarchical P2P architecture, the number of hops required to search for a resource is independent of the number of nodes/peers in the network n and is instead bounded by (1 + r/2), r being the number of distinct resource types. For most practical purposes, r is significantly smaller than n and hence our proposed architecture provides a highly efficient resource look-up procedure. We have also presented algorithms for handling of new resources and peers joining and leaving the P2P network and fault tolerance in the event of peers crashing or leaving.

关键词： Peer-to-peer network P2P hierarchical P2P Linear diophantine equation distributed hash table network diameter

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：