Scalable peer‐to‐peer networking architecture: DIVINE

This paper describes the issues that are involved in designing and implementing a large‐scale cooperative object database server for a collaborative virtual environment. The focus of the paper is about the way to handle the distributing factors and the communication model among nodes within a collaborative virtual environment. Within the system, all objects are decentralized and scattered among three tiers of object databases. By limiting the knowledge and refining the tasks for each server, the network and processor workload can be reduced. The objective of the system is to provide a virtual environment for distributed computing that is k‐fault tolerant and subject to expansion without the interruption of services. Copyright © 2006 John Wiley & Sons, Ltd.     

Scene-Graph-As-Bus: Collaboration between Heterogeneous Stand-alone 3-D Graphical Applications

We describe the Scene-Graph-As-Bus technique (SGAB), the first step in a staircase of solutions for sharing software components for virtual environments. The goals of SGAB are to allow, with minimal effort, independently-designed applications to share component functionality; and for multiple users to share applications designed for single users.This paper reports on the SGAB design for transparently conjoining different applications by unifying the state information contained in their scene graphs. SGAB monitors and maps changes in the local scene graph of one application to a neutral scene graph representation (NSG), distributes the NSG changes over the network to remote peer applications, and then maps the NSG changes to the local scene graph of the remote application. The fundamental contribution of SGAB is that both the local and remote applications can be completely unaware of each other; that is, both applications can interoperate without code or binary modification despite each having no knowledge of networking or interoperability.     

Interest‐driven avatar neighbor‐organizing for P2P transmission in distributed virtual worlds

The neighbor table/distributed hash table (DHT) is used to choose the data supplier for data‐dispatching services in distributed virtual environments based on peer‐to‐peer networks. It is essential that a stable and efficient neighbor table/DHT be maintained. Because the avatar has much freedom to roam, the spatial distribution of nodes is not uniform, and the logical topology may change dramatically. Therefore, traditional construction mechanisms, such as the neighbor‐discovery mechanism based on spatial distance or DHT, may involve fierce churn in the neighbor table and frequent message exchanges. In this paper, we proposed a dynamic node‐organizing mechanism that aims to solve these challenging problems by applying the avatar's behavioral characteristics to the neighbor maintenance mechanism and scene data transmission. First, we have summarized the common social behaviors of avatars and extracted their characteristics. We then propose an interest‐similarity measuring algorithm to divide the node into diverse clusters. Next, we measure the cluster stability in terms of interest entropy while constructing a stable neighbor mesh for each node in a cluster. We have conducted extensive simulation experiments that simulate avatar behaviors in a popular massively multiplayer online game. The results show that our proposed mechanism achieved a substantial alleviation of neighbor churn and reduced information exchange, which improves the transmission efficiency in distributed virtual environments. Copyright © 2015 John Wiley & Sons, Ltd.     

Integration of manufacturing services into virtual environments over the internet

Virtual reality (VR) is a rapidly developing technology that has a wide spectrum of industrial and commercial applications. Networked (distributed or shared) virtual environments (VE) are of growing interest to modern manufacturing industry; a dominating use of networked virtual manufacturing environments (VMEs) is on-line visualisation and collaborative control of 3D information. This has to be supported by real-time data transfer. To meet a broad range of common requirements for Internet-based VE communications, particularly for virtual manufacturing and collaborative design and control, this paper presents a networked virtual environment system that is designed to support networked virtual design and manufacturing. The system is implemented with manufacturing message specification (MMS) standards so as to integrate a range of manufacturing services into networked VEs over the Internet.     

SetCoLa: High‐Level Constraints for Graph Layout

Constraints enable flexible graph layout by combining the ease of automatic layout with customizations for a particular domain. However, constraint‐based layout often requires many individual constraints defined over specific nodes and node pairs. In addition to the effort of writing and maintaining a large number of similar constraints, such constraints are specific to the particular graph and thus cannot generalize to other graphs in the same domain. To facilitate the specification of customized and generalizable constraint layouts, we contribute SetCoLa: a domain‐specific language for specifying high‐level constraints relative to properties of the backing data. Users identify node sets based on data or graph properties and apply high‐level constraints within each set. Applying constraints to node sets rather than individual nodes reduces specification effort and facilitates reapplication of customized layouts across distinct graphs. We demonstrate the conciseness, generalizability, and expressiveness of SetCoLa on a series of real‐world examples from ecological networks, biological systems, and social networks.     

