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

7th International Congress of Information and Communication Technology (ICICT)

作者： Feng, Chao Li, Baoan Beijing Informat Sci & Technol Univ Comp Sch Beijing 100101 Peoples R China Beijing Informat Sci & Technol Univ Beijing Key Lab Internet Culture & Digital Dissem Beijing 100101 Peoples R China

In view of the demand of massive unstructured data storage and fast retrieval, in this study, it puts forward a distributed and unstructured database HBase under the Hadoop platform to store massive temporal data, and to build a temporal data storage model with the store unit as the temporal set. Designing a multi-level distributed hash table indexing algorithm (t-DHT), so that realized retrieval the temporal attribute values of the temporal column family efficiently and rapidly. By mapping temporal attribute value to two-dimensional space, the transformation of temporal data to spatial object is realized. Dividing the temporal data area by using the spatial data processing method generates multilevel temporal data sub domain, and designing HBase stored multilevel index table by using the distributed hash table. Experimental results show that the proposed method has higher performance and can speed up the retrieval speed of temporal information in HBase to a certain extent.

关键词： Temporal Set Temporal Data distributed hash table HBase

来源：评论

学校读者我要写书评

暂无评论

Multiple Peer Chord Rings Approach for Device Discovery in IoT Environment

Multiple Peer Chord Rings Approach for Device Discovery in I...

引用

14th International Conference on Mobile Systems and Pervasive Computing (MobiSPC) / 12th International Conference on Future Networks and Communications (FNC)

作者： Binh Minh Nguyen Hong-Nhat Quoc Hoang Hluchy, Ladislav Tuyet Trinh Vu Hieu Le Hanoi Univ Sci & Technol Sch Informat & Commun Technol Hanoi Vietnam Slovak Acad Sci Inst Informat Dubravska Cesta 9 Bratislava 84507 Slovakia

ecently, with the advances of information and electrical technologies, Internet of Thing (IoT) has moved from being a far vision to an increasing market reality. IoT promises to connect all physical things via a dynamic global network infrastructure and create intelligent behaviors in different contexts without human manipulations. In line with this development, the number of IoT solutions also have augmented exponentially covering many domains from health care, urban management to life quality improvement and so forth. However, separate appearances of these solutions today has led to barriers in enlarging smart environments because they lack a mechanism for integration. It is well-known that in the very near future, IoT requires the capabilities of high scale and dynamic adaptation with linking many new and existing smart contexts together. Hence, the need of having a comprehensive management method for the large-scale IoT environments is urgent at the time. In this paper, we focus on designing an overlay management architecture based on Chord algorithm to manage things in heterogeneous space. The architecture is a collection of multiple peer Chord rings, and thus each of these rings is considered as a smart context. We also bring forward operation mechanisms for the architecture such as thing identification, key insert/remove, key lookup and node joining/leave. Our proposed architecture is simulated and evaluated with diverse properties. The gained results showed the feasibility of our approach in reality meeting scalability, robustness and maintainability requirements applying to manage and control cyber-physical systems. (C) 2017 The Authors. Published by Elsevier B.V.

关键词： IoTChord multiple peer rings distributed hash table overlay management network discovery mechanism thing naming service object discovery service

来源：评论

学校读者我要写书评

暂无评论

EclipseMR: distributed and Parallel Task Processing with Consistent hashing

EclipseMR: Distributed and Parallel Task Processing with Con...

引用

IEEE International Conference on Cluster Computing (CLUSTER)

作者： Sanchez, Vicente A. B. Kim, Wonbae Eom, Youngmoon Jin, Kibeom Nam, Moohyeon Hwang, Deukyeon Kim, Jik-Soo Nam, Beomseok UNIST Ulsan South Korea Korea Mil Acad Seoul South Korea Myongji Univ Seoul South Korea

ISBN: (纸本)9781538623268

We present EclipseMR, a novel MapReduce framework prototype that efficiently utilizes a large distributed memory in cluster environments. EclipseMR consists of double-layered consistent hash rings - a decentralized DHT-based file system and an in-memory key-value store that employs consistent hashing. The in-memory key-value store in EclipseMR is designed not only to cache local data but also remote data as well so that globally popular data can be distributed across cluster servers and found by consistent hashing. In order to leverage large distributed memories and increase the cache hit ratio, we propose a locality-aware fair (LAF) job scheduler that works as the load balancer for the distributed in-memory caches. Based on hash keys, the LAF job scheduler predicts which servers have reusable data, and assigns tasks to the servers so that they can be reused. The LAF job scheduler makes its best efforts to strike a balance between data locality and load balance, which often conflict with each other. We evaluate EclipseMR by quantifying the performance effect of each component using several representative MapReduce applications and show EclipseMR is faster than Hadoop and Spark by a large margin for various applications.

关键词： MapReduce distributed Caching Consistent hashing distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Hybrid DVE-P2P Networking Based on Interests Clustering 7

