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

IEEE Symposium on Web Society, SWS

作者： Pi, Renjie Tong, Junjie Xu, Ke Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424463572

The CDN (Content Delivery Network) provide access acceleration through nearly static data caching and delivery, but cannot serve non-URL located dynamic data and have HTTP transport limits. We propose a SDN (Service Delivery Network) scheme running over end-to-end DHT (distributed hash table) including servers and client hosts to provide more efficient system deployment. All SDN hosts consist of a structured overlay to deliver data and provide various native applicate interface. The SDN involves the clients into workload scheduling so to alleviate the complex of servers. We implement a simple prototype to validate its advantage. © 2010 IEEE.

关键词： DHT HTTP transport limits content delivery network distributed hash table distributed processing end-to-end end-to-end DHT native applicate interface nearly static data caching peer-to-peer computing service delivery network service delivery network workload scheduling

来源：评论

学校读者我要写书评

暂无评论

hash-Based distributed Public Key Infrastructure for Ubiquitous Environments

Hash-Based Distributed Public Key Infrastructure for Ubiquit...

引用

4th International Conference on Complex, Intelligent and Software Intensive Systems (CICIS)

作者： Takeda, Atushi Nakayama, Seiya Kitagata, Gen Chakraborty, Debasish hashimoto, Kazuo Shiratori, Norio Tohoku Bunka Gakuen Univ Dept Intelligent Informat Syst Sendai Miyagi Japan Tohoku Univ Grad Sch Comp Sci Sendai Miyagi Japan Tohoku Univ Res Inst Elect Commun Sendai Miyagi Japan

ISBN: (纸本)9780769539676

In ubiquitous environments, there are a huge number of computer nodes which provide a lot of information services via the Internet. Therefore, a secure communication system is required for ubiquitous environments. In this paper, we propose a new architecture of distributed public key infrastructure, named as hash-based distributed Public Key Infrastructure (HDPKI). A HDPKI system achieves a scalable management of public key certificates by using distributed hash table. Additionally, it is easy to use a HDPKI system, because we can register our public key certificates automatically. In this paper, we show scalability of HDPKI through computer simulation. According to these results, the total amount of required messages for certificate management in a HDPKI system is O(log n) where n is the number of nodes.

关键词： overlay network peer-to-peer network public key infrastructure distributed hash table

来源：评论

学校读者我要写书评

暂无评论

DHTrust: A Robust and distributed Reputation System for Trusted Peer-to-Peer Networks

DHTrust: A Robust and Distributed Reputation System for Trus...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Liu, Yaqiong Xue, Weilian Li, Keqiu Chi, Zhongxian Min, Geyong Qu, Wenyu Dalian Univ Technol Sch Comp Sci & Technol Dalian 116024 Peoples R China Liaoning Normal Univ Sch Management Dalian 116029 Peoples R China Univ Bradford Dept Comp Bradford BD7 1DP W Yorkshire England Dalian Maritime Univ Sch Informat Sci & Technol Dalian 116026 Peoples R China

ISBN: (纸本)9781424456383

The anonymity and dynamic characters of Peer-to-Peer (P2P) system makes it an ideal medium for selfish and vicious action. In order to solve this problem, P2P reputation systems are proposed to evaluate the trustworthiness of peers and to prevent the selfish, dishonest, and malicious peers' behaviors, which collects local reputation scores and aggregates them into the global reputation. In this paper we propose a DHT trust overlay network (DHTON) to model the network structure and the storage of reputation information. We also design a robust and distributing reputation system, DHTrust, which takes full advantage of the distributed hash table (DHT) to distribute local reputation to trade off the damage of fake reputation information by genuine reputation information. By using the trust evaluation towards two reputation scores, we can also distinguish and evaluate the fundamental behaviors of peers in P2P network, i.e., providing service and issuing reputation scores. Through the simulation experiments, we find our system makes significant performance gains in convergence speed and aggregation accuracy, and the most important, is robust to malicious peers.

关键词： DHT trust overlay network DHTrust P2P system computer network security distributed hash table distributed reputation system file organisation peer-to-peer computing trusted peer-to-peer networks

来源：评论

学校读者我要写书评

暂无评论

DHT-Based Detection of Node Clone in Wireless Sensor Networks

DHT-Based Detection of Node Clone in Wireless Sensor Network...

引用

1st International Conference on Ad Hoc Networks (AdHocNets 2009)

作者： Li, Zhijun Gong, Guang Univ Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783642117220

