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

Peer-exchange schemes to handle mismatch in peer-to-peer systems

JOURNAL OF SUPERCOMPUTING 2009年第1期48卷 15-42页

作者： Qiu, Tongqing Chan, Edward Ye, Mao Chen, Guihai Zhao, Ben Y. City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210008 Peoples R China Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of an underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a better logical topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is more efficient, especially in a heterogenous environment where nodes have different processing capabilities.

关键词： Peer-to-peer distributed hash table Mismatch Topology-aware

来源：评论

学校读者我要写书评

暂无评论

Long Term Study of Peer Behavior in the DHT

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2009年第5期17卷 1371-1384页

作者： Steiner, Moritz En-Najjary, Taoufik Biersack, Ernst W. Inst Eurecom F-06904 Sophia Antipolis France

distributed hash tables (DHTs) have been actively studied in literature and many different proposals have been made on how to organize peers in a DHT. However, very few DHTs have been implemented in real systems and deployed on a large scale. One exception is KAD, a DHT based on Kademlia, which is part of eDonkey, a peer-to-peer file sharing system with several million simultaneous users. We have been crawling a representative subset of KAD every five minutes for six months and obtained information about geographical distribution of peers, session times, daily usage, and peer lifetime. We have found that session times are Weibull distributed and we show how this information can be exploited to make the publishing mechanism much more efficient. Peers are identified by the so-called KAD ID, which up to now was assumed to be persistent. However, we observed that a fraction of peers changes their KAD ID as frequently as once a session. This change of KAD IDs makes it difficult to characterize end-user behavior. For this reason we have been crawling the entire KAD network once a day for more than a year to track end-users with static IP addresses, which allows us to estimate end-user lifetime and the fraction of end-users changing their KAD ID.

关键词： distributed hash table distributed systems measurement peer-to-peer

来源：评论

学校读者我要写书评

暂无评论

A proactive low-overhead file replication scheme for structured P2P content delivery networks

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2009年第5期69卷 429-440页

作者： Shen, Haiying Zhu, Yingwu Univ Arkansas Dept Comp Sci & Comp Engn Fayetteville AR 72701 USA Seattle Univ Dept Comp Sci & Software Engn Seattle WA 98122 USA

File replication is a widely used technique for high performance in peer-to-peer content delivery networks. A file replication technique should be efficient and at the same time facilitates efficient file consistency maintenance. However, most traditional methods do not consider nodes' available capacity and physical location in file replication, leading to high overhead for both file replication and consistency maintenance. This paper presents a proactive low-overhead file replication scheme, namely Plover. By making file replicas among physically close nodes based oil nodes' available capacities, Plover not only achieves high efficiency in file replication but also supports low-cost and timely consistency maintenance. It also includes an efficient file query redirection algorithm for load balancing between replica nodes. Theoretical analysis and simulation results demonstrate the effectiveness of Plover in comparison with other file replication schemes. It dramatically reduces the overhead of both file replication and consistency maintenance compared to other schemes. In addition, it yields significant improvements in reduction of overloaded nodes. (C) 2009 Elsevier Inc. All rights reserved.

关键词： File replication Peer-to-peer distributed hash table Content delivery networks

来源：评论

学校读者我要写书评

暂无评论

A P2P-based intelligent resource discovery mechanism in Internet-based distributed systems

引用

JOURNAL OF PARALLEL AND distributed COMPUTING 2009年第2期69卷 197-209页

作者： Shen, Haiying Univ Arkansas Dept Comp Sci & Comp Engn Fayetteville AR 72701 USA

Internet-based distributed systems enable globally-scattered resources to be collectively pooled and used in a cooperative manner to achieve unprecedented petascale supercomputing capabilities. Numerous resource discovery approaches have been proposed to help achieve this goal. To report or discover a multi-attribute resource, most approaches use multiple messages, with one message for each attribute, leading to high overhead of memory Consumption, node communication, and subsequent merging operation. Another approach can report and discover a multi-attribute resource using one query by reducing multi-attribute to a single index, but it is not practically effective in an environment with a large number of different resource attributes. Furthermore, few approaches are able to locate resources geographically close to the requesters, which is critical to system performance. This paper presents a P2P-based intelligent resource discovery (PIRD) mechanism that weaves all attributes into a set of indices using locality sensitive hashing, and then maps the indices to a structured P2P overlay. PIRD can discover resources geographically close to requesters by relying on a hierarchical P2P structure. It significantly reduces overhead and improves search efficiency and effectiveness in resource discovery. It further incorporates the Lempel-Ziv-Welch algorithm to compress attribute information for higher efficiency. Theoretical analysis and simulation results demonstrate the efficiency of PIRD in comparison with other approaches. It dramatically reduces overhead and yields significant improvements on the efficiency of resource discovery. (C) 2008 Elsevier Inc. All rights reserved.

关键词： Resource discovery Internet-based distributed systems Peer-to-peer distributed hash table Grids

来源：评论

学校读者我要写书评

暂无评论

Load distributions of some classic DHTs

引用

Journal of Systems Engineering and Electronics 2009年第2期20卷 400-404页

作者： Nie Xiaowen Lu Xianliang Zhou Xu Tang Hui Li Lin School of Computer Science & Engineering Univ. of Electronic Science and Technology Of ChinaChengdu 610054 P. R. China Inst. of Acoustics Chinese Academy of Sciences Beijing 100080 P. R. China

The load balance is a critical issue of distributed hash table （DHT）, and the previous work shows that there exists O（logn） imbalance of load in Chord. The load distribution of Chord, Pastry, and the virtual servers （VS） balancing scheme and deduces the closed form expressions of the probability density function （PDF） and cumulative distribution function （CDF） of the load in these DHTs is analyzes. The analysis and simulation show that the load of all these DHTs obeys the gamma distribution with similar formed parameters.

