VMCast: A VM-Assisted Stability Enhancing Solution for Tree-Based Overlay Multicast

Tree-based overlay multicast is an effective group communication method for media streaming applications. However, a group member’s departure causes all of its descendants to be disconnected from the multicast tree for some time, which results in poor performance. The above problem is difficult to be addressed because overlay multicast tree is intrinsically instable. In this paper, we proposed a novel stability enhancing solution, VMCast, for tree-based overlay multicast. This solution uses two types of on-demand cloud virtual machines (VMs), i.e., multicast VMs (MVMs) and compensation VMs (CVMs). MVMs are used to disseminate the multicast data, whereas CVMs are used to offer streaming compensation. The used VMs in the same cloud datacenter constitute a VM cluster. Each VM cluster is responsible for a service domain (VMSD), and each group member belongs to a specific VMSD. The data source delivers the multicast data to MVMs through a reliable path, and MVMs further disseminate the data to group members along domain overlay multicast trees. The above approach structurally improves the stability of the overlay multicast tree. We further utilized CVM-based streaming compensation to enhance the stability of the data distribution in the VMSDs. VMCast can be used as an extension to existing tree-based overlay multicast solutions, to provide better services for media streaming applications. We applied VMCast to two application instances (i.e., HMTP and HCcast). The results show that it can obviously enhance the stability of the data distribution.     

High-performance reliable network-multicast over a trial deployment

A continuing trend in many scientific disciplines is the growth in the volume of data collected by scientific instruments and the desire to rapidly and efficiently distribute this data to the scientific community. As both the data volume and number of subscribers grows, a reliable network multicast is a promising approach to alleviate the demand for the bandwidth needed to support efficient data distribution to multiple, geographically-distributed, research communities. In prior work, we identified the need for a reliable network multicast: scientists engaged in atmospheric research subscribing to meteorological file-streams. An application called Local Data Manager (LDM) is used to disseminate meteorological data to hundreds of subscribers. This paper presents a high-performance, reliable network multicast solution, Dynamic Reliable File-Stream Multicast Service (DRFSM), and describes a trial deployment comprising eight university campuses connected via Research-and-Education Networks (RENs) and Internet2 and a DRFSM-enabled LDM (LDM7). Using this deployment, we evaluated the DRFSM architecture, which uses network multicast with a reliable transport protocol, and leverages Layer-2 (L2) multipoint Virtual LAN (VLAN/MPLS). A performance monitoring system was developed to collect the real-time performance of LDM7. The measurements showed that our proof-of-concept prototype worked significantly better than the current production LDM (LDM6) in two ways. First, LDM7 distributes data faster than LDM6. With six subscribers and a 100 Mbps bandwidth limit setting, an almost 22-fold improvement in delivery time was observed with LDM7. Second, LDM7 significantly reduces the bandwidth requirement needed to deliver data to subscribers. LDM7 needed 90% less bandwidth than LDM6 to achieve a 20 Mbps average throughput across four subscribers.

     

Object-Oriented Design of QoS Multicast Communications

Multicast (group) communications have been widely recognized by current research and industry. Multicast is very useful for various network applications such as distributed (replicated) database, video/audio conference, information distribution and server locations, etc. But design and implementation of such multicast communication systems in networks are complicated tasks, especially when quality of services (QoS) of applications such as real-time and reliability are desired. To quick design and implement multicast communication, good tools are crucial and must be facilitated. This paper presents a novel object-oriented (O-O) QoS driven approach for the quick design and prototyping of multicast communication systems under certain QoS requirements for multicast message transmission and receptions such as real-time, total ordering, atomicity and fault-tolerance, etc.     

Aggregated Multicast – A Comparative Study

Though IP multicast is resource efficient in delivering data to a group of members simultaneously, it suffers from scalability problem with the number of concurrently active multicast groups because it requires a router to keep forwarding state for every multicast tree passing through it. To solve this state scalability problem, we proposed a scheme, called aggregated multicast. The key idea is that multiple groups are forced to share a single delivery tree. In our earlier work, we introduced the basic concept of aggregated multicast and presented some initial results to show that multicast state can be reduced. In this paper, we develop a more quantitative assessment of the cost/benefit trade-offs. We propose an algorithm to assign multicast groups to delivery trees with controllable cost and introduce metrics to measure multicast state and tree management overhead for multicast schemes. We then compare aggregated multicast with conventional multicast schemes, such as source specific tree scheme and shared tree scheme. Our extensive simulations show that aggregated multicast can achieve significant routing state and tree management overhead reduction while containing the expense of extra resources (bandwidth waste and tunnelling overhead). We conclude that aggregated multicast is a very cost-effective and promising direction for scalable transit domain multicast provisioning.     

Forwarding Group Multicast Protocol (FGMP) for multihop, mobile wireless networks

