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

IEEE International Conference on Communications (ICC)

作者： Kohnen, Michael Univ Duisburg Essen Comp Networking Technol Grp Essen Germany

ISBN: (纸本)9781457720536

Trust and reputation management in peer-to-peer (P2P) networks is a current topic. Most of the works focus on unstructured networks. The existing work operating in structured networks concentrates on a "clean routing table" and aims to keep malicious nodes from it. We follow a different approach which we call "clean routing process": There are no restrictions regarding the nodes that may be contained in a node's routing table. However, only trustworthy nodes shall be used for determining the next hop and eventually for storing or retrieving content items. To achieve this, we present a collation of security measures to avoid common threats and link them to form a secure environment.

关键词： Trust Reputation DHT distributed hash table Kademlia Peer-to-Peer P2P Security

来源：评论

学校读者我要写书评

暂无评论

Decentralized Metadata Management Research Based On distributed hash table Technology

Decentralized Metadata Management Research Based On Distribu...

引用

International Conference on Industrial Control and Electronics Engineering (ICICEE)

作者： Wang Dandong Fang Yu SW Petr Univ Sch Comp Sci Chengdu Sichuan Peoples R China

ISBN: (纸本)9780769547923

A methodology of decentralized metadata management has been proposed within this paper that data and metadata from server-side can be distributed to the various network nodes. This methodology supports large capacity work machines to read and write data in parallel when running data-intensive applications on the platform, with random access, flexible access granularity, and supports concurrent read/write characteristics of high data load. By applying distributed hash table technology, bulk metadata can be divided into the form of tree-structure of segmentation tree. The data and metadata of read/write and new data appended to process are described. The test results show that this methodology can get high bandwidth of aggregation and average bandwidth of read/write when working in different parallel access with read/write process.

关键词： Metadata Decentralized Data-intensive Application distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Peer-to-peer Autonomous Agent Communication Network 21

Peer-to-peer Autonomous Agent Communication Network

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Lokman Rahmani David Minarsch Jonathan Ward Fetch.ai

ISBN: (纸本)9781713832621

Reliable and secure communication between heterogeneously resourced autonomous agents controlled by competing stakeholders in a decentralized environment is a challenge. Agents require a means to find each other and communicate without reliance on a centralized party and participation in the system must be permissionless. We present the Agent Communication Network (ACN), a peer-to-peer lookup system that provides a distributed overlay to the Internet and addresses this problem. The ACN enables agents to find each other and to communicate safely. It achieves this by leveraging a distributed hash table for agent lookup, maintained by participating peers and through the use of public-key cryptography. The paper discusses the properties of the system and its guarantees as well as its integration with a novel multi-agent system. Preliminary benchmark results demonstrate the feasibility of the system, its performance, and its scalability.

关键词： Peer-to-peer distributed hash table Multi-agent communication peer to peer hash table Intelligent agents networks(communications) Agents Communication system security Reliance resin cement Scalability

来源：评论

学校读者我要写书评

暂无评论

A scalable multiagent architecture for monitoring IoT devices

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2019年 139卷 1-14页

作者： Rocha, Vladimir Franco Brandao, Anarosa Alves Fed Univ ABC Ctr Math Computat & Cognit Santo Andre Brazil Univ Sao Paulo Escola Politecn Sao Paulo Brazil

In recent years, the use of wireless devices has experienced huge grown, mainly due to the decrease in cost, size and energy consumption. Research in the Internet of Things have concentrated their efforts on how to monitor these devices taking into account both scalability and efficiency while searching and updating continuously device information. In order to do that, current alternatives combine a widely recognized method, the data aggregation, and a widely adopted distributed structure, called distributed hash table, which form groups of devices, saving energy by minimizing the number of transmissions. However, scalability is still a key challenge when the group comprises a large number of devices. In this paper, we propose a scalable architecture that creates agents to distribute the responsibility of managing groups and the interaction among them, such as merging and splitting, and shares the data aggregation with the devices of group frontier. Experimental results showed the viability of adopting this architecture if compared to the most widely used current approaches.

关键词： Multiagent system distributed hash table Internet of things Data aggregation Scalability

来源：评论

学校读者我要写书评

暂无评论

Proposal of e-Learning System integrated P2P Model with Client-Server Model 18

Proposal of e-Learning System integrated P2P Model with Clie...

引用

18th Annual International Conference on Electronics, Information, and Communication (ICEIC)

