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

A machine-checked correctness proof for Pastry

SCIENCE OF COMPUTER PROGRAMMING 2018年 158卷 64-80页

作者： Azmy, Noran Merz, Stephan Weidenbach, Christoph Max Planck Inst Informat Saarbrucken Germany Univ Lorraine LORIA Inria CNRS Nancy France

Protocols implemented on overlay networks in a peer-to-peer (P2P) setting promise flexibility, performance, and scalability due to the possibility for nodes to join and leave the network while the protocol is running. These protocols must ensure that all nodes maintain a consistent view of the network, in the absence of centralized control, so that requests can be routed to the intended destination. This aspect represents an interesting target for formal verification. In previous work, Lu studied the Pastry algorithm for implementing a distributed hash table (DHT) over a P2P network and identified problems in published versions of the algorithm. He suggested a variant of the algorithm, together with a machine-checked proof in the TLA(+) Proof System (TIAPS), assuming the absence of node failures. We identify and correct problems in Lu's proof that are due to unchecked assumptions concerning modulus arithmetic and underlying data structures. We introduce higher-level abstractions into the specifications and proofs that are intended for improving the degree of automation achieved by the proof backends. These abstractions are instrumental for presenting the first complete formal proof. Finally, we formally prove that an even simpler version of Lu's algorithm, in which the final phase of the join protocol is omitted, is still correct, again assuming that nodes do not fail. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Formal verification Machine-checked proof distributed algorithm Peer-to-peer protocol distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Rapid Relevance Feedback Strategy Based on distributed CBIR System

引用

INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS 2018年第2期14卷 1-26页

作者： Liao, Jianxin Li, Baoran Wang, Jingyu Qi, Qi Wang, Jing Li, Tonghong Beijing Univ Posts & Telecommun Beijing Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Tech Univ Madrid Dept Comp Sci Madrid Spain

This article describes the capability of online data storage which has been enhanced by the emergence of cloud datacenter development. distributed hash table (DHT) based image retrieval system using locality sensitive hash (LSH) has provided an efficient way to set up distributed Content Based Image Retrieval (CBIR) frameworks. However, with the fixed LSH function adopted, LSH and other codebook-based distributed retrieval systems are facing the problem of flexibility, and also are difficult to satisfy the user's demand. In this article, LRFMIR is proposed to introduce semantic search into DHT based CBIR system. LRFMIR is established on a DHT based network, where a flexible result truncating strategy is employed to fuse provided results by using multiple features measurements. Experiments show that LRFMIR provides a higher accuracy and recall rate than single feature employed retrieval systems, and possesses good load balancing and query efficiency performance.

关键词： Content Based Image Retrieval distributed hash table Feature Reweighting Locality Sensitive hash Relevance Feedback

来源：评论

学校读者我要写书评

暂无评论

SkipVis: A Skip Graph Visualizer 26

<i>SkipVis</i>: A Skip Graph Visualizer

引用

26th IEEE Signal Processing and Communications Applications Conference (SIU)

作者： Hassanzadeh-Nazarabadi, Yahya Ekmekci, Canberk Menceloglu, Esin Ozkasap, Oznur Koc Univ Dept Comp Engn Istanbul Turkey Univ Minnesota Dept Comp Engn Minneapolis MN 55455 USA

ISBN: (纸本)9781538615010

Skip Graph is a network overlay structure utilized in distributed data storage services as well as systems such as P2P cloud storage, search engines, Internet-of-Things, and mobile sensor networks. We propose SkipVis: a Skip Graph overlay visualizer that facilitates the flaw detection of Skip Graph-based algorithms in their design phase and also the implementation correctness verifiability. To the best of our knowledge, there exists no overlay visualizer for Skip Graph structure. Therefore, SkipVis is designed and developed as a scalable open source Skip Graph overlay visualizer that provides an interactive graphical user interface. In this paper, we describe SkipVis design principles, configuration, architecture and demonstration scenario.

关键词： distributed hash table DHT Skip Graph P2P systems visualization

来源：评论

学校读者我要写书评

暂无评论

Decentralized Message Broker Federation Architecture with Multiple DHT Rings for High Survivability 18th