Wireless sensor networks are vulnerable to the node clone attack because of low-cost, resource-constrained sensor nodes, and uncontrolled environments where they are left unattended. Several distributed protocols have been proposed for detecting clone. However, some protocols rely on an implicit assumption that every node is aware of all other nodes' existence;other protocols using an geographic hash table require that nodes know the general network deployment graph. Those assumptions hardly hold for many sensor networks. In this paper, we present a novel node clone detection protocol based on distributed hash table (DHT). DHT provides good distributed properties and our protocol is practical for every kind of sensor networks. We analyze the protocol performance theoretically. Moreover, we implement our protocol in the OMNeT++ simulation framework. The extensive simulation results show that our protocol can detect clone efficiently and holds strong resistance against adversaries.

关键词： node clone attack distributed detection wireless sensor networks distributed hash table key-based routing

来源：评论

学校读者我要写书评

暂无评论

A Proposal of P2P Content Retrieval System Using Access-Based Grouping Technique

A Proposal of P2P Content Retrieval System Using Access-Base...

引用

14th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems

作者： Sasaki, Takuya Sawamoto, Jun Katoh, Takashi Wada, Yuji Segawa, Norihisa Sugino, Eiji Iwate Prefectural Univ Fac Software & Informat Sci Iwate Japan Tokyo Denki Univ Dept Informat Environm Tokyo Japan

ISBN: (纸本)9783642153921

In recent years, the diversification and ubiquitousness of information is rapidly advancing due to the development of the information and comm cation technology. As for the usage of the information, the attention of sharing of information using P2P network rises, and it is becoming to be used in many fields. The distributed hash table (DHT) is one of the typical overlay networks on P2P. However, there is a problem of lacking of flexibility in the retrieval on DHT. In this paper, to improve the convenience of the content access, we propose an efficient content access method based on the grouping technique of the contents using the content access history and frequency and the evaluation of grouping efficiency (precision, recall) is performed by the simple simulatior

关键词： P2P network distributed hash table overlay network conten: retrieval grouping technique

来源：评论

学校读者我要写书评

暂无评论

Secure and Robust Overlay Content Distribution

Secure and Robust Overlay Content Distribution

引用

作者： Kang, Hun Jeong University of Minnesota

学位级别：Ph.D.

With the success of applications spurring the tremendous increase in the volume of data transfer, efficient and reliable content distribution has become a key issue. Peer-to-peer (P2P) technology has gained popularity as a promising approach to large-scale content distribution due to its benefits including self-organizing, load-balancing, and fault-tolerance. Despite these strengths, P2P systems also present several challenges such as performance guarantees, reliability, efficiency, and security. In P2P systems deployed on a large scale, these challenges are more difficult to deal with because of the large number of participants, unreliable user behaviors, and unexpected situations. This thesis explores solutions to improve the efficiency, robustness, and security of large-scale P2P content distribution systems, focusing on three particular issues: lookup, practical network coding, and secure network coding. A distributed hash table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. This thesis focuses on improving the lookup performance of Kademlia DHT protocol. Although many studies have proposed DHTs to provide a means of organizing and locating peers to many distributed systems, to the best of my knowledge, Kademlia is a unique DHT deployed on an Internet-scale in the real world. This study evaluates the lookup performance of Kad (a variation of Kademlia) deployed in one of the largest P2P file-sharing networks. The measurement study shows that lookup results are not consistent; only 18% of nodes located by storing and searching lookups are the same. This lookup inconsistency problem leads to poor performance and the inefficient use of resources during lookups. This study identifies the underlying reasons for this inconsistency problem and the poor performance of lookups, and proposes solutions to guarantee reliable lookup results while providing the efficient use of resources. This thesis studies

关键词： Content Distribution distributed hash table Network Coding Overlay Peer-to-Peer Security Computer Science

来源：评论

学校读者我要写书评

暂无评论

Resilient and efficient load balancing in distributed hash tables

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2009年第1期32卷 45-60页

作者： Wu, Di Tian, Ye Ng, Kam-Wing Chinese Univ Hong Kong Dept Comp Sci & Engn Sha Tin Hong Kong Peoples R China

As a fundamental problem in distributed hash table (DHT)-based systems, load balancing is important to avoid performance degradation and guarantee system fairness. Among existing migration-based load balancing strategies, there are two main categories: (1) rendezvous directory strategy (RDS) and (2) independent searching strategy (ISS). However, none of them can achieve resilience and efficiency at the same time. In this paper, we propose a group multicast strategy (GMS) for load balancing in DHT systems, which attempts to achieve the benefits of both RDS and ISS. GMS does not rely on a few static rendezvous directories to perform load balancing. Instead, load information is disseminated within the formed groups via a multicast protocol. Thus, each peer has enough information to act as the rendezvous directory and perform load balancing within its group. Besides intra-group load balancing, inter-group load balancing and emergent load balancing are also supported by GMS. In GMS, the position of the rendezvous directory is randomized in each round, which further improves system resilience. In order to have a better understanding of GMS, we also perform analytical studies on GMS in terms of its scalability and efficiency under churn. Finally, the effectiveness of GMS is evaluated by extensive simulation under different workload and churn levels. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： distributed system distributed hash table Load balancing

