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

作者： Jaroš, M. Brno University of Technology

This work proposes a communication protocol and its reference implementation for an Internet telephony service based on a distributed architecture. The service provides a secure peer to peer voice streaming network be... 详细信息

关键词： Voice over IP distributed hash table audio streaming

来源：评论

学校读者我要写书评

暂无评论

Time-Driven Mesh Overlay Network for Fully distributed Peer-to-Peer Video-on-Demand Services

引用

JOURNAL OF INTERNET TECHNOLOGY 2015年第5期16卷 789-799页

作者： Gui, Yi Qi Choi, Hwang Kyu Yangzhou Univ Dept Comp Sci & Engn Yangzhou Jiangsu Peoples R China Kangwon Natl Univ Dept Comp Sci & Engn Chunchon South Korea

Provisioning video-on-demand (VoD) streaming services in peer to peer environments is a significant challenging task. In this paper, we propose a new Time-Driven Mesh (TDM) overlay network for peer-to-peer video-on-demand systems. In our TDM, all of the peers construct a mesh network connected among them in chronological order of their playback starting times. In order to efficiently search multiple streaming suppliers, we manage the playback starting time and the network location information for all of the peers using a distributed hash table. Our TDM provides both time and space localities while locating suppliers, and the failure peers can be quickly replaced with other suitable peers. As a result, we can construct a bandwidth efficient and robust overlay network for P2P VoD systems. In simulation experiments, we show that our scheme achieves lower startup and jumping latency compared with the existing P2VoD. Our TDM also have better playback continuity under peer random joins and leaves for providing efficient interactive VoD streaming in P2P environment.

关键词： distributed hash table Overlay network Peer-to-peer VoD streaming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

M-DART based Asynchronous File Sharing Scheme in VANET

引用

Procedia Computer Science 2015年 57卷 288-295页

作者： Prabhsharan Kaur Rasmeet S. Bali Arvinder Kaur Department of Computer Science and Engineering Chandigarh University Gharuan Mohali Punjab India Department of Computer Science and Engineering Thapar University Patiala Punjab India

Increasing need for people to remain connected while they are mobile poses several interesting challenges for today's Wireless Networks. Information sharing among vehicles can be considered as one of the most popular medium for exchanging safety and entertainment messages between mobile users. Recently data sharing has also started receiving increased attention from researchers. This paper proposes a distributed hash table based File Sharing Scheme for Vehicular Ad hoc Networks using multipath routing protocol. The scheme guarantees multi-path forwarding due to its underlying property of reactiveness and its application of proactive routing protocol. The packets are transferred to distant nodes with assistance of created distributed hash tables which store information about identities of sender's as well as receiver nodes. By using Multi-path Dynamic Address Routing the algorithm utilizes the best available path until it fails to switch to the next best available route in the network. Simulation results show that the proposed scheme achieves realistic performance of file delivery and also has comparative performance with the existing protocols.

关键词： VANET's File Sharing distributed hash table Multi-path Dynamic Address Routing.

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

mDHT: a multi-level-indexed DHT algorithm to extra-large-scale data retrieval on HDFS/Hadoop architecture

引用

PERSONAL AND UBIQUITOUS COMPUTING 2014年第8期18卷 1835-1844页

作者： Tang, Yu Fan, Aihua Wang, Yingjie Yao, Yuanzhe Univ Elect Sci & Technol China Chengdu 611731 Peoples R China Xian Polytech Univ Xian 710048 Peoples R China

Corresponding to the storing and fast searching needs of an extra-large scale of energy monitoring and statistics data, we propose a multi-level-indexed distributed hash table (mDHT) algorithm and complete a MapReduce implementation of the algorithm on the open-standard HDFS/Hbase platform. Such an approach uses a columnar storage structure for energy consumption data storage and creates a hashed index table to provide a quick search and retrieval method for extra-large-scale data processing systems. Such a hashed indexing scheme is implemented on a 3-node Hadoop cluster, and the simulation experiments at a scale up to 48 million data records indicate that, when the data volume reaches the scale of 12 million to 48 millions, the proposed mDHT algorithm presents an outstanding performance in data writing operation, compared to that of traditional SQL Server implementation. Even compared to the single-indexed DHT (sDHT) application, the mDHT solution outperforms by reducing the data retrieval time by 24.5-48.6 %. The multi-level-indexed DHT algorithm presented in this paper contributes a key technique to developing a fast search engine to the extra-large scale of data on the cloud storage architecture.