Hierarchical Hybrid DVE-P2P Networking Based on Interests Cl...

引用

7th International Conference on Virtual Reality and Visualization (ICVRV)

作者： Tu, Zhiyong Jiang, Wei Jia, Jinyuan Tongji Univ Sch Software Engn Shanghai Peoples R China

ISBN: (纸本)9781538626368

In the massive multi-player online game scenes single P2P topology cannot sufficiently accomplish a variety of mission. To strengthen player experience, rapidly respond client request and improve P2P network scalability and flexibility. Firstly, we propose network architecture, which is hierarchical hybrid DVE-P2P based on interested cluster to achieve this purpose. Secondly, based on this network architecture and topology we propose three logical layers along with two physical layers to guarantee its security, flexibility, reliability, scalability and high throughput. Thirdly, based on Area of Interest we propose interested cluster to quickly share similarity resource with other peer in own cluster, selecting super node with excellent performance as central, virtual server, which is connected to Chord ring, to manage load balancing of interested cluster, at same time we present algorithms and strategies to load balancing for different peer, interested cluster and server. Finally, we perform experiments to show that our approaches significantly improve the DVE system's response speed, throughput, dynamic load balancing, load index and stability.

关键词： load balancing DVE interested cluster distributed hash table support server

来源：评论

学校读者我要写书评

暂无评论

distributed hash table-Based Interrogating-Call Session Control Function Network in the Internet Protocol Multimedia Subsystem for Efficient Query Services

引用

COMPUTER JOURNAL 2010年第7期53卷 918-933页

作者： Huang, Chung-Ming Li, Jian-Wei Chen, Chun-Ta Natl Cheng Kung Univ Dept Comp Sci & Informat Engn Tainan 701 Taiwan

Internet protocol multimedia subsystem (IMS) is an overlaid infrastructure above the packet-switched domain of the universal mobile telecommunication system core network. IMS enables and enhances real-time multimedia mobile services. IMS signaling and media are separated in IMS. For media session negotiation, two basic procedures in IMS are (i) IMS registration procedure and (ii) IMS incoming call setup procedure. IMS signaling needs to traverse a set of call session control functions (CSCFs), which are proxy-CSCF, interrogating-CSCF (I-CSCF) and serving-CSCF (S-CSCF). However, we observe that I-CSCFs need to query the home subscriber server (HSS) to obtain the name of S-CSCF for each subscriber's request in both the basic procedures. It results in a certain load occuring in the HSS and a certain procedure delay also occurs. Therefore, we employ the distributed hash table (DHT) into IMS to form a DHT-based I-CSCF network. Each I-CSCF in the DHT-based I-CSCF network can share and relieve HSS's load. As a result, the incoming call setup procedure can be speeded up. We also propose two maintaining procedures to maintain the DHT-based I-CSCF network for I-CSCFs join and leave scenarios. We propose one maintaining mechanism to guarantee the proposed system to be able to work well in the failure scenario of I-CSCF. According to the performance evaluation results, the load of HSS is reduced and shared among I-CSCFs in the home network and the signaling delay cost of the incoming call setup procedure is less than that of existent systems even if failure occurs and then is removed.

关键词： Chord Chord ring call session control function distributed hash table IP multimedia subsystem incoming call setup registration session initiation protocol

来源：评论

学校读者我要写书评

暂无评论

Multiple Peer Chord Rings Approach for Device Discovery in IoT Environment

引用

Procedia Computer Science 2017年 110卷 125-134页

作者： Binh Minh Nguyen Hong-Nhat Quoc Hoang Ladislav Hluchý Tuyet Trinh Vu Hieu Le School of Information and Communication Technology Hanoi University of Science and Technology Vietnam Institute of Informatics Slovak Academy of Sciences Dubravska cesta 9 845 07 Bratislava Slovakia

Recently, with the advances of information and electrical technologies, Internet of Thing (IoT) has moved from being a far vision to an increasing market reality. IoT promises to connect all physical “things” via a dynamic global network infrastructure and create intelligent behaviors in different contexts without human manipulations. In line with this development, the number of IoT solutions also have augmented exponentially covering many domains from health care, urban management to life quality improvement and so forth. However, separate appearances of these solutions today has led to barriers in enlarging smart environments because they lack a mechanism for integration. It is well-known that in the very near future, IoT requires the capabilities of high scale and dynamic adaptation with linking many new and existing smart contexts together. Hence, the need of having a comprehensive management method for the large-scale IoT environments is urgent at the time. In this paper, we focus on designing an overlay management architecture based on Chord algorithm to manage things in heterogeneous space. The architecture is a collection of multiple peer Chord rings, and thus each of these rings is considered as a smart context. We also bring forward operation mechanisms for the architecture such as thing identification, key insert/remove, key lookup and node joining/leave. Our proposed architecture is simulated and evaluated with diverse properties. The gained results showed the feasibility of our approach in reality meeting scalability, robustness and maintainability requirements applying to manage and control cyber-physical systems.

