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

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

来源：评论

学校读者我要写书评

暂无评论

distributed hash table based routing algorithm for wireless sensor networks 5

Distributed hash table based routing algorithm for wireless ...

引用

5th International Conference on Intelligent Systems Design and Engineering Applications (ISDEA)

作者： Chen Yan Suzhou Inst Trade&Commerce Dept Informat Suzhou 215009 Peoples R China

ISBN: (纸本)9781479942626

As the routing protocol can greatly influence the energy consumption of the sensor nodes in research field of wireless sensor networks. In this paper, we present a novel distributed hash table based routing algorithm for wireless sensor networks. distributed hash table is a kind of distributed memory approach, of which the single node can be expanded to the whole Internet. Particularly, each node is controlled by a part of the whole resource space, and the related index information can be saved on it. In the proposed routing algorithm, each node in wireless sensor networks can be allocated an ID using hash functions. Afterwards, each node maintains a routing table, and then the selective information can be transmitted through the routing table. Next, we present a modified finger table named speedup finger table, and then used it in the wireless sensor networks routing algorithm. Finally, we design a series of experiments to verify the effectiveness of the proposed algorithm. Experimental results demonstrate that compared with the existing related works, the proposed routing algorithm is effective and can obviously reduce the energy consumption.

关键词： Wireless sensor networks distributed hash table Routing algorithm Finger table Route table

来源：评论

学校读者我要写书评

暂无评论

HyCube: A distributed hash table based on a variable metric

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2017年第4期10卷 954-982页

作者： Olszak, Artur Warsaw Univ Technol Inst Comp Sci Warsaw Poland

distributed hash tables (DHT) proved to be scalable decentralized systems providing efficient resource location. This paper concentrates on efficiency and resilience to node failures of DHT systems and presents a novel model of a distributed hash table based on a hierarchical hypercube geometry, called HyCube. The DHT geometry, the choice of the metric defining logical distances between nodes, and the routing algorithm have fundamental influence on routing efficiency and resilience. The use of the one-dimensional model (placing the nodes logically on a ring) allows the nodes to maintain sets of references called sequential neighbors - certain numbers of neighbors that are the closest existing nodes in both directions on the ring. Such a model yields a very high level of resilience to node failures. The new approach, presented in the paper, employs a variable multi-dimensional metric adopting the Steinhaus transform. Routing, lookup and search algorithms are discussed, as well as routing table nodes selection and self-organization techniques. It is shown that the new approach allows reaching a higher level of resilience to node failures, as well as a shorter average routing path length than with the use of the sequential neighbors sets.

关键词： distributed hash table Routing algorithm Lookup algorithm Search algorithm Failure resilience

来源：评论

学校读者我要写书评

暂无评论

Scalable signaling protocol for Web real-time communication based on a distributed hash table

引用

COMPUTER COMMUNICATIONS 2015年第Oct.1期70卷 28-39页

作者： Paik, Jung Ha Lee, Dong Hoon Korea Univ Dept Informat Secur Seoul South Korea

Web real-time communication (WebRTC) provides browser-to-browser communications without installing any plug-in. In WebRTC, peers have to prepare their communication session through a signaling protocol which coordinates peers and exchanges Session Description Protocol (SDP) message between two peers. The problem is that the most well known signaling method cannot provide the scalability because the method relies on only single server. To overcome the problem, this paper presents a scalable WebRTC signaling protocol. The main idea is that each peer forms a peer-to-peer topology by structuring relevant WebRTC connections with each other and then sends signals across those connections. The central server needs to handle only a few connection establishments for newly joining peers. The rest of the signaling process can be performed by peers. We define and justify such a protocol including a bootstrap method, a stabilization scheme, and peer lookup. The procedures are designed to be suitable for WebRTC connections and to be resilient against the churn condition. Furthermore, we implement the proposed protocol in pure JavaScript to show that it is realizable. The performance of the implementation is practical, with signaling latency averaging 0.5 s when the number of peers is 1000. Each peer still correctly locates the other peers even when the network is very congested. (C) 2015 Elsevier B.V. All rights reserved.

关键词： WebRTC distributed hash table Signaling protocol Peer-to-peer

来源：评论

学校读者我要写书评

暂无评论

Data Recovery of distributed hash table with distributed-to-distributed Data Copy

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2009年第10期E92D卷 1999-2006页

作者： Doi, Yusuke Wakayama, Shirou Ozaki, Satoshi Toshiba Co Ltd Corp R&D Ctr Kawasaki Kanagawa 2128582 Japan Univ Tokyo Grad Sch Informat & Technol Tokyo 1138656 Japan

To realize huge-scale information services, many distributed hash table (DHT) based systems have been proposed. For example, there are some proposals to manage item-level product traceability information with DHTs. In such an application, each entry of a huge number of item-level IDs need to be available on a DHT To ensure data availability, the soft-state approach has been employed in previous works. However, this does not scale well against the number of entries on it DHT. As we expect 1010 products in the traceability case, the soft-state approach is unacceptable. In this paper, we propose distributed-to-distributed Data Copy (D3C). With D3C, users can reconstruct the data as they detect data loss, or even migrate to another DHT system. We show why it scales well against the number of entries on a DHT. We have confirmed our approach with a prototype, Evaluation shows our approach fits. well on a DHT with a low rate of failure and a huge number of data entries.

关键词： distributed hash table data durability traceability system scalability

来源：评论

