P2P-FISM: Mining (recently) frequent item sets from distributed data streams over P2P network

Data intensive large-scale distributed systems like peer-to-peer (P2P) networks are finding large number of applications for social networking, file sharing networks, etc. Global data mining in such P2P environments may be very costly due to the high scale and the asynchronous nature of the P2P networks. The cost further increases in the distributed data stream scenario where peers receive continuous sequence of transactions rapidly. In this paper, we develop an efficient local algorithm, P2P-FISM, for discovering of the network-wide recent frequent itemsets. The algorithm works in a completely asynchronous manner, imposes low communication overhead, a necessity for scalability, transparently tolerates network topology changes, and quickly adapts to changes in the data stream. The paper demonstrates experimental results to corroborate the theoretical claims.     

Design and initial performance of a high-level unstructured mesh framework on heterogeneous parallel systems

OP2 is a high-level domain specific library framework for the solution of unstructured mesh-based applications. It utilizes source-to-source translation and compilation so that a single application code written using the OP2 API can be transformed into multiple parallel implementations for execution on a range of back-end hardware platforms. In this paper we present the design and performance of OP2’s recent developments facilitating code generation and execution on distributed memory heterogeneous systems. OP2 targets the solution of numerical problems based on static unstructured meshes. We discuss the main design issues in parallelizing this class of applications. These include handling data dependencies in accessing indirectly referenced data and design considerations in generating code for execution on a cluster of multi-threaded CPUs and GPUs. Two representative CFD applications, written using the OP2 framework, are utilized to provide a contrasting benchmarking and performance analysis study on a number of heterogeneous systems including a large scale Cray XE6 system and a large GPU cluster. A range of performance metrics are benchmarked including runtime, scalability, achieved compute and bandwidth performance, runtime bottlenecks and systems energy consumption. We demonstrate that an application written once at a high-level using OP2 is easily portable across a wide range of contrasting platforms and is capable of achieving near-optimal performance without the intervention of the domain application programmer.     

Efficient environment management for distributed simulation of large‐scale situated multi‐agent systems

Multi‐agent systems have been proven very effective for the modelling and simulation (M&S) of complex systems like those related to biology, engineering, social sciences and so forth. The intrinsic spatial character of many such systems leads to the definition of a situated agent. A situated agent owns spatial coordinates and acts and interacts with its peers in a hosting territory. In the context of parallel/distributed simulation of situated agent models, the territory represents a huge shared variable that requires careful handling. Frequent access by agents to territory information easily becomes a bottleneck degrading system performance and scalability. This paper proposes an original approach to modelling and distributed simulation of large‐scale situated multi‐agent systems. Time management is exploited for resolving conflicts and achieving data consistency while accessing the environment. The approach allows a simplification of the M&S tasks by making the modeller unaware of distribution concerns while ensuring the achievement of good scalability and performance during the distributed simulation. Practical aspects of the approach are demonstrated through some modelling examples based on Tileworld. Copyright © 2014 John Wiley & Sons, Ltd.     

Helenos: A realistic benchmark for distributed transactional memory

Transactional memory (TM) is an approach to concurrency control that aims to make writing parallel programs both effective and simple. The approach has been initially proposed for nondistributed multiprocessor systems, but it is gaining popularity in distributed systems to synchronize tasks at large scales. Efficiency and scalability are often the key issues in TM research; thus, performance benchmarks are an important part of it. However, while standard TM benchmarks like the Stanford Transactional Applications for Multi‐Processing suite and STMBench7 are available and widely accepted, they do not translate well into distributed systems. Hence, the set of benchmarks usable with distributed TM systems is very limited, and must be padded with microbenchmarks, whose simplicity and artificial nature often makes them uninformative or misleading. Therefore, this paper introduces Helenos, a realistic, complex, and comprehensive distributed TM benchmark based on the problem of the Facebook inbox, an application of the Cassandra distributed store.     

集成P2P模式的网格资源发现算法研究

网格计算和对等计算有很多可以融合的特征。在传统的网格环境中,资源的发现和定位主要用集中式或者分层式来解决,随着网格规模的扩大,这种方式明显不适合网格环境。另一方面,P2P为大规模分布式环境下有效地发现资源提供了可扩展性方案。首先提出了一种集成P2P模式的网格资源管理模型,然后基于该模型提出了一种融合遗传和蚂蚁算法的资源发现算法。理论分析和仿真证明了遗传蚂蚁算法能有效地提高P2PGrid环境下的资源发现性能。     

一种基于DHT的P2P数据存储模型的设计

P2P（peer-to-peer）组织模式已经成为新一代互联网应用的重要形式,它为应用带来了更好的扩展性、容错性和高性能。P2P数据存储模式一直是业界所关注的热点,被认为是P2P最具前途的应用之一。设计了一种基于DHT（DistributedHashTable）路由的结构化P2P网络为架构的分布式数据存储模型,通过应用测试证明该模型能稳定运行。     