作者： Kawato, Toshiya Higashino, Masayuki Takahashi, Kenichi Kawamura, Takao Tottori Univ Tottori Japan Yonago Coll Natl Inst Technol Yonago Tottori Japan

ISBN: (纸本)9788995004449

E-Learning systems that enable learners to study by themselves without a teacher have widely deployed in universities, high schools and companies. Almost their systems are implemented in a client-server model. The client-server-based e-Learning system, however, has the problem of low fault tolerance. Moreover, since computation/storage are concentrated on a server machine, we have to prepare an expensive machine as the server. P2P-based e-Learning systems, therefore, are proposed. In a P2P-based e-Learning system, computational resource and storage are distributed into users' machines. We, therefore, do not prepare an expensive server machine anymore. On the other hand, the copyright issue of learning contents arises, since users' machines manage learning contents. In this paper, we propose an e-Learning system integrated a P2P model with a client-server model. In our system, machines constructing a P2P network provides computational and storage resources, but those machines are not users' machines;they are old personal computers, which are not used in an organization anymore. Since learning contents are not stored in users' machines, the copyright issue of learning contents do not arise anymore.

关键词： e-learning system distributed system distributed hash table

来源：评论

学校读者我要写书评

暂无评论

distributed Data Validation for a Key-value Store in a Decentralized Electric Vehicle Charging Network 11

Distributed Data Validation for a Key-value Store in a Decen...

引用

11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management / 11th International Conference on Knowledge Management and Information Systems (KMIS)

作者： Kirpes, Benedikt Roon, Micha Burgahn, Christopher Univ Mannheim Mannheim Germany Share & Charge Fdn Zug Switzerland

ISBN: (纸本)9789897583827

The mobility sector experiences a fundamental shift to more connected, autonomous, shared and electric means of transportation. For an electric mobility system to function, an efficient and reliable electric vehicle charging network is required. The Open Charging Network, which is built and curated by the Share&Charge Foundation is a digital, open and decentralized infrastructure for operating and connecting assets of the e-mobility ecosystem like charge points and electric vehicles. In such a network validity and consistency of data are crucial. Since the underlying information system is designed based on distributed ledger technologies and distributed hash tables, also the validation of data for the respective key-value store should be implemented and executed in a distributed manner. In this paper, we contribute to the body of research by analyzing the current situation in distributed systems and presenting the design and development of a mechanism for a distributed data validation. We provide an outlook into the future implementation within the Open Charging Network, where the solution will be demonstrated in a suitable context. Further it will be evaluated regarding the primary requirement of data validity and secondary requirements such as availability, reliability and scalability.

关键词： E-Mobility Systems Smart Charging Infrastructure Information Systems distributed Systems distributed Data Storage distributed hash table Key-value Store Data Validation Consensus Mechanism

来源：评论

学校读者我要写书评

暂无评论

Self-emerging Data Infrastructures 5

Self-emerging Data Infrastructures

引用

IEEE 5th International Conference on Collaboration and Internet Computing (CIC)

作者： Palanisamy, Balaji Li, Chao Univ Pittsburgh Sch Comp & Informat Pittsburgh PA 15260 USA Beijing Jiaotong Univ Beijing Key Lab Secur & Privacy Intelligent Trans Beijing Peoples R China

ISBN: (纸本)9781728167398

Timed release of data is an important security primitive for various applications. Such timed data release can be supported using a self-emerging data infrastructure that protects the data until a prescribed data release time and automatically releases to the recipient at the release time. While straight-forward centralized approaches such as cloud storage services may provide a straight-forward solution to implement self-emerging data release, unfortunately, they are limited to a single point of trust and involves a single point of control. In this vision paper, we discuss and review new decentralized designs of self-emerging data release systems using large-scale peer-to-peer (P2P) networks as the underlying infrastructure. We analyze the design of decentralized self-emerging data release systems using two P2P network infrastructures, namely distributed hash tables (DHTs) and blockchains. We demonstrate how self-emerging data release can be used to support gradual release of private data in a decentralized infrastructure. Finally, we present some promising directions of future research on security primitives and protocols for timed release of private data in decentralized environments.

关键词： Blockchain Data Infrastructure distributed hash table Privacy

来源：评论

学校读者我要写书评

暂无评论

STAKECUBE: Combining Sharding and Proof-of-Stake to Build Fork-Free Secure Permissionless distributed Ledgers 7th

STAKECUBE: Combining Sharding and Proof-of-Stake to Build Fo...

引用

7th International Conference on Networked Systems (NETYS)