Realization of reconfigurable virtual environments for virtual testing

1 Introduction The scalability of virtual environments (VEs) that allow users to change and modify their contents and context depending on application requirements has been a de facto feature of virtual reality technology. Engineering uses such as virtual testing and exper- imenting applications demand VEs to be highly or fully reconfigurable. In reality, however, satisfactory reconfiguration of a virtual environment is yet to be achieved, due to the high accuracy of spatial data in- put and…     

一个基于Web的网络虚拟现实系统的设计与实现

虚拟现实技术发展很快,有广泛的工业和商业应用。网络虚拟现实技术已越来越为工业制造业所关注,虚拟制造环境(VME)的一个主要用途是在线可视化和对3D信息的协作控制,这需要实时数据传输的支持。为了满足基于Internet的VE通信需求,特别是为满足虚拟制造和协作设计和控制,该文设计并实现了一个支持网络虚拟设计和制造的网络虚拟现实系统,此系统用MMS协议实现VE通信,并将工业控制服务集成于基于Internet的虚拟环境中。     

Multi‐Modal Perception for Selective Rendering

A major challenge in generating high‐fidelity virtual environments (VEs) is to be able to provide realism at interactive rates. The high‐fidelity simulation of light and sound is still unachievable in real time as such physical accuracy is very computationally demanding. Only recently has visual perception been used in high‐fidelity rendering to improve performance by a series of novel exploitations; to render parts of the scene that are not currently being attended to by the viewer at a much lower quality without the difference being perceived. This paper investigates the effect spatialized directional sound has on the visual attention of a user towards rendered images. These perceptual artefacts are utilized in selective rendering pipelines via the use of multi‐modal maps. The multi‐modal maps are tested through psychophysical experiments to examine their applicability to selective rendering algorithms, with a series of fixed cost rendering functions, and are found to perform significantly better than only using image saliency maps that are naively applied to multi‐modal VEs.     

基于场景语义的3D交互体系结构

借鉴真实世界的认知心理学原理,将虚拟场景的可视表达和语义信息结合起来共同服务于用户的交互过程,多种3D交互技术被融合在一个统一的交互框架内,使复杂虚拟环境中的3D用户界面更容易被用户理解和使用.通过增强场景图的语义处理能力,建立支持高层语义的3D用户界面体系结构,3D交互系统不仅在几何层上而且还能在语义层上支持交互任务的执行.最后介绍了一个应用实例.     

Efficient resource discovery in self‐organized unstructured peer‐to‐peer networks

In unstructured peer‐to‐peer (P2P) networks, two autonomous peer nodes can be connected if users in those nodes are interested in each other's data. Owing to the similarity between P2P networks and social networks, where peer nodes can be regarded as people and connections can be regarded as relationships, social strategies are useful for improving the performance of resource discovery by self‐organizing autonomous peers on unstructured P2P networks. In this paper, we present an efficient social‐like peer‐to‐peer (ESLP) method for resource discovery by mimicking different human behaviours in social networks. ESLP has been simulated in a dynamic environment with a growing number of peer nodes. From the simulation results and analysis, ESLP achieved better performance than current methods. Copyright © 2008 John Wiley & Sons, Ltd.     

TRUST BY ASSOCIATION: A META‐REPUTATION SYSTEM FOR PEER‐TO‐PEER NETWORKS

Trust mechanisms are used in peer‐to‐peer (P2P) networks to help well‐behaving peers find other well‐behaving peers with which to trade. Unfortunately, these trust mechanisms often do little to keep badly behaving peers from entering and taking advantage of the network, which makes the resulting network difficult or impossible to use for legitimate purposes such as e‐commerce. We propose trust by association, a way of tying peers together in invitation‐only P2P networks in such a way as to encourage the removal of badly behaving peers. We use invitations to create a structure within the otherwise ad hoc P2P network. Using this structure, we create a meta‐reputation system where we measure a peer’s trustworthiness not only by its own behavior, but also by the behavior of the peers it has invited to join. The connection created between the peers takes advantage of the external social relationship that must exist before a peer can be invited into the network. The result is a P2P network where, rather than just trying to marginalize badly behaving peers, there is incentive to kick them out of the network. We present results from a simple simulation showing that our approach works well in general when combined with and compared to an existing trust mechanism.     

G‐BLAST: a Grid‐based solution for mpiBLAST on computational Grids