来源：评论

学校读者我要写书评

暂无评论

Improving Community Management Performance with Two-Level Hierarchical DHT Overlays

引用

JOURNAL OF INTERNET TECHNOLOGY 2010年第2期11卷 167-179页

作者： Koskela, Timo Kassinen, Otso Ou, Zhonghong Ylianttila, Mika Univ Oulu Elect & Informat Engn Dept Oulu Finland

In this paper, we evaluate a P2P community management system that works on top of a DHT-based P2PSIP protocol implementation. The key idea in our system is to establish a separate DHT overlay network for each community, resulting in multiple small overlays that are subsets of the main overlay. The main DHT overlay is largely used for community and membership information discovery. The feasibility of our two-level hierarchical system is evaluated with a prototype implementation. We compare our system against the flat structure where all the community related activities are performed in a single DHT overlay. The nodes' average network traffic load is evaluated with varying parameters. In addition, the energy consumption of mobile nodes is measured. Our test results show that our P2P community management system performs especially well when there is a great deal of community-related activity of the nodes.

关键词： Peer-to-peer Community distributed hash table Energy consumption Routing latency Churn

来源：评论

学校读者我要写书评

暂无评论

A Network Locality Aware Algorithm Based on Identity Mapping

A Network Locality Aware Algorithm Based on Identity Mapping

引用

2010 2nd International Conference on Signal Processing System(2010年信号处理系统国际会议 ICSPS 2010)

作者： Jianwei Zhang Xiaosu Zhan Dongyao Zou Si Liu Yunfei Guo National Digital Switching System Engineering and Technology Research Center Zhengzhou Henan. P. R. The Institute of Military Operations Research Chinese Academy of Military Science Beijing P. R. Ch School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou. H National Digital Switching System Engineering and Technology Research Center Zhengzhou Henan. P. R.

Separation of identifier and locator provides good conditions of routing scalability and mobility for Internet routing and lP addressing. Based on the idea of identifier and locator separation, in this paper we introduce the access identifier (AID) and the routing locator (RLOC), design a network locality-aware distributed hash table (NLADHT), then present an identifier mapping information storage algorithm with network locality-aware capability (N3Chord). Simulation performance shows that, the identifiers of distributed network storage nodes assigned by NLA-DHT with good query performance in network topology locality consistency, and the query efficiency and network fault handling capability of N3-Chord is much superior to Chord FingerPNS and ChordFinger.

关键词： Chord distributed hash table network locality aware Identity Mapping

来源：评论

学校读者我要写书评

暂无评论

Range Queries Based on a Structured Segment Tree in P2P Systems

Range Queries Based on a Structured Segment Tree in P2P Syst...

引用

Annual IEEE International Conference on Engineering of Computer Based Systems

作者： Ye-In Chang Chen-Chang Wu Jun-Hong Shen Tzu-Lun Huang Dept. of Computer Science and Engineering National Sun Yat-Sen University Dept. of Information Communication Asia University

ISBN: (纸本)9781424465378;9780769540054

Range queries will find any data item whose value within the range. The distributed Segment Tree method (DST) is a famous method for range queries in P2P systems. It uses a segment tree to preserve the local continuity of the range data at each node based on the distributed hash table (DHT) logic. It can be applied in any DHT-based P2P system. However, data distribution of the DST method may cause overlapping. When searching a data range, the DST method sends more number of requests than what is really needed. Although the DST method designs the Downward Load Stripping Mechanism, the load on peers may still not be balanced. Therefore, in this paper, we propose a method called Structured Segment Tree (SST) that does not use the DHT logic but embeds the structure of the segment tree into the P2P systems. Each peer in our proposed P2P system represents a node of a segment tree. Data intervals at the same level are continuous and will not overlap with each other. In addition, we add sibling links to preserve the spatial locality and speed up the search efficiency. From our simulation, we have shown that the SST method routes less number of peers to locate the requested range data than the DST method. We have also shown that the load based on our method is more balanced than that based on the DST method.

关键词： distributed hash table Load balance P2P Range query Segment tree Range searching Load balancing P2RY4 gene peer to peer file sharing Drill stem testing water sink Dystonin hash table Range of a function Peers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：