In this paper we propose a new multicast protocol for multihop mobile wireless networks. Instead of forming multicast trees, a group of nodes in charge of forwarding multicast packets is designated according to members' requests. Multicast is then carried out via “scoped” flooding over such a set of nodes. The forwarding group is periodically refreshed to handle topology/membership changes. Multicast using forwarding group takes advantage of wireless broadcast transmissions and reduces channel and storage overhead, thus improving the performance and scalability. The key innovation with respect to wired multicast schemes like DVMRP is the use of flags rather than upstream/downstream link state, making the protocol more robust to mobility. The dynamic reconfiguration capability makes this protocol particularly suitable for mobile networks. The performance of the proposed scheme is evaluated via simulation and is compared to that of DVMRP and global flooding. This revised version was published online in August 2006 with corrections to the Cover Date.     

Facile Preparation of Nanostructured,Superhydrophobic Filter Paper for Efficient Water/Oil Separation

In this paper, we present a facile and cost-effective method to obtain superhydrophobic filter paper and demonstrate its application for efficient water/oil separation. By coupling structurally distinct organosilane precursors (e.g., octadecyltrichlorosilane and methyltrichlorosilane) to paper fibers under controlled reaction conditions, we have formulated a simple, inexpensive, and efficient protocol to achieve a desirable superhydrophobic and superoleophilic surface on conventional filter paper. The silanized superhydrophobic filter paper showed nanostructured morphology and demonstrated great separation efficiency (up to 99.4%) for water/oil mixtures. The modified filter paper is stable in both aqueous solutions and organic solvents, and can be reused multiple times. The present study shows that our newly developed binary silanization is a promising method of modifying cellulose-based materials for practical applications, in particular the treatment of industrial waste water and ecosystem recovery.     

Quantifying reliability and data deficiency in global vertebrate population trends using the Living Planet Index

Global biodiversity is facing a crisis, which must be solved through effective policies and on-the-ground conservation. But governments, NGOs, and scientists need reliable indicators to guide research, conservation actions, and policy decisions. Developing reliable indicators is challenging because the data underlying those tools is incomplete and biased. For example, the Living Planet Index tracks the changing status of global vertebrate biodiversity, but taxonomic, geographic and temporal gaps and biases are present in the aggregated data used to calculate trends. However, without a basis for real-world comparison, there is no way to directly assess an indicator's accuracy or reliability. Instead, a modelling approach can be used. We developed a model of trend reliability, using simulated datasets as stand-ins for the “real world”, degraded samples as stand-ins for indicator datasets (e.g., the Living Planet Database), and a distance measure to quantify reliability by comparing partially sampled to fully sampled trends. The model revealed that the proportion of species represented in the database is not always indicative of trend reliability. Important factors are the number and length of time series, as well as their mean growth rates and variance in their growth rates, both within and between time series. We found that many trends in the Living Planet Index need more data to be considered reliable, particularly trends across the global south. In general, bird trends are the most reliable, while reptile and amphibian trends are most in need of additional data. We simulated three different solutions for reducing data deficiency, and found that collating existing data (where available) is the most efficient way to improve trend reliability, whereas revisiting previously studied populations is a quick and efficient way to improve trend reliability until new long-term studies can be completed and made available.     

Ants can be used as bio-indicators to reveal biological effects of electromagnetic waves from some wireless apparatus

Society is confronted with an increasing number of applications making use of wireless communication. We also notice an increasing awareness about potentially harmful effects of the related electromagnetic fields on living organisms. At present, it is not realistic to expect that wireless communication will decrease or disappear within the near future. That is why we currently are investigating the mechanisms behind these effects and the effectiveness of possible solutions. In order to be efficient and effective, we designed and validated a fast and easy test on ants – these insects being used as a biological model – for revealing the effect of wireless equipments like mobile phones, smartphones, digital enhanced cordless telephone (DECT) phones, WiFi routers and so on. This test includes quantification of ants’ locomotion under natural conditions, then in the vicinity of such wireless equipments. Observations, numerical results and statistical results allow detecting any effect of a radiating source on these living organisms.     

Efficacy of floor control protocols in distributed multimedia collaboration

Distributed multipoint applications for group interaction across wide-area networks, such as for simulation and telecollaboration, are becoming increasingly popular. While reliable multicasting has made significant advances in recent years, effective mechanisms to synchronize and coordinate work within large multicast groups and across long distances are still lacking. Synchronous sharing of resources, whose operational semantics prohibits parallel usage, typically creates race conditions among users, which can be resolved through an access discipline called floor control. Existing solutions on floor control, implemented either at the session or application layer, are mostly proprietary, limited in scope and not scalable. Furthermore, no performance comparison of floor control protocols has been attempted to date. We present a novel taxonomy and comparative performance analysis of known classes of floor control protocols, ranging from socially mediated control to protocols operating on ring and tree topologies. We find that aggregation and selective transmission of control information in a tree structure is the most promising solution with regard to scalability, efficacy, and robustness. The principal operation of such a tree protocol is outlined, which dynamically organizes participants in a multi-level control tree and aggregates resource sharing directives on the paths between interacting stations. This revised version was published online in July 2006 with corrections to the Cover Date.     

