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

Management of the Products on Display Shelves Using Advanced Electronic Tags Equipped with Ad Hoc Network Communication Capability

Management of the Products on Display Shelves Using Advanced...

引用

11th Next Generation Teletraffic and Wired/Wireless Advanced Networking (NEW2AN) / 4th Conference on Smart Spaces (ruSMART)

作者： Tanba, Kyohei Kasamatsu, Daisuke Takami, Kazumasa Soka Univ Grad Sch Engn Hachioji Tokyo 1928577 Japan

ISBN: (纸本)9783642228759

Advanced IC tags equipped with ad hoc network communication capability are used for product location management to flexibly deal with frequent changes in product layout on display shelves as is often the case in rental shops. A tag is attached to each product. It manages product and location information. The paper proposes a method in which tags communicate with each other to updating product location information autonomously. It also proposes a method of managing and searching for product information ( identification of the shelf on which a given product is located, and product attributes) held by each tag using a distributed hash table. The proposed methods have been implemented on a MANET emulator, and the performance of the methods, such as the probability of successful location information update, and search time, has been evaluated.

关键词： IC tag ad hoc network communication distributed hash table location management MANET

来源：评论

学校读者我要写书评

暂无评论

Index-Based Search Scheme in Peer-to-Peer Networks

Index-Based Search Scheme in Peer-to-Peer Networks

引用

International Workshop on Computer Science for Environmental Engineering and EcoInformatics (CSEEE)

作者： Bo, Jin Zhao, Juping Shunde Polytech Sci & Technol Dept Foshan 528333 Peoples R China

ISBN: (纸本)9783642226915

Peer-to-Peer (P2P) systems are proposed to provide a decentralized infrastructure for resource sharing. In particular, file sharing was the initial motivation behind many of the pioneering P2P systems. As P2P systems evolve to support sharing of a large amount of data, resource locating issues must be addressed. In this survey, we propose reference architecture for P2P systems that focuses on the data indexing technology required to support resource locating. Based on this reference architecture, we present and classify technologies that have been proposed to solve the data indexing issues particular to resource locating in P2P systems.

关键词： Peer-to-Peer Indexing Search distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Adaptive Load Balancing in KAD

Adaptive Load Balancing in KAD

引用

11th IEEE International Conference on Peer-to-Peer Computing (P2P)

作者： Carra, Damiano Steiner, Moritz Michiardi, Pietro Univ Verona I-37100 Verona Italy Bell Labs New Jersey NJ USA Eurecom Sophia Antipolis France

ISBN: (纸本)9781457701498

The endeavor of this work is to study the impact of content popularity in a large-scale Peer-to-Peer network, namely KAD. Armed with the insights gained from an extensive measurement campaign, which pinpoints several deficiencies of the present KAD design in handling popular objects, we set off to design and evaluate an adaptive load balancing mechanism. Our mechanism is backward compatible with KAD, as it only modifies its inner algorithms, and presents several desirable properties: (i) it drives the process that selects the number and location of peers responsible to store references to objects, based on their popularity;(ii) it solves problems related to saturated peers, that entail a significant drop in the diversity of references to objects, and (iii) if coupled with an enhanced content search procedure, it allows a more fair and efficient usage of peer resources, at a reasonable cost. Our evaluation uses a trace-driven simulator that features realistic peer churn and a precise implementation of the inner components of KAD.

关键词： Accuracy Buildings DHT protocol KAD design KAD peer-to-peer network Load management Peer to peer computing Publishing Routing Search problems adaptive load balancing mechanism distributed hash table peer churn peer content search procedure peer resource peer-to-peer computing protocols resource allocation

来源：评论

学校读者我要写书评

暂无评论

Reconfiguration of Chord ring based on communication delay for lookup performance improvement

Reconfiguration of Chord ring based on communication delay f...

引用

2011 International Conference on Network-Based Information Systems, NBiS 2011

作者： Shimano, Yuta Sato, Fumiaki Department of Information Science Toho University 2-2-1 Miyama Funabashi 274-8510 Japan

ISBN: (纸本)9780769544588