关键词： Data retrieval distributed hash table Cloud storage Multi-level index Algorithm

来源：评论

学校读者我要写书评

暂无评论

ISEFF: An ID-Based Scalable and EFficient distributed File Sharing Technique in Vehicular Ad Hoc Networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2014年第2期75卷 821-841页

作者： Ahmadifard, Nasrin Nabizadeh, Hamid Abbaspour, Maghsoud Shahid Beheshti Univ Dept Comp Engn Fac Elect & Comp Engn Tehran Iran

Using new wireless capabilities in vehicles, various applications have appeared in Vehicular Ad Hoc Networks (VANETs). Multimedia data sharing is one of these applications, which has recently been given so much attention. Most of presented schemes in this field have focused on direct opportunistic meetings between vehicles or request/response broadcast in the whole network, which are inefficient and un-scalable due to VANET characteristics. In this paper, we propose an ID-based Scalable and EFficient distributed File sharing technique that increases efficiency and scalability via taking advantages of BitTorrent protocol and consistent hashing technique. The results of simulations show that our approach increases the received file ratio, reduces total download time of files and message overhead. Consequently, it can enhance efficiency and performance.

关键词： Vehicular ad hoc network Data sharing distributed hash table BitTorrent protocol

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of distributed mapping system in ID/locator separation architectures

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2014年第0期39卷 223-232页

作者： Kim, Younghyun Ko, Haneul Pack, Sangheon Lee, Jong-Hyouk Koh, Seok-Joo Jung, Heeyoung Korea Univ Sch Elect Engn Seoul South Korea Sangmyung Univ Dept Comp Software Engn Cheonan South Korea Kyungbuk Natl Univ Coll IT Engn Taegu South Korea ETRI Internet Future Technol Dept Taejon South Korea

An ID/locator separation architecture is one of the most recognized technologies that enable the Future Internet. In ID/locator separation architecture, an ID/locator mapping system is indispensable to provide location management in mobile environments. This paper conducts a comparative study on two different ID/locator mapping approaches: centralized and distributed ID/locator mapping systems. We develop analytical models on the signaling cost incurred in location update and location query procedures of the centralized and distributed ID/locator mapping systems. Numerical results demonstrate that the distributed ID/locator mapping system with enhanced distributed hash table (DHT) has comparable signaling cost to the centralized ID/locator mapping system while providing higher scalability and robustness. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Centralized mapping system distributed mapping system ID/locator separation distributed hash table

来源：评论

学校读者我要写书评

暂无评论

Infrastructure-Free Content-Based Publish/Subscribe

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2014年第5期22卷 1516-1530页

作者： Muthusamy, Vinod Jacobsen, Hans-Arno Univ Toronto Toronto ON M5S 3G4 Canada Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G4 Canada Univ Toronto Dept Comp Sci Toronto ON M5S 3G4 Canada Univ Toronto Middleware Syst Res Grp Toronto ON M5S 3G4 Canada

Peer-to-peer (P2P) networks can offer benefits to distributed content-based publish/subscribe data dissemination systems. In particular, since a P2P network's aggregate resources grow as the number of participants increases, scalability can be achieved using no infrastructure other than the participants' own resources. This paper proposes algorithms for supporting content-based publish/subscribe in which subscriptions can specify a range of interest and publications a range of values. The algorithms are built over a distributed hash table abstraction and are completely decentralized. Load balance is addressed by subscription delegation away from overloaded peers and a bottom-up tree search technique that avoids root hotspots. Furthermore, fault tolerance is achieved with a lightweight replication scheme that quickly detects and recovers from faults. Experimental results support the scalability and fault-tolerance properties of the algorithms: For example, doubling the number of subscriptions does not double internal system messages, and even the simultaneous failure of 20% of the peers in the system requires less than 2 min to fully recover.

关键词： Content-based publish/subscribe DHT distributed hash table P2P peer-to-peer pub/sub

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：