关键词： IoT Chord multiple peer rings distributed hash table overlay management network discovery mechanism thing naming service object discovery service

来源：评论

学校读者我要写书评

暂无评论

αRoute: Routing on Names

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2016年第5期24卷 3070-3083页

作者： Ahmed, Reaz Bari, Md. Faizul Chowdhury, Shihabur Rahman Rabbani, Md. Golam Boutaba, Raouf Mathieu, Bertrand Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada Amazon Com Inc Vancouver BC V6B 0M3 Canada Orange Labs F-22300 Lannion France

One of the crucial building blocks for Information Centric Networking (ICN) is a name based routing scheme that can route directly on content names instead of IP addresses. However, moving the address space from IP addresses to content names brings the scalability issues to a whole new level, due to two reasons. First, name aggregation is not as trivial a task as the IP address aggregation in BGP routing. Second, the number of addressable contents in the Internet is several orders of magnitude higher than the number of IP addresses. With the current size of the Internet, name based, anycast routing is very challenging specially when routing efficiency is of prime importance. We propose a name-based routing scheme alpha Route for ICN that offers efficient bandwidth usage, guaranteed content lookup and scalable routing table size. alpha Route consists of two components: an alphanumeric distributed hash table (DHT) and an overlay to underlay (Internet topology) mapping algorithm. Simulation results show that alpha Route performs significantly better than Content Centric Network (CCN) in terms of network bandwidth usage, lookup latency and load balancing.

关键词： distributed hash table information centric networks next generation networking overlay networks

来源：评论

学校读者我要写书评

暂无评论

Research of Temporal Information Index Strategy Based on HBase

引用

Procedia Computer Science 2017年 107卷 367-372页

作者： Chao Feng Baoan Li Computer School Beijing Information Science and Technology University Beijing 100101 China Beijing Key Laboratory of Internet Culture and Digital Dissemination Research Beijing Information Science and Technology University Beijing 100101 China

关键词： Temporal Set Temporal Data distributed hash table HBase

来源：评论

学校读者我要写书评

暂无评论

Freeweb: P2P-Assisted Collaborative Censorship-Resistant Web Browsing

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2016年第11期27卷 3226-3241页

作者： Shen, Haiying Liu, Alex X. Liu, Guoxin Zhao, Lianyu Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

In many countries, the Internet is under stringent censorship for political or religious reasons which severely undermines the free flow of information. A censorship-resistant web browsing system must be scalable, blocking resistant, and tracing resistant. However, current censorship-resistant web browsing systems, which use a group of dedicated proxies to bypass censorship, fail to meet these requirements. To tackle these challenges, we propose Freeweb, which relies on widely-distributed peer-to-peer (P2P) nodes in a decentralized manner rather than specified proxies in a centralized manner. We also proposed enhancement methods to reduce file access delay and avoid node overloads in Freeweb. Freeweb is built on top of a distributed hash table (DHT)-based P2P network, where nodes not under censorship help nodes under censorship to access blocked webpages. Freeweb has a web browser front-end whose user interface resembles existing web browsers. The underlying complex process of retrieving blocked webpages is therefore hidden from users. We implemented an open-sourced Freeweb and conducted extensive real-world experiments on PlanetLab. The experimental results show that Freeweb has a high success rate and reasonable browsing latency, and its enhancement reduces much network load and file access latency, and avoids node overloads.

关键词： Censorship-resistance web browsing peer-to-peer network distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Blogracy: A Peer-to-Peer Social Network

引用

INTERNATIONAL JOURNAL OF distributed SYSTEMS AND TECHNOLOGIES 2016年第2期7卷 37-56页

作者： Franchi, Enrico Poggi, Agostino Tomaiuolo, Michele Univ Parma Parma Italy

The current approach to build social networking systems is to create huge centralized systems owned by a single company. However, such strategy has many drawbacks, e.g., lack of privacy, lack of anonymity, risks of censorship and operating costs. In this paper the authors propose a novel P2P system that leverages existing, widespread and stable technologies such as DHTs and BitTorrent. In particular, they introduce a key-based identity system and a model of social relations for distributing content efficiently among interested readers. The system they propose, Blogracy, is a micro-blogging social networking system focused on: (i) anonymity and resilience to censorship;(ii) authenticatable content;(iii) semantic interoperability using activity streams. The authors have implemented the system and conducted various experiments to study its behaviour. The results are presented here, regarding (i) communication delays for some simulations of node churn, (ii) delays measured in test operations over PlanetLab, in direct communication, and (iii) through the I2P anonymizing network.

关键词： Anonymity Censorship Confidentiality distributed hash table File Sharing Peer-to-Peer Social Network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：