Over the past few years, research and development in bioinformatics (e.g. genomic sequence alignment) has grown with each passing day fueling continuing demands for vast computing power to support better performance. This trend usually requires solutions involving parallel computing techniques because cluster computing technology reduces execution times and increases genomic sequence alignment efficiency. One example, mpiBLAST is a parallel version of NCBI BLAST that combines NCBI BLAST with message passing interface (MPI) standards. However, as most laboratories cannot build up powerful cluster computing environments, Grid computing framework concepts have been designed to meet the need. Grid computing environments coordinate the resources of distributed virtual organizations and satisfy the various computational demands of bioinformatics applications. In this paper, we report on designing and implementing a BioGrid framework, called G‐BLAST, that performs genomic sequence alignments using Grid computing environments and accessible mpiBLAST applications. G‐BLAST is also suitable for cluster computing environments with a server node and several client nodes. G‐BLAST is able to select the most appropriate work nodes, dynamically fragment genomic databases, and self‐adjust according to performance data. To enhance G‐BLAST capability and usability, we also employ a WSRF Grid Service Portal and a Grid Service GUI desk application for general users to submit jobs and host administrators to maintain work nodes. Copyright © 2008 John Wiley & Sons, Ltd.     

Simultaneous remote haptic collaboration for assembling tasks

Stand-alone virtual environments (VEs) using haptic devices have proved useful for assembly/disassembly simulation of mechanical components. Nowadays, collaborative haptic virtual environments (CHVEs) are also emerging. A new peer-to-peer collaborative haptic assembly simulator (CHAS) has been developed whereby two users can simultaneously carry out assembly tasks using haptic devices. Two major challenges have been addressed: virtual scene synchronization (consistency) and the provision of a reliable and effective haptic feedback. A consistency-maintenance scheme has been designed to solve the challenge of achieving consistency. Results show that consistency is guaranteed. Furthermore, a force-smoothing algorithm has been developed which is shown to improve the quality of force feedback under adverse network conditions. A range of laboratory experiments and several real trials between Labein (Spain) and Queen’s University Belfast (Northern Ireland) have verified that CHAS can provide an adequate haptic interaction when both users perform remote assemblies (assembly of one user’s object with an object grasped by the other user). Moreover, when collisions between grasped objects occur (dependent collisions), the haptic feedback usually provides satisfactory haptic perception. Based on a qualitative study, it is shown that the haptic feedback obtained during remote assemblies with dependent collisions can continue to improve the sense of co-presence between users with regard to only visual feedback.     

A database approach for information communication in a peer‐to‐peer collaborative CAD environment

Timely and efficient information communication is a key factor in ensuring successful collaboration in engineering collaborative design. This work proposes a database approach to support information communication between distributed and autonomous CAD systems. It provides the designer with an easy and flexible way, a project‐based propagation meta‐table, to specify what parts of a CAD information model should be communicated to other collaborating designers. A CAD peer manager, containing a peer database that stores information to be exchanged with the other collaborators, wraps each participating CAD system. The peer manager identifies changes made to the CAD model by using stored procedures and active rules in the peer database that are automatically generated based on the propagation meta‐table. The identified updates are propagated in a timely manner to other peers via inter‐database message passing, thereby minimizing the volume of necessary information to be exchanged. Furthermore, remote peer designers can flexibly incorporate, filter, or delete received updates by using a propagation control interface, which is also used to issue user's commands to download the data from the CAD system to the peer database and lookup the received messages in the peer database. The approach is applicable on any CAD system having a CORBA interface and can also be applied to other kinds of object‐oriented interfaces. Copyright © 2007 John Wiley & Sons, Ltd.     

Analysis and design of peer‐assisted video‐on‐demand services

We propose a deterministic fluid model to understand the trade‐offs in the design of peer‐assisted video‐on‐demand (VoD) services. There are three entities in this model: peers (or end users), seeders (altruistic users that own one or several complete video items), and cache servers that store and forward videos with a limited capacity. Peers join the network, download one or multiple concurrent video streams (possibly different video items), and abort the system when they wish. Peers are assumed to cooperate in a BitTorrent‐based fashion, governed by tit‐for‐tat and fair availability. The issue is to minimize the expected downloading times, choosing the set of video items that should be stored in each cache server. We first prove that the deterministic model is globally stable, and find closed expressions for the expected waiting times. Then, we introduce a combinatorial optimization problem (COP), whose nature is similar to the multiknapsack problem (where the items are videos, and knapsacks are related with the storage of cache servers). The problem turns out to be NP‐complete. Therefore, we heuristically address the problem following a GRASP (greedy randomized adaptive search procedure) methodology. Finally, we simulate the new caching methodology with real‐life traces taken from YouTube logs. The results suggest that the peer‐to‐peer philosophy is both stable and cost‐effective for on‐demand streaming purposes.     