学校读者我要写书评

暂无评论

Video Resource Multi-attributes Query Based on distributed hash table

引用

JOURNAL OF INTERNET TECHNOLOGY 2009年第4期10卷 339-344页

作者： Zhang Haiyang

Video resource organization mechanism is the foundation of providing high-quality video service in network. The resource organization mechanism based on distributed hash table that provides high scalability and fast query speed is very common currently, but it results in larger query cost and lower speed in multi-attributes query. This paper proposes a hierarchy ring-region resource organization mechanism based on distributed hash table, in which we have adopted a two-layer structure to meet the requirements of multi-attributes query. In the upper layer, because single attribute locating in distributed hash table has time complexity of Log(2)N, and the classified information of video resources is stable, we adopted advanced distributed hash table to organize video resources. In the lower layer, we adopted extend regions to organize video resources flexibly in the resource class according to the detailed description information. Based on this structure, this paper presents a minimum attribute group first multi-attribute query algorithm. The simulation results demonstrate that our algorithm saves 12% average query time complexity than the Keyword Fusion algorithm and 33% than the Inverted hash table algorithm in three attributes query.

关键词： Video resource organization mechanism distributed hash table Multi-attributes query

来源：评论

学校读者我要写书评

暂无评论

A distributed hash table-based approach for providing a file system neutral, robust and resilient storage infrastructure

A distributed hash table-based approach for providing a file...

引用

5th Conference on Next Generation Internet Networks

作者： Parissis, George Apostolopoulos, Theodore Athens Univ Econ & Business Dept Informat Athens Greece

ISBN: (纸本)9781424442447

During the past years, anywhere, anytime access to large and reliable storage has become increasingly important in both enterprise and home computer environments. In this paper we present the design and implementation of a distributed storage infrastructure, which combines the benefits emanating by the usage of a distributed hash table as the core storage layer with the transparency provided by a low level operating system storage interface. The results of the experimental evaluation are very promising.

关键词： distributed hash table structured peer-to-peer networks distributed storage virtual disk driver

来源：评论

学校读者我要写书评

暂无评论

Land House: A Network Storage Structure Combining Regular Graph with distributed hash table and Its Data Accessing Methods

Land House: A Network Storage Structure Combining Regular Gr...

引用

3rd International Symposium on Intelligent Information Technology Application

作者： Wang Jin-Lin Wang Ling-Fang Song Lei IACAS Natl Network New Media Engn Res Ctr Beijing 100190 Peoples R China

ISBN: (纸本)9780769538594

It generally utilized either peer-to-peer overlay network or server clusters to offer wide area network storage service. These network storage systems suffered from performance penalties or single-point failure. This paper proposed a network storage structure which combines regular graph with distributed hash table, and presented corresponding data accessing methods. The results of simulation demonstrated the improvement of the proposal in both accessing delay and searching hops compared to distributed hash table.

关键词： Regular graph distributed hash table Network storage Peterson

来源：评论

学校读者我要写书评

暂无评论

A distributed hash table for Shared Memory 11th

A Distributed Hash Table for Shared Memory

引用

11th International Conference on Parallel Processing and Applied Mathematics (PPAM)

作者： Oortwijn, Wytse van Dijk, Tom van de Pol, Jaco Univ Twente Dept EEMCS Formal Methods & Tools POB 217 NL-7500 AE Enschede Netherlands

ISBN: (纸本)9783319321523;9783319321516

distributed algorithms for graph searching require a high-performance CPU-efficient hash table that supports find-or-put. This operation either inserts data or indicates that it has already been added before. This paper focuses on the design and evaluation of such a hash table, targeting supercomputers. The latency of find-or-put is minimized by using one-sided RDMA operations. These operations are overlapped as much as possible to reduce waiting times for roundtrips. In contrast to existing work, we use linear probing and argue that this requires less roundtrips. The hash table is implemented in UPC. A peak-throughput of 114.9 million op/s is reached on an Infiniband cluster. With a load-factor of 0.9, find-or-put can be performed in 4.5 mu s on average. The hash table performance remains very high, even under high loads.

关键词： distributed hash table High-performance computing Partitioned global address space Remote direct memory access

来源：评论

学校读者我要写书评

暂无评论

Improved Blockchain Commodity Traceability System Using distributed hash table

Improved Blockchain Commodity Traceability System Using Dist...

引用

Chinese Automation Congress (CAC)

作者： Wu Junhui Wu Tuolei Wu Yusheng Chen Jie Lin Kaiyan Si Huiping Tongji Univ Inst Modern Agr Sci & Engn Shanghai Peoples R China Xiamen Tobacco Ind Co Ltd Equipment Management Dept Xiamen Fujian Peoples R China

ISBN: (数字)9781728176871

ISBN: (纸本)9781728176871

The problem of supply chain management erodes trust of consumer and cause huge economic loss. It's essential to track and authenticate every step of supply chain to solve the problem of trust. The traditional centralized storage system has the problem of tamperability so that it can't ensure that data is reliable when consumers query them. Using blocl:chain technology to store data can solve part of trust problems of tracing system. It ensures that stored data is unalterable, that is, the original data cannot be wiped out. This paper designs a traceability system using blockchain technology. According to the characteristics of supply chain, the distributed hash table is used to improve the storage structure, reduce the load of network and nodes, and improve the storage utilization.

关键词： supply chain tracing system blockchain distributed hash table

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：