作者： Durand, Antoine Anceaume, Emmanuelle Ludinard, Romaric Paris Saclay IRT Syst X Paris France Univ Rennes CNRS Inria IRISA Rennes France IMT Atlantique IRISA Nantes France

ISBN: (纸本)9783030312770;9783030312763

Our work focuses on the design of a scalable permission-less blockchain in the proof-of-stake setting. In particular, we use a distributed hash table as a building block to set up randomized shards, and then leverage the sharded architecture to validate blocks in an efficient manner. We combine verifiable Byzantine agreements run by shards of stakeholders and a block validation protocol to guarantee that forks occur with negligible probability. We impose induced churn to make shards robust to eclipse attacks, and we rely on the UTXO coin model to guarantee that any stakeholder action is securely verifiable by anyone. Our protocol works against adaptive adversary, and makes no synchrony assumption beyond what is required for the byzantine agreement.

关键词： Blockchain Proof-of-stake distributed hash table Sharding

来源：评论

学校读者我要写书评

暂无评论

A Consistent Replica Selection Approach for distributed Key-Value Storage System

A Consistent Replica Selection Approach for Distributed Key-...

引用

International Conference on Advanced Information Technologies (ICAIT)

作者： Nwe, Thazin Yee, Tin Tin Htoon, Ei Chaw Nakamura, Junya Univ Informat Technol Yangon Myanmar Toyohashi Univ Technol Toyohashi Aichi Japan

ISBN: (纸本)9781728151731

When the amount of data is increasing, most of the distributed key-value storage systems use the quorum based consistent replica selection algorithms for fault-tolerance and load balancing. These algorithms allow higher consistency because the quorum requires a majority of replicas to execute the request. The fewer failure nodes the system has, the higher the consistency. On the other hand, it has a high latency of a read/write request due to the static consistency level for a quorum. Higher read/ write consistency level dramatically increases the read/ write latency and is not suitable for accessing the updated version of the data and massive workload. We propose a consistent replica selection approach with dynamically changing the consistency level. The system distributes data in a distributed hash table for the write request. And the system searches the nearest replica with an existing consistent hashing algorithm instead of random selection and predicts the staleness rate with the Probability of Bounded Staleness (PBS) to select the consistent replicas for the read request. The experimental result shows that the proposed system reduces the staleness rate and the number of replicas by varying consistency level.

关键词： distributed Key-Value Storage Quorum Consistency Level distributed hash table Probability of Bounded Staleness

来源：评论

学校读者我要写书评

暂无评论

Decentralized and locality aware replication method for DHT-based P2P storage systems

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 84卷 32-46页

作者： Hassanzadeh-Nazarabadi, Yahya Kupcu, Alptekin Ozkasap, Oznur Koc Univ Dept Comp Engn Istanbul Turkey

Skip Graph, a type of DHT, plays an important role in P2P cloud storage applications, where nodes publicly or privately store, share, and access data. Nowadays P2P storage systems are widely using replication to support data availability, reliability, and maintainability. With replication, the main consideration is determining peers to replicate the data. Traditional replication algorithms are partially randomized and employ rigid assumptions about nodes' distribution. This results in high access delay between nodes and their closest replicas, which degrades the system performance. We propose GLARAS, a dynamic and fully decentralized locality aware replication method for Skip Graph. In contrast to the traditional algorithms, which replicate based on strict assumptions about the distribution of nodes, GLARAS aims to approximate the underlying distribution by interacting with a very small subset of nodes and minimize the average access delay of replication accordingly. To ensure GLARAS performs at its best, we also propose a dynamic fully decentralized landmark-based locality aware name ID assignment namely LANS. This ensures that the nodes' distances in the overlay and the underlying network are consistent with each other. Our extensive experiments and analysis results demonstrate that compared to the best existing decentralized locality aware replication, GLARAS improves the average access delay of public and private replications by about 13% and 17%, respectively. Likewise, in comparison to the best existing decentralized locality aware name ID assignment, LANS improves the locality awareness of name IDs and the end-to-end latency of search queries in Skip Graph with the gains of about 19% and 8%, respectively. The average replication's access delay of a Skip Graph-based P2P storage system that employs GLARAS and LANS has an improvement gain of about 2.7 over the best state-of-the-art algorithms. Since Skip Graph is a DHT, any other DHT-based P2P storage service wo

关键词： Skip Graph distributed hash table DHT P2P cloud storage Locality aware network for DHTs Replication

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：