A review of distributed architectures for networked virtual reality

The aims of this paper are twofold. First, it identifies the general requirements of future large-scale distributed virtual reality (VR) systems based on an analysis of current VR systems, of more general distributed systems platforms and a consideration of the key issues of scale and heterogeneity. These requirements subsequently inform the development of a general VR reference architecture; and a framework which identifies the key software components which will comprise future distributed VR systems. Second, it uses this reference architecture as a vehicle for conducting a broad review of current distributed VR products and research prototypes. The review covers twelve well known VR systems and intended as a general resource for researchers entering the field. These systems are: AVIARY, BrickNet, DIVE, dVS, MASSIVE, the MR Toolkit, NPSNET, Superscape, VEOS, VUE, WAVES and World Toolkit. The review also identifies relevant standards in the areas of computer graphics and distributed systems. The paper finishes by drawing out a number of more general conclusions from the review including the urgent need to conduct research into the subjects of security and resource discovery for distributed VR systems.     

一种基于P2P机制的网格资源发现方法的研究

传统的网格资源发现系统采用集中式或者层次化的结构,但这些结构不能满足网格系统规模不断扩大的需求。而P2P系统是一种扩展性好的分布式系统,采用已有的P2P技术解决网格环境下的资源发现问题是一种有效的途径。简要介绍了目前采用P2P技术解决网格资源发现的问题,提出了一种采用超级节点模型和资源主动声明机制相结合的资源发现方法,并给出相应的算法描述,最后验证了其有效性。     

云数据管理索引技术研究

数据的爆炸式增长给传统的关系型数据库带来了巨大的挑战,使其在扩展性、容错性等方面遇到了瓶颈.而云计算技术依靠其高扩展性、高可用性、容错性等特点,成为大规模数据管理的有效方案.然而现有的云数据管理系统也存在不足之处,其只能支持基于主键的快速查询,因缺乏索引、视图等机制,所以不能提供高效的多维查询、join等操作,这限制了云计算在很多方面的应用.主要对云数据管理中的索引技术的相关工作进行了深入调研,并作了对比分析,指出了其各自的优点和不足;对在云计算环境下针对海量物联网数据的多维索引技术研究工作进行了简单介绍;最后指出了在云计算环境下针对大数据索引技术的若干挑战性问题.     

P2P持久存储研究

P2P（peer-to-peer）的组织模式已经成为新一代互联网应用的重要形式,它为应用带来了更好的扩展性、容错性和高性能.P2P存储系统一直是研究界所关注的热点,被认为是P2P最具前途的应用之一.数据的持久存储是制约P2P存储系统发展的关键问题,也是其研究的难点.综述了P2P存储系统及数据持久存储相关技术的研究现状.首先概述了P2P存储系统的基本技术组成及其在不同应用环境中的优势,并介绍了数据冗余、数据分发、错误检测和冗余数据维护等多种持久存储的基本技术.在一个P2P存储系统研究框架下,介绍了目前知名的P2P存储系统及其使用的持久存储技术.对各种技术进行了详细综述和对比讨论,分析了各种技术的适应环境及优劣,指出了存在的问题和未来研究的方向.     

网络管理的多agent范型

网络管理系统是大规模的分布式软件系统 ,伸缩性和灵活性是今天的网络管理技术面临的两大难题 .软件 a-gent为这些难题提供了出色的解决方法 .本文首先指出当前网络管理中存在的问题 ;在此基础上 ,提出基于多 agent的网络管理结构 ;为了证明其技术可行性 ,专门建立了基于 agent的网络流量管理实验系统 .对该系统的评估证明了软件agent非常适合于开发分布式网络管理系统 ,具有实时性高、可扩充性好、自治能力强的特点 ,而且与传统系统相比 ,这种系统的建立、修改和升级更加经济     

Distributed real-time embedded systems: Recent advances, future trends and their impact on manufacturing plant control

Real-time and embedded systems have historically been small scale. However, advances in microelectronics and software now allow embedded systems to be composed of a large set of processing elements, and the trend is towards significant enhanced functionality, complexity, and scalability, since those systems are increasingly being connected by wired and wireless networks to create large-scale distributed real-time embedded systems (DRES). Such embedded computing and information technologies have become at the same time an enabler for future manufacturing enterprises as well as a transformer of organizations and markets. This paper discusses opportunities for using recent advances in the DRES area in the deployment of intelligent, adaptive, and reconfigurable manufacturing plant control architectures.     

基于P2P模型的网络入侵检测系统PeerIDS