结构化P2P覆盖网络的Cayley图构造方法研究

结构化P2P覆盖网络通常都基于某个静态的图结构,而这些静态图又常常是Cayley图或其超图,这些静态图的直径、度等特性可以直接影响到覆盖网络拓扑的路由表大小、路由长度等特性,因此静态图的选择显得非常重要.Cayley图是使用代数群论建立的一类图,它的最大好处是其对称性和点传递性,利用Cayley图的这类性质,可以分析结构化P2P覆盖网络拓扑结构的本质.就几种典型的结构化P2P覆盖网络的静态拓扑,分析了其Cayley图构造方法的本质.     

A comparative study of awareness methods for peer‐to‐peer distributed virtual environments

The increasing popularity of multi‐player online games is leading to the widespread use of large‐scale Distributed Virtual Environments (DVEs) nowadays. In these systems, peer‐to‐peer (P2P) architectures have been proposed as an efficient and scalable solution for supporting massively multi‐player applications. However, the main challenge for P2P architectures consists of providing each avatar with updated information about which other avatars are its neighbors. This problem is known as the awareness problem. In this paper, we propose a comparative study of the performance provided by those awareness methods that are supposed to fully solve the awareness problem. This study is performed using well‐known performance metrics in distributed systems. Moreover, while the evaluations shown in the literature are performed by executing P2P simulations on a single (sequential) computer, this paper evaluates the performance of the considered methods on actually distributed systems. The evaluation results show that only a single method actually provides full awareness to avatars. This method also provides the best performance results. Copyright © 2008 John Wiley & Sons, Ltd.     

A comprehensive peer‐to‐peer characterization model

A peer‐to‐peer (P2P) characterization model is proposed in this paper. The purposes of this model are (a) to describe through abstraction the behavior and capability of P2P computing independent of any specific application, and (b) to lead to a cost model of P2P computing. Our approach is based on abstracting the service driven nature of P2P computing separate and distinct from its implementation. This supports the first purpose. Next, we consider the integration of the two aspects. This supports the second purpose. A secondary contribution of our work is a cost model. The cost model is applied to indexing, discovery and resource utilization services. In addition, the characterization model and cost model are applied to a JXTA‐based P2P application. Copyright © 2006 John Wiley & Sons, Ltd.     

Event‐triggered Control for Cluster Consensus in Multi‐agent Networks

This paper considers the issue of cluster consensus for multiple agents in fixed and undirected networks. Agents in a network are supposed to split into several clusters, and a fraction of the agents in each cluster are pinned by virtual leaders. According to the Lyapunov stability theory and graph theory, some appropriate event‐triggered protocols are developed for consensus of the agents belonging to the same cluster, which can greatly reduce both the number of communication updates and that of control actuation updates. Finally, a numerical example is shown to demonstrate the effectiveness of the proposed theoretical results.     

ExPregel: a new computational model for large‐scale graph processing

These days, large‐scale graph processing becomes more and more important. Pregel, inspired by Bulk Synchronous Parallel, is one of the highly used systems to process large‐scale graph problems. In Pregel, each vertex executes a function and waits for a superstep to communicate its data to other vertices. Superstep is a very time‐consuming operation, used by Pregel, to synchronize distributed computations in a cluster of computers. However, it may become a bottleneck when the number of communications increases in a graph with million vertices. Superstep works like a barrier in Pregel that increases the side effect of skew problem in distributed computing environment. ExPregel is a Pregel‐like model that is designed to reduce the number of communication messages between two vertices resided on two different computational nodes. We have proven that ExPregel reduces the number of exchanged messages as well as the number of supersteps for all graph topologies. Enhancing parallelism in our new computational model is another important feature that manifolds the speed of graph analysis programs. More interestingly, ExPregel uses the same model of programming as Pregel. Our experiments on large‐scale real‐world graphs show that ExPregel can reduce network traffic as well as number of supersteps from 45% to 96%. Runtime speed up in the proposed model varies from 1.2× to 30×. Copyright © 2015 John Wiley & Sons, Ltd.