Design and analysis of a distributed grid resource discovery protocol

Computational grids have been emerging as a new paradigm for solving large complex problems over the recent years. The problem space and data set are divided into smaller pieces that are processed in parallel over the grid network and reassembled upon completion. Typically, resources are logged into a resource broker that is somewhat aware of all of the participants available on the grid. The resource broker scheme can be a bottleneck because of the amount of computational power and network bandwidth needed to maintain a fresh view of the grid. In this paper, we propose to place the load of managing the network resource discovery on to the network itself: inside of the routers. In the proposed protocol, the routers contain tables for resources similar to routing tables. These resource tables map IP addresses to the available computing resource values, which are provided through a scoring mechanism. Each resource provider is scored based on the attributes they provide such as the number of processors, processor frequency, amount of memory, hard drive space, and the network bandwidth. The resources are discovered on the grid by the protocol’s discovery packets, which are encapsulated within the TCP/IP packets. The discovery packet visits the routers and look up in the resource tables until a satisfactory resource is found. The protocol is validated by simulations with five different deployment environments.     

One-Sided Communication on Clusters with Myrinet

This paper describes an efficient implementation of one-sided communication on top of the GM low-level message-passing library for clusters with Myrinet. This approach is compatible with shared memory, exploits pipelining, nonblocking communication, and overlapping memory registration with memory copy to maximize the transfer rate. The paper addresses critical design issues faced on the commodity clusters and then describes possible solutions for matching the low-level network protocol with user-level interfaces. The performance implications of the design decisions are presented and discussed in context of a standalone communication benchmark as well as two applications. Finally, the paper offers some indications on what additional features would be desirable in a communication library like GM to better support one-sided communication.     

An Efficient Next Hop Selection Algorithm for Multi-Hop Body Area Networks

Body Area Networks (BANs) consist of various sensors which gather patient’s vital signs and deliver them to doctors. One of the most significant challenges faced, is the design of an energy-efficient next hop selection algorithm to satisfy Quality of Service (QoS) requirements for different healthcare applications. In this paper, a novel efficient next hop selection algorithm is proposed in multi-hop BANs. This algorithm uses the minimum hop count and a link cost function jointly in each node to choose the best next hop node. The link cost function includes the residual energy, free buffer size, and the link reliability of the neighboring nodes, which is used to balance the energy consumption and to satisfy QoS requirements in terms of end to end delay and reliability. Extensive simulation experiments were performed to evaluate the efficiency of the proposed algorithm using the NS-2 simulator. Simulation results show that our proposed algorithm provides significant improvement in terms of energy consumption, number of packets forwarded, end to end delay and packet delivery ratio compared to the existing routing protocol.     

Reproducible and controllable light induction of in vitro fruiting of the white-rot basidiomycete Pleurotus ostreatus

Fruiting is a crucial developmental process in basidiomycetes yet the genetic and molecular factors that control it are not yet fully understood. The search for fruiting inducers is of major relevance for both basic research and for their use in industrial applications. In this paper, an efficient and reproducible protocol for controlled fruiting induction of Pleurotus ostreatus growing on synthetic medium is described. The protocol is based on the control of light intensity and photoperiod and permits the life cycle for this fungus to be completed in less than two weeks. The fruiting bodies produced by this method release fertile spores after 4-5 d of culture. Our results indicate that fruiting induction is solely dependent on the illumination regime and that it occurs long before the available nutrients are depleted in the culture. This protocol will greatly facilitate molecular and developmental biology research in this fungus as it avoids the need for complex culture media based on lignocellulosic materials or the use of chemical inducers.     

AIB-OR: Improving Onion Routing Circuit Construction Using Anonymous Identity-Based Cryptosystems

The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet.     

Group communication support for distributed collaboration systems

The Collaborative Computing Transport Layer (CCTL) is a communication substrate consisting of a suite of group communication protocols. The design of CCTL supports the needs of distributed collaborative applications. CCTL is based on a two-level group hierarchy that naturally matches the structure of many collaborative applications and that allows several implementation optimizations. Logical interconnections among processes, called channels, define an efficient, light-weight group mechanism, providing a variety of communication services such as reliability and message ordering. Related channels are associated with a heavy-weight group, called a session, that provides group management services, such as membership, for its associated channels. Sessions and channels run different protocol stacks, allowing a flexible and useful separation of group management semantics and communication service quality. This also allows the efficient reuse of existing group management services when introducing new communication services. This revised version was published online in July 2006 with corrections to the Cover Date.     