Information lookup systems using distributed hash table (DHT) have been actively studied. In the Chord DHT, nodes are configured as a ring structure and lookup requests are forwarded along with the ring. In order to get information efficiently, response time should be short. However, since Chord overlay network is constructed without considering the real network, the efficient lookup cannot be done. In this paper, we propose a method to reduce the response time by the rearrangement and replacement of the node ID of the Chord. From the simulation results, it is shown that the response time of the proposed method reduced. © 2011 IEEE.

关键词： Chord Delay distributed hash table Fingers IP networks Information lookup Peer to peer computing Peer to peer systems Proposals Routing Time factors chord DHT chord overlay network chord ring communication delay distributed hash table file organisation information lookup system lookup performance improvement lookup request response time ring structure table lookup

来源：评论

学校读者我要写书评

暂无评论

Multi-level Virtual Ring: an Architecture for Content Routing in Wireless Sensor Network

Multi-level Virtual Ring: an Architecture for Content Routin...

引用

Asia-Pacific Conference on Communications

作者： Ming Li Longxiang Gao School of Information Technology Deakin University

ISBN: (纸本)9781457703898

Two main problems prevent the deployment of content delivery in a wireless sensor network: the address, which is widely used in the Internet as the identifier, is meaningless in wireless network, and the routing efficiency is a big concern in wireless sensor network. This paper presents an embedded multi-level ring (MVR) structure to address those two problems. The MVR uses names rather than addresses to identify sensor nodes. The MVR routes packets on the name identifiers without being aware the location. Some sensor nodes are selected as the backbone nodes and are placed on the different levels of the virtual rings. MVR hashes nodes and contents identifiers, and stores them at the backbone nodes. MVR takes the cross-level routing to improve the routing efficiency. Further, MVR is constructed decentralized and runs on the mobile nodes themselves, requiring no central control. Experiments using ns2 simulator for up to 200 nodes show that the storage and bandwidth requirements of MVR grow slowly with the size of the network. Furthermore, MVR has demonstrated as self-administrating, fault-tolerant, and resilient under the different workloads. We also discuss alternative implementation options, and future work.

关键词： Sensor networks Routing distributed hash table

来源：评论

学校读者我要写书评

暂无评论

An Efficient Resource Discovery while Minimizing Maintenance Overhead in SDDS Based Hierarchical DHT Systems

引用

INTERNATIONAL JOURNAL OF GRID AND distributed COMPUTING 2011年第3期4卷 1-23页

作者： Mokadem, Riad Hameurlain, Abdelkader Paul Sabatier Univ IRIT Toulouse France

Using distributed hash tables (DHT) for a resource discovery in large-scale systems generates considerable maintenance overhead which affects the routing efficiency. In this paper, we propose a hierarchical DHT solution based on scalable distributed data structures (SDDS) for an efficient resource discovery in data Grids. Our solution deals with a reduced number of gateway peers running a DHT protocol. Each of them serves also as a proxy for second level peers in a single Virtual Organization (VO), structured as an SDDS. We present a cost analysis for a resource discovery process and discuss its capabilities to reduce both lookup and maintenance costs while minimizing the overhead added to the system. The analysis results proved that an SDDS based hierarchical DHT solution offers good performances especially for intra-VO resource discovery queries. They also provide significant system maintenance saves especially when peers frequently join/leave the system.

关键词： Resource discovery Data Grid Peer to peer system distributed hash table Scalable distributed data structure Super peer models Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

IRM: Integrated File Replication and Consistency Maintenance in P2P Systems

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2010年第1期21卷 100-113页

作者： Shen, Haiying (Helen) Clemson Univ Dept Elect & Comp Engn Clemson SC 29634 USA

In peer-to-peer file sharing systems, file replication and consistency maintenance are widely used techniques for high system performance. Despite significant interdependencies between them, these two issues are typically addressed separately. Most file replication methods rigidly specify replica nodes, leading to low replica utilization, unnecessary replicas and hence extra consistency maintenance overhead. Most consistency maintenance methods propagate update messages based on message spreading or a structure without considering file replication dynamism, leading to inefficient file update and hence high possibility of outdated file response. This paper presents an Integrated file Replication and consistency Maintenance mechanism (IRM) that integrates the two techniques in a systematic and harmonized manner. It achieves high efficiency in file replication and consistency maintenance at a significantly low cost. Instead of passively accepting replicas and updates, each node determines file replication and update polling by dynamically adapting to time-varying file query and update rates, which avoids unnecessary file replications and updates. Simulation results demonstrate the effectiveness of IRM in comparison with other approaches. It dramatically reduces overhead and yields significant improvements on the efficiency of both file replication and consistency maintenance approaches.