Decentralized Message Broker Federation Architecture with Mu...

引用

18th International Conference on Computational Science and Its Applications (ICCSA)

作者： Kim, Minsub Bae, Minho Yeo, Sangho Park, Gyudong Oh, Sangyoon Ajou Univ Dept Comp Engn Suwon Gyeonggi Do South Korea Agcy Def Dev Seoul South Korea

ISBN: (纸本)9783319951744;9783319951737

A message broker is an essential component of messaging services that connect information providers and consumers, message service clients, to enable the integrated message network. To support large scale message clients with the contracted service level, multiple brokers have to collaborate and form a federated broker cluster in many cases. For example, Kafka is one of the most popular messaging systems that allows multiple brokers co-working together. ZooKeeper, the distributed cluster coordinator, manages cluster nodes and stores metadata of messages for Kafka. Even though ZooKeeper does the coordination job well in a simple way, its half-centralized coordinating methods make the overall system less capable in survivability. In some domains such as military warfare and embedded sensor networks, we may lose the primary coordinator or lose more than a half of the coordinator machines. In these cases, we cannot support the minimum survivability to maintain the message network. To address this limited survivability problem, we propose a decentralized message broker federation architecture with distributed hash table. In our proposed architecture design, the decentralized coordinator supports the DHT exchanges between brokers to manage metadata of distributed message partitions. We built a prototype of a message broker federation based on our proposed decentralized metadata coordinator design to show the feasibility in terms of practical application.

关键词： Coordination scheme distributed hash table Message broker federation

来源：评论

学校读者我要写书评

暂无评论

eBot: Approach towards modeling an advanced P2P Botnet 17

eBot: Approach towards modeling an advanced P2P Botnet

引用

17th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom) / 12th IEEE International Conference on Big Data Science and Engineering (IEEE BigDataSE)

作者： Tetarave, Sumit Kumar Tripathy, Somanath Kalaimannan, Ezhil John, Caroline Indian Inst Technol Patna Dept CSE Patna 801103 Bihar India Univ West Florida Dept Comp Sci Pensacola FL USA

ISBN: (纸本)9781538643877

Interpenetration of P2P overlay networks in cellular environments is attaining increased popularity in the recent years. It makes mobile users to share their resources efficiently using 3G, 4G or LTE networks and to experience the advantages of robust connectivity, fault tolerance, load balancing and easy maintenance. The distinguishing features of the overlay networks are dependent on the ability of the peer nodes to connect with each other. This paper focuses on the effect of proposed eBot architecture on P2P connectivity among peer nodes. The analysis is performed with the proposed epidemic model for the recent eBots.

关键词： Decentralized Botnet distributed hash table Gossip mechanism P2P Overlay

来源：评论

学校读者我要写书评

暂无评论

Comparative Study on Decentralized Cloud Collaboration(DCC) 3

Comparative Study on Decentralized Cloud Collaboration(DCC)

引用

3rd International Conference for Convergence in Technology (I2CT)

作者： Selvanathan, Nikethan Poravi, Guhanathan Informat Inst Technol Dept Comp Sci 55 Ramakrishna Rd Wellawatte Sri Lanka

ISBN: (纸本)9781538642733

Cloud collaboration is a billion-dollar industry, for sharing, storing, and co-authoring files. In the current age of information technology, cloud collaboration expects to see a significant amount of growth, as more organizations look to leverage the benefits of the industry specifically in the areas of flexibility, cost-efficiency, and security [I]. However, existing systems basically operates in a centralized cluster to achieve high performance, though they have a demand solving indisputable benefits, there arc several inherent weaknesses such as high server costs for service providers, illegal data mining in trust based architecture, security loopholes, and unethical government surveillance. Therefore, a large-scale resource sharing decentralized system can mitigate these traditional server expenses, data failure, and outage, as well as the enhanced security, and privacy of data. This dissertation presents a background to the problem, its impact on adaption, existing research background, and proposing design for storing, sharing, and coauthor files. The Design presents a decentralized resource (storage and network) sharing system, with real-time collaborative editing, peer (node) management, and redundancy schemes to manage fault tolerance of the distributed storage.