由于在保护网络信息系统安全方面所起到的越来越重要的作用,入侵检测系统(IDS)近年来一直是一个研究热点。与此同时入侵检测系统的性能问题却没有能得到足够的关注。基于对对等模型(Peer-To-Peer)的应用,论文提出一种分布式网络入侵检测系统-PeerIDS。较之于其他一些常见的分布式入侵检测系统,该系统在设计上注重可靠性而没有诸如单点失效一类的问题。入侵检测工作在由多台运行PeerIDS系统的连网计算机构成的对等网中随具体环境而自动进行迁移以实现公平高效的分布式处理。同时对等模型的应用所带来的可扩展性使得该系统的性能可以通过简单地在网络中增加运行PeerIDS的计算机数目来不断提高,很好地适应了日益严峻的网络安全状况。在完成初始设置后,PeerIDS系统的运行几乎不需要任何使用者的干预,体现了很好的自治性。     

从扩展性角度看区块链

区块链集成密码学、分布式共识、P2P网络和时间戳等技术,可实现数据一致存储、难以窜改和防止抵赖等功能,解决了开放网络中不依赖任何可信第三方的信任问题。去中心化的特性使得区块链具有广阔的应用前景,但随着应用的深入与拓展,扩展性问题已成为挖掘区块链技术潜力的一个关键挑战。区块链本质上仍是分布式系统,基于此,从分布式系统的扩展性角度对区块链的研究工作进行综述,基于链上扩展、链下扩展和跨链扩展三个方面论述了区块链可扩展的思路和方法,总结了近年来的研究成果;通过对现有解决方案的总结分析,探讨了提高区块链可扩展性所面临的问题和未来的研究趋势。     

基于组件的P2P分布实时数据交换体系结构

提出并实现了一种基于组件／XML的P2P分布实时数据交换系统PeXChange,系统使用XML实现面向多接口的通用数据交换,通过多事件通道和主动发现失效结点实现系统负载均衡和容错处理,采用基于角色的访问控制机制以加强系统的安全性和可管理性。PeXChange在设计和实现上采用组件的大粒度对象化没计范型,具有较好的可扩展性、安全性和容错性。广域网络环境下系统运行表明,PeXChange能够以对等模式提供高质量实时数据交换和共享,各Peer结点在异种数据模式映射、系统负载均衡与容错处理等方面能够满足企业级应用需求。     

P2P data replication and trustworthiness for a JXTA-Overlay P2P system using fuzzy logic

P2P systems are very important for future distributed systems and applications. In such systems, the computational burden of the system can be distributed to peer nodes of the system. Therefore, in decentralized systems users become themselves actors by sharing, contributing and controlling the resources of the system. This characteristic makes P2P systems very interesting for the development of decentralized applications. Data replication techniques are commonplace in P2P systems. Data replication means storing copies of the same data at multiple peers thus improving availability and scalability. The trustworthiness of peers also is very important for safe communication in P2P system. The trustworthiness of a peer can be evaluated based on the reputation and actual behaviour of peers to provide services to other peers. In this paper, we propose two fuzzy-based systems for data replication and peer trustworthiness for JXTA-Overlay P2P platform. The simulation results have shown that in the first system, replication factor increases proportionally with increase of number of documents per peer, replication percentage and scale of replication per peer parameters and the second system can be used successfully to select the most reliable peer candidate to execute the tasks.     

基于Power-Law原则的P2P实现

由于Napster,Gnutella和Freenet的巨大成功,端对端技术在搭建分布式应用上吸引工业界和媒体的注意。基于P2P的项目大多要面对一些基本的问题,这包括了安全性、可靠性和路由。但是,由于网络规模的问题,传统的技术并不能直接应用于P2P系统。本文将介绍一种基于Power—Law原则的P2P模型。     

The influence of scale on distributed file system design

The proposition that scale should be recognized as a primary factor influencing the architecture and implementation of distributed systems is validated using Andrew and Coda, two distributed file systems. Performance, operability, and security are dominant considerations in the design of these systems. Availability is a further consideration the design of Coda. Client caching, bulk data transfer, token-based mutual authentication and hierarchical organization of the protection domain have emerged as mechanisms that enhance scalability. The separation of concerns made possible by functional specialization has also proved valuable in scaling. Heterogeneity is an important by-product of growth, but the mechanisms available to cope with it are rudimentary. Physical separation of clients and servers turns out to be a critical requirement for scalability     

Indexing views to route queries in a PDMS

P2P computing gains increasing attention lately, since it provides the means for realizing computing systems that scale to very large numbers of participating peers, while ensuring high autonomy and fault-tolerance. Peer Data Management Systems (PDMS) have been proposed to support sophisticated facilities in exchanging, querying and integrating (semi-)structured data hosted by peers. In this paper, we are interested in routing graph queries in a very large PDMS, where peers advertise their local bases using fragments of community RDF/S schemes (i.e., views). We introduce an original encoding for these fragments, in order to efficiently check whether a peer view is subsumed by a query. We rely on this encoding to design an RDF/S view lookup service featuring a statefull and a stateless execution over a DHT-based P2P infrastructure. We finally evaluate experimentally our system to demonstrate its scalability for very large P2P networks and arbitrary RDF/S schema fragments, and to estimate the number of routing hops required by the two versions of our lookup service. Work done when T. Dalamagas was a postdoc researcher in NTUA.