A Rapid and Simple PCR-based Method for Analysis of Transgenic Fish using a Restricted Amount of Fin Tissue

The protocol described in this paper offers a simple and rapid method for PCR analysis of transgenes using a restricted amount of fin tissue from small-sized transgenic fish. A simple preparation of fin lysate using a buffer containing a low concentration of an ionic detergent, SDS (0.01%), followed by neutralization with a second buffer containing higher concentrations of non-ionic detergents NP40 (2%) and Tween 20 (2%) consistently provides a reliable quantity of high-quality DNA template for PCR amplification of transgenes. Based on this protocol, transgenic fish can be clearly distinguished from non-transgenic fish using PCR in a rapid and reproducible manner. Tedious DNA purifications are avoided while fidelity of amplification and efficient identification of transgenic fish are maintained.     

Studying vertical dependence to improve NFS performance in wireless networks

Wireless networks experience a high level of errors and losses. These physical layer characteristics have an impact on the performance of the higher layers. In addition, the performance of each protocol layer is contingent on the behavior of the other layers. Vertical dependency is a term which describes this inter-dependence between layers. In the wireless and mobile environment, the effects of vertical dependence are particularly pronounced due to the dynamic nature of the environment and due to the fact that traditional assumptions about protocol layer interactions do not always hold. In this paper, we consider the vertical dependencies between various layers in the protocol stack, studying the performance of the Network File System under various error models and improvement techniques. Our experimental results demonstrate the dependency of the application performance on the details of the error characteristics and other protocol layers. After studying the vertical dependencies, we improve NFS performance by implementing changes to the application level reliability mechanisms. Understanding of the vertical dependencies enables development of effective methods for performance enhancement and efficient reaction to errors and changes on the wireless media. This revised version was published online in August 2006 with corrections to the Cover Date.     

An effective reliability-driven technique of allocating tasks on heterogeneous cluster systems

In large-scale heterogeneous cluster computing systems, processor and network failures are inevitable and can have an adverse effect on applications executing on such systems. One way of taking failures into account is to employ a reliable scheduling algorithm. However, most existing scheduling algorithms for precedence constrained tasks in heterogeneous systems only consider scheduling length, and not efficiently satisfy the reliability requirements of task. In recognition of this problem, we build an application reliability analysis model based on Weibull distribution, which can dynamically measure the reliability of task executing on heterogeneous cluster with arbitrary networks architectures. Then, we propose a reliability-driven earliest finish time with duplication scheduling algorithm (REFTD) which incorporates task reliability overhead into scheduling. Furthermore, to improve system reliability, it duplicates task as if task hazard rate is more than threshold \(\theta \) . The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm can shorten schedule length and improve system reliability significantly.     

LD-SPatt: large deviations statistics for patterns on Markov chains.

Statistics on Markov chains are widely used for the study of patterns in biological sequences. Statistics on these models can be done through several approaches. Central limit theorem (CLT) producing Gaussian approximations are one of the most popular ones. Unfortunately, in order to find a pattern of interest, these methods have to deal with tail distribution events where CLT is especially bad. In this paper, we propose a new approach based on the large deviations theory to assess pattern statistics. We first recall theoretical results for empiric mean (level 1) as well as empiric distribution (level 2) large deviations on Markov chains. Then, we present the applications of these results focusing on numerical issues. LD-SPatt is the name of GPL software implementing these algorithms. We compare this approach to several existing ones in terms of complexity and reliability and show that the large deviations are more reliable than the Gaussian approximations in absolute values as well as in terms of ranking and are at least as reliable as compound Poisson approximations. We then finally discuss some further possible improvements and applications of this new method.     

An Active Self-Optimizing Multiplayer Gaming Architecture

Multiplayer games are representative of a large class of distributed applications that suffer from redundant communication, bottlenecks, single points of failure and poor reactivity to changing network conditions. Many of these problems can be alleviated through simple network adaptations at the infrastructure level. In this paper, we describe a model in which game packets are directed along the edges of a rooted tree connecting the players, aggregated during the upstream flight and multicast from the root to the leaves. This tree is constructed based on a heuristic, and can dynamically adjust itself in response to changes in network conditions. This gaming infrastructure is built and maintained using active networks, which is currently the only open architecture suitable for these types of applications. We have designed and implemented a prototype using ANTS that performs these adaptations for unmodified DOOM clients. We present analytical and simulation results that illustrate the reduction in communication overhead, and show that the multicast tree can quickly adjust to changing network conditions. The overhead of the active network-based middleware is acceptable, especially in wide-area networks.