关键词： Peer-to-Peer (P2P) System Decentralization Blockchain distributed hash table Cryptography Fault Tolerance distributed File Storage Security

来源：评论

学校读者我要写书评

暂无评论

Improving the Performance of Fog Computing through the use of Data Locality 30

Improving the Performance of Fog Computing through the use o...

引用

30th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)

作者： Steffenel, Luiz Angelo Univ Reims CReSTIC Lab CASH Team Reims France

ISBN: (纸本)9781538677698

Fog computing extends the Cloud Computing paradigm to the edge of the network, developing a decentralized infrastructure in which services are distributed to locations that best meet the needs of the applications such as low communication latency, data caching or confidentiality. P2P-based platforms are good candidates to host Fog computing, but they usually lack important elements such as controlling where the data is stored and who will handle the computing tasks. As a consequence, controlling where the data is stored becomes as important as controlling who handle it. In this paper we propose different techniques to reinforce data-locality for P2P-based middlewares, and study how these techniques can be implemented. Experimental results demonstrate the interest of data locality on the data access performances.

关键词： fog computing P2P overlay data locality scheduling distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Improving Data Locality in P2P-based Fog Computing Platforms 9

Improving Data Locality in P2P-based Fog Computing Platforms

引用

9th International Conference on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN) / 8th International Conference on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH)

作者： Steffenel, Luiz Angelo Pinheiro, Manuele Kirsch Univ Reims Reims France Univ Paris 1 Pantheon Sorbonne Paris France

Fog computing extends the Cloud Computing paradigm to the edge of the network, relying on computing services intelligently distributed to best meet the applications needs such as low communication latency, data caching or confidentiality reinforcement. While P2P is especially prone to implement Fog computing platforms, it usually lacks important elements such as controlling where the data is stored and who will handle the computing tasks. In this paper we propose both a mapping approach for data-locality and a location-aware scheduling for P2P-based middlewares, improving the data management performance on fog environments. Experimental results comparing the data access performances demonstrate the interest of such techniques. (C) 2018 The Authors. Published by Elsevier Ltd.

关键词： fog computing P2P overlay data locality big data distributed hash table

来源：评论

学校读者我要写书评

暂无评论

TSQM: Trust-based Secure Query Method in Anonymous Communication System

TSQM: Trust-based Secure Query Method in Anonymous Communica...

引用

6th International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

作者： Liu, Xiaohuan Li, Fengyin Yu, Jiguo Cui, Can Qufu Normal Univ Sch Informat Sci & Engn Rizhao 276800 Peoples R China

The peer-to-peer network based on distributed hash table could locate the nodes effectively, but it cannot solve the node-failure problem. By introducing the concept of trust into anonymous communication system, this paper proposes a secure query method, in which, the nodes' trust and the mutual distance between the nodes can be used to select high reliable nodes to construct anonymous communication path. The novel method could alleviate the node-failure problem, and further to improve the message forwarding efficiency. Copyright (C) 2018 Elsevier Ltd. All rights reserved.

关键词： anonymous communication distributed hash table trust distance node-failure

来源：评论

学校读者我要写书评

暂无评论

Blockchain Storage Load Balancing Among DHT Clustered Nodes

Blockchain Storage Load Balancing Among DHT Clustered Nodes

引用

作者： Ryosuke Abe Keio University

学位级别：硕士

In Bitcoin, to independently verify whether new transactions are correct or not, a type of a node called "Full Node" has to hold the whole of historical transactions. The transactions are stored in ledger called "Blockchain." Blockchain is an append-only data structure. Thus, to operate Full Nodes, the required storage capacity would grow too large for resource-constrained devices. Due to the limitation, the existing lightweight node scheme is that a node relies on other Full Nodes. In this thesis, to reduce storage capacity with keeping the independence of each node, we propose a storage load balancing scheme "KARAKASA" using distributed hash table (DHT). In KARAKASA, nodes distributedly keep the whole blockchain among DHT networked nodes. We evaluated KARAKASA from the view of storage capacity and independence. As a result, a node in a cluster does not need to trust other nodes. We concluded that nodes in a DHT cluster can behave like Full Nodes without holding the whole blockchain.

关键词： Bitcoin Storage distributed hash table Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：