关键词： distributed hash table load balance probability density function cumulative distribution function

来源：评论

学校读者我要写书评

暂无评论

A TOKEN-BASED BROADCAST ALGORITHM OVER DHT FOR LARGE-SCALE COMPUTING INFRASTRUCTURES

A TOKEN-BASED BROADCAST ALGORITHM OVER DHT FOR LARGE-SCALE C...

引用

International Conference on Wireless Information Networks and Systems

作者： Huang, Kun Zhang, Dafang Hunan Univ Sch Comp & Commun Changsha 410082 Hunan Peoples R China Hunan Univ Sch Software Changsha 410082 Hunan Peoples R China

ISBN: (纸本)9789896740085

Scalable and efficient broadcast is essential to the large-scale computing infrastructures such as PlanetLab and Grids. By exploiting the greedy routing mechanisms of distributed hash table (DHT), existing DHT-based broadcast algorithms suffer from the limitations of scalability and load balancing, incurring high construction and maintenance overhead for a distributed broadcast tree (DBT). This paper presents a token-based broadcast algorithm over DHT for the large-scale computing infrastructures, where each node selects the finger nodes as its children by a token value in a top-down approach. Theoretical analysis and experimental results show that the token-based broadcast algorithm can construct and maintain a balanced DBT with low overhead, where the branching factors of each node are at most two, and the tree height is O(logn) in a Chord of n nodes, without any extra storage space and explicit maintenance overhead.

关键词： Computing infrastructure Peer-to-Peer network distributed hash table Broadcast Load balancing

来源：评论

学校读者我要写书评

暂无评论

PAIS: A Proximity-aware Interest-clustered P2P File Sharing System 09

PAIS: A Proximity-aware Interest-clustered P2P File Sharing ...

引用

9th IEEE/ACM International Symposium on Cluster Computing and the Grid

作者： Shen, Haiying Univ Arkansas Dept Comp Sci & Comp Engn Fayetteville AR 72701 USA

ISBN: (纸本)9781424439355

Efficient file query is important to the overall performance of Peer-to-Peer (P2P) file sharing systems. Clustering peers by their common interests can significantly enhance the efficiency of file query. On the other hand, clustering peers by their physical proximity can also improve file query performance. Few current works are able to cluster peers based on both peer interest and physical proximity. It is even harder to realize it in structured P2Ps due to their strictly defined topologies, although they provide higher file query efficiency than unstructured P2Ps. In this paper we introduce a proximity-aware and interest-clustered P2P file sharing system (PAIS) based on a structured P2P It groups peers based on both interest and proximity PAIS supports sophisticated routing and clustering strategies based on a hierarchical topology. Theoretical analysis and simulation results demonstrate that PAIS dramatically reduces the overhead and enhances efficiency in file sharing.

关键词： distributed hash table

来源：评论

学校读者我要写书评

暂无评论

distributed Video Streaming Over DHT P2P Overlays

Distributed Video Streaming Over DHT P2P Overlays

引用

1st International Symposium on Computer Network and Multimedia Technology

作者： Leung, Kevin Lee, Ivan Ryerson Univ Toronto ON Canada Univ South Australia Adelaide SA 5001 Australia

ISBN: (纸本)9781424452729

Despite the recent popularity of P2P file sharing strategies, on-demand video streaming have traditionally employed client-server type architectures or else multicast trees as the primary methods to address its difficulties. In this paper, we present DistVid, a protocol that combines the features of multicast trees and structured P2P overlays with the goal of providing a frame work for on-demand video streaming that is both resilient to failure and able to maximize available bandwidth.

关键词： distributed hash table peer-to-peer video streaming

来源：评论

学校读者我要写书评

暂无评论

A distributed Cyber-based Information Distillation and Control Architecture for Wireless Healthcare Systems 1

A Distributed Cyber-based Information Distillation and Contr...

引用

1st ACM International Workshop on Medical-Grade Wireless Networks

作者： Shen, Haiying Li, Ze Yang, Linlin Univ Arkansas Dept Comp Sci & Comp Engn Fayetteville AR 72701 USA

ISBN: (纸本)9781605585246

Cyber-physical space, characterized by the seamless integration of wired and wireless networking technologies, embedded computer systems, sensor and actuator technologies, enable ordinary people to richly interact with their environment. The health-care domain presents many promising applications for cyber-physical space, such as patient information management, real-time emergency reporting, elder living assistance, etc. However, although many component technologies needed for realizing such a health-care based cyber-physical space are available, a robust and effective architecture with novel management protocols implemented which synthesizes these separated components to cooperatively work in a predicted way is missing. In this paper, we propose a distributed, and effective heterogeneous architecture to make up such a gap, emphasizing on patient information retrieval, real-time monitoring and instant reactions.

关键词： Cyber-physical system Wireless sensor networks Information management distributed hash table Health care

来源：评论

学校读者我要写书评

暂无评论

A Global Trust Model of P2P Network Based on Distance-Weighted recommendation

A Global Trust Model of P2P Network Based on Distance-Weight...

引用

IEEE International Conference on Networking, Architecture, and Storage

作者： Li, Xueming Wang, Jianke Chongqing Univ Coll Comp Sci Chongqing 630044 Peoples R China

ISBN: (纸本)9780769537412

We propose a global trust model, which is based on the distance-weighted recommendations under P2P circumstance, with the model's mathematical expressions and realization methods under distributed circumstance, to quantify and evaluate the credibility of peers. The results of the simulation show that our model is more tolerant under comprehensive attacks, and also makes significant improvements on the rate of successful down-loading.

关键词： p2p network trust distributed hash table the distance between peers anonymity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：