关键词： File replication consistency maintenance peer-to-peer distributed hash table

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2010年第6期21卷 827-840页

作者： Shen, Haiying Clemson Univ Holcombe Dept Elect & Comp Engn Clemson SC 29634 USA

In peer-to-peer file sharing systems, file replication technology is widely used to reduce hot spots and improve file query efficiency. Most current file replication methods replicate files in all nodes or two end points on a client-server query path. However, these methods either have low effectiveness or come at a cost of high overhead. File replication in server side enhances replica hit rate, hence, lookup efficiency but produces overloaded nodes and cannot significantly reduce query path length. File replication in client side could greatly reduce query path length, but cannot guarantee high replica hit rate to fully utilize replicas. Though replication along query path solves these problems, it comes at a high cost of overhead due to more replicas and produces underutilized replicas. This paper presents an Efficient and Adaptive Decentralized (EAD) file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost. EAD enhances the utilization of file replicas by selecting query traffic hubs and frequent requesters as replica nodes, and dynamically adapting to nonuniform and time-varying file popularity and node interest. Unlike current methods, EAD creates and deletes replicas in a decentralized self-adaptive manner while guarantees high replica utilization. Theoretical analysis shows the high performance of EAD. Simulation results demonstrate the efficiency and effectiveness of EAD in comparison with other approaches in both static and dynamic environments. It dramatically reduces the overhead of file replication, and yields significant improvements on the efficiency and effectiveness of file replication in terms of query efficiency, replica hit rate, and overloaded nodes reduction.

关键词： Peer-to-peer system distributed hash table file sharing system file replication

来源：评论

学校读者我要写书评

暂无评论

An enhanced reactive Chord for mobile networks

引用

IEICE ELECTRONICS EXPRESS 2010年第10期7卷 711-716页

作者： Kwak, H. K. Yoon, Y. H. Kim, C. G. Chung, K. S. Soongsil Univ Sch Elect Engn Seoul South Korea Namseoul Univ Dept Comp Sci Cheonan Choongnam South Korea

Chord is a peer-to-peer look up algorithm based on a distributed hash table protocol in wired IP networks, exploiting the advantage of scalability for large-scale of distributed applications. However, deploying Chord into mobile networks should be inherently accompanied with supplementary network traffics to maintain the hash key mapping rules because of a high rate of joining and leaving nodes. This paper proposes an enhanced reactive Chord for mobile networks, which can reduce network traffics and achieve fast lookup services. For this purpose, a conventional Chord is modified to act reactively, and then the table activity checking feature is devised into it, called enhanced reactive Chord. Simulation results show that the proposed Chord can decrease network traffics by an average of 41.3% maintaining same setup latency, compared with conventional Chord in mobile networks.

关键词： Chord distributed hash table mobile peer-to-peer reactive table update

来源：评论

学校读者我要写书评

暂无评论

Distributing and searching concept hierarchies: an adaptive DHT-based system

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2010年第3期13卷 257-276页

作者： Asiki, Athanasia Tsoumakos, Dimitrios Koziris, Nectarios Natl Tech Univ Athens Comp Syst Lab Sch Elect & Comp Engn Athens Greece

Concept hierarchies greatly help in the organization and reuse of information and are widely used in a variety of information systems applications. In this paper, we describe a method for efficiently storing and querying data organized into concept hierarchies and dispersed over a DHT. In our method, peers individually decide on the level of indexing according to the granularity of the incoming queries. Roll-up and drill-down operations are performed on a per-node basis in order to minimize the required bandwidth for answering queries on variable aggregation levels. We motivate our approach by applying it on a large-scale Grid system: Specifically, we apply our fully decentralized scheme that creates, queries and updates large volumes of hierarchical data on-line and replace the traditional centralized and strictly indexed information systems. Our extensive experimental results support this argument on many diverse configurations: Our system proves very efficient in skewed workloads, both over single and multiple hierarchy levels at the same time. It adapts to sudden changes in popularity and effectively stores and updates large amounts of data at very low cost.

关键词： distributed hash table Concept hierarchies Adaptive indexing Grid information system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：