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.     

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.     

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.     

A resource query interface for network-aware applications

Networked systems provide a cost-effective platform for parallel computing, but the applications have to deal with the changing availability of computation and communication resources. Network-awareness is a recent attempt to bridge the gap between the realities of networks and the demands of applications. Network-aware applications obtain information about their execution environment and dynamically adapt to enhance their performance. Adaptation is especially important for synchronous parallel applications because a single busy communication link can become the bottleneck and degrade overall performance dramatically. This paper presents Remos, a uniform API that allows applications to obtain relevant network information, and reports on the development of parallel applications in this environment. The challenges in defining a uniform interface include network heterogeneity, diversity and variability in network traffic, and resource sharing in the network and even inside an application. The first implementation of the Remos interface uses SNMP to monitor IP-based networks. This paper reports on our methodology for developing adaptive parallel applications for high-speed networks with Remos and presents experimental results using applications generated by the Fx parallelizing compiler. The results highlight the importance and effectiveness of adaptive parallel computing. This revised version was published online in July 2006 with corrections to the Cover Date.     

DyRAM: An Active Reliable Multicast Framework for Data Distribution

Group communications (multicast) are foreseen to be one of the most critical yet challenging technologies to meet the exponentially growing demands for data distribution in a large variety of applications of the Internet (such as grid computing, web applications and distributed simulations). When reliability is required, there is no straightforward solutions and meeting the objectives of reliable multicast is not an easy task. Active networks open a new perspective in providing more efficient solutions for the problem of reliability. In this context, routers are able to perform customized computations on the packets flowing through them. In this paper, we propose a receiver-based (replier) local recovery multicast protocol with dynamic repliers elected on a per-packet basis. Designed to provide an efficient reliable multicast service without any cache facilities inside the network, our approach, uses low-overhead active services in routers. The current paper addresses the design, evaluation and the implementation of an efficient and scalable reliable multicast protocol noted DyRAM standing for Dynamic Replier Active reliable multicast.     

Location Selection for Active Services

Active services are application-specified programs that are executed inside the network. The location where the active service is executed plays an important role. The dynamic behavior of networks requires that the selection of the most suitable location to instantiate a service is done at run time. To dynamically place an active service, information about the network (topology, bandwidth) and the application (type of the service) is necessary. This paper describes a method to dynamically search for available active service locations in the Internet. To be deployed in the current Internet, a solution is required to scale well to large networks, and to demand as little changes to the Internet as possible, especially not at lower network layers. Finally, the solution must be flexible and customizable to take application requirements into account. The proposed solution makes use of the routing path between two end systems. Active service locations that are located close to the routing path are then found via DNS queries. The evaluation shows that the application pays an overhead at start up time. For applications that can tolerate a start up delay, we show with three experiments using a video and an image application that the quality of the application can be increased by a dynamic placement of active services.     

Network slicing to improve multicasting in HPC clusters

In high performance computing (HPC) resources’ extensive experiments are frequently executed. HPC resources (e.g. computing machines and switches) should be able to handle running several experiments in parallel. Typically HPC utilizes parallelization in programs, processing and data. The underlying network is seen as the only non-parallelized HPC component (i.e. no dynamic virtual slicing based on HPC jobs). In this scope we present an approach in this paper to utilize software defined networking (SDN) to parallelize HPC clusters among the different running experiments. We propose to accomplish this through two major components: A passive module (network mapper/remapper) to select for each experiment as soon as it starts the least busy resources in the network, and an SDN-HPC active load balancer to perform more complex and intelligent operations. Active load balancer can logically divide the network based on experiments’ host files. The goal is to reduce traffic to unnecessary hosts or ports. An HPC experiment should multicast, rather than broadcast to only cluster nodes that are used by the experiment. We use virtual tenant network modules in Opendaylight controller to create VLANs based on HPC experiments. In each HPC host, virtual interfaces are created to isolate traffic from the different experiments. The traffic between the different physical hosts that belong to the same experiment can be distinguished based on the VLAN ID assigned to each experiment. We evaluate the new approach using several HPC public benchmarks. Results show a significant enhancement in experiments’ performance especially when HPC cluster experiences running several heavy load experiments simultaneously. Results show also that this multi-casting approach can significantly reduce casting overhead that is caused by using a single cast for all resources in the HPC cluster. In comparison with InfiniBand networks that offer interconnect services with low latency and high bandwidth, HPC services based on SDN can provide two distinguished objectives that may not be possible with InfiniBand: The first objective is the integration of HPC with Ethernet enterprise networks and hence expanding HPC usage to much wider domains. The second objective is the ability to enable users and their applications to customize HPC services with different QoS requirements that fit the different needs of those applications and optimize the usage of HPC clusters.     

Human Initiated Cascading Failures in Societal Infrastructures

In this paper, we conduct a systematic study of human-initiated cascading failures in three critical inter-dependent societal infrastructures due to behavioral adaptations in response to a crisis. We focus on three closely coupled socio-technical networks here: (i) cellular and mesh networks, (ii) transportation networks and (iii) mobile call networks. In crises, changes in individual behaviors lead to altered travel, activity and calling patterns, which influence the transport network and the loads on wireless networks. The interaction between these systems and their co-evolution poses significant technical challenges for representing and reasoning about these systems. In contrast to system dynamics models for studying these interacting infrastructures, we develop interaction-based models in which individuals and infrastructure elements are represented in detail and are placed in a common geographic coordinate system. Using the detailed representation, we study the impact of a chemical plume that has been released in a densely populated urban region. Authorities order evacuation of the affected area, and this leads to individual behavioral adaptation wherein individuals drop their scheduled activities and drive to home or pre-specified evacuation shelters as appropriate. They also revise their calling behavior to communicate and coordinate among family members. These two behavioral adaptations cause flash-congestion in the urban transport network and the wireless network. The problem is exacerbated with a few, already occurring, road closures. We analyze how extended periods of unanticipated road congestion can result in failure of infrastructures, starting with the servicing base stations in the congested area. A sensitivity analysis on the compliance rate of evacuees shows non-intuitive effect on the spatial distribution of people and on the loading of the base stations. For example, an evacuation compliance rate of 70% results in higher number of overloaded base stations than the evacuation compliance rate of 90%.     

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.     

Resource Management for Ad-Hoc Wireless Networks with Cluster Organization

Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. Guaranteeing QoS in this environment is a hard problem because several applications may share the same resources in the network, and mobile ad-hoc wireless networks (MANETs) typically exhibit high variability in network topology and communication quality. In this paper we introduce DYNAMIQUE, a resource management infrastructure for MANETs. We present a resource model for multi-application admission control that optimizes the application admission utility, defined as a combination of the QoS satisfaction ratio. A method based on external adaptation (shrinking QoS for existing applications and later QoS expansion) is introduced as a way to reduce computation complexity by reducing the search space. We designed an application admission protocol that uses a greedy heuristic to improve application utility. For this, the admission control considers network topology information from the routing layer. Specifically, the admission protocol takes benefit from a cluster network organization, as defined by ad-hoc routing protocols such as CBRP and LANMAR. Information on cluster membership and cluster head elections allows the admission protocol to minimize control signaling and to improve application quality by localizing task mapping.     

Finding quasi-optimal network topologies for information transmission in active networks

This work clarifies the relation between network circuit (topology) and behaviour (information transmission and synchronization) in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements) whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.     

Tree diversity alters the structure of a tri‐trophic network in a biodiversity experiment

Species and processes in ecosystems are part of multi‐trophic interaction networks. Plants represent the lowest trophic level in terrestrial ecosystems, and experiments have shown a stabilizing effect of plant diversity on higher trophic levels. Such evidence has been mainly collected in experimental grasslands. Forests are structurally more complex than grasslands and support the majority of the global biodiversity, but studies on multi‐trophic interaction networks are missing in experimental tree diversity gradients. In a forest diversity experiment in southeast China, we examined how tree diversity affects the structure of trophobiotic networks. Trophobioses are tri‐trophic interactions between plants, sap‐sucking Hemiptera and honeydew‐collecting ants that can be subdivided into a largely mutualistic Hemiptera–ant and an antagonistic plant–Hemiptera network. We inspected almost 7000 trees in 146 plots ranging from monocultures to 16 tree species mixtures and found 194 trophobioses consisting of 15 tree, 33 Hemiptera and 18 ant species. We found that tree diversity increased the proportion of trees harboring trophobioses. Consistent with the prediction that mutualistic and antagonistic networks respond differently to changing environments, we found that the generality index of the mutualistic Hemiptera–ant but not the antagonistic plant–Hemiptera network increased with tree diversity. High generality, maintained by high tree diversity, might correspond to higher functional stability. Hence, our results indicate that tree diversity could increase via bottom–up processes the robustness of ant–Hemiptera associations against changing environmental conditions. In turn, the plant–Hemiptera network was highly complementary, suggesting that host‐specific Hemiptera species may be vulnerable to co‐extinction if their host plants disappear. Based on our results, we provide possible future research directions to further disentangle the bottom–up effect of tree diversity on the structure of trophobiotic networks. Synthesis It is now widely accepted that plant diversity promotes ecosystem functionality and stability. However, it is still largely unknown how plant diversity affects interactions between trophic levels and if different interaction types are affected differently. Using a tri‐trophic study system consisting of plants, sap‐sucking Hemiptera, and ants we provide evidence that increasing local plant diversity stabilizes the mutualistic Hemiptera–ant but not the antagonistic plant–Hemiptera networks. Our results suggest that bottom–up effects of plant diversity on trophic interactions might generally depend on the type of interaction (mutualistic versus antagonistic) considered.     

An autonomic routing framework for sensor networks

Current routing services for sensor networks are often designed for specific applications and network conditions, thus have difficulty in adapting to application and network dynamics. This paper proposes an autonomic framework to promote the adaptivity of routing services in sensor networks. The key idea of this framework is to maintain some feature functions that are decoupled from originally-integrated routing services. This separation enables significant service changes to be done by only tuning these functions. Measures including parameterization are taken to save the energy for changing these functions. Further, this framework includes a monitoring module to support a policy-based collaborative adaptation. This paper shows an example autonomic routing service conforming to this framework. Some of this work was done while the author was at ISI     

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.     

A Service Approach for Architecting Application Independent Wireless Sensor Networks

The current sensor networks are assumed to be designed for specific applications, having data communication protocols strongly coupled to applications. The future sensor networks are envisioned as comprising heterogeneous devices assisting to a large range of applications. To achieve this goal, a new architecture approach is needed, having application specific features separated from the data communication protocol, while influencing its behavior. We propose a Web Services approach for the design of sensor network, in which sensor nodes are service providers and applications are clients of such services. Our main goal is to enable a flexible architecture in which sensor networks data can be accessed by users spread all over the world.     

Modularity and anti-modularity in networks with arbitrary degree distribution

Background  

Much work in systems biology, but also in the analysis of social network and communication and transport infrastructure, involves an in-depth analysis of local and global properties of those networks, and how these properties relate to the function of the network within the integrated system. Most often, systematic controls for such networks are difficult to obtain, because the features of the network under study are thought to be germane to that function. In most such cases, a surrogate network that carries any or all of the features under consideration, while created artificially and in the absence of any selective pressure relating to the function of the network being studied, would be of considerable interest.     

Key Message Approach to Optimize Communication of Parallel Applications on Clusters

Over the past few years, cluster/distributed computing has been gaining popularity. The proliferation of the cluster/distributed computing is due to the improved performance and increased reliability of these systems. Many parallel programming languages and related parallel programming models have become widely accepted. However, one of the major shortcomings of running parallel applications on cluster/distributed computing environments is the high communication overhead incurred. To reduce the communication overhead, and thus the completion time of a parallel application, this paper describes a simple, efficient and portable Key Message (KM) approach to support parallel computing on cluster/distributed computing environments. To demonstrate the advantage of the KM approach, a prototype runtime system has been implemented and evaluated. Our preliminary experimental results show that the KM approach has better improvement on communication of a parallel application when network background load increases or the computation to communication ratio of the application decreases.     

Interaction network of vascular epiphytes and trees in a subtropical forest

The commensalistic interaction between vascular epiphytes and host trees is a type of biotic interaction that has been recently analysed with a network approach. This approach is useful to describe the network structure with metrics such as nestedness, specialization and interaction evenness, which can be compared with other vascular epiphyte-host tree networks from different forests of the world. However, in several cases these comparisons showed different and inconsistent patterns between these networks, and their possible ecological and evolutionary determinants have been scarcely studied. In this study, the interactions between vascular epiphytes and host trees of a subtropical forest of sierra de San Javier (Tucuman, Argentina) were analysed with a network approach. We calculated metrics to characterize the network and we analysed factors such as the abundance of species, tree size, tree bark texture, and tree wood density in order to predict interaction frequencies and network structure. The interaction network analysed exhibited a nested structure, an even distribution of interactions, and low specialization, properties shared with other obligated vascular epiphyte-host tree networks with a different assemblage structure. Interaction frequencies were predicted by the abundance of species, tree size and tree bark texture. Species abundance and tree size also predicted nestedness. Abundance indicated that abundant species interact more frequently; and tree size was an important predictor, since larger-diameter trees hosted more vascular epiphyte species than small-diameter trees. This is one of the first studies analyzing interactions between vascular epiphytes and host trees using a network approach in a subtropical forest, and taking the whole vascular epiphyte assemblage of the sampled community into account.     

Multi-Parametric Clustering for Sensor Node Coordination in Cognitive Wireless Sensor Networks

The deployment of wireless sensor networks for healthcare applications have been motivated and driven by the increasing demand for real-time monitoring of patients in hospital and large disaster response environments. A major challenge in developing such sensor networks is the need for coordinating a large number of randomly deployed sensor nodes. In this study, we propose a multi-parametric clustering scheme designed to aid in the coordination of sensor nodes within cognitive wireless sensor networks. In the proposed scheme, sensor nodes are clustered together based on similar network behaviour across multiple network parameters, such as channel availability, interference characteristics, and topological characteristics, followed by mechanisms for forming, joining and switching clusters. Extensive performance evaluation is conducted to study the impact on important factors such as clustering overhead, cluster joining estimation error, interference probability, as well as probability of reclustering. Results show that the proposed clustering scheme can be an excellent candidate for use in large scale cognitive wireless sensor network deployments with high dynamics.     

Collective behavior in relation with changing environments: Dynamics,modularity, and agency

Collective behavior operates without central control, using local interactions among participants to adjust to changing conditions. Many natural systems operate collectively, and by specifying what objectives are met by the system, the idea of agency helps to describe how collective behavior is embedded in the conditions it deals with. Ant colonies function collectively, and the enormous diversity of more than 15K species of ants, in different habitats, provides opportunities to look for general ecological patterns in how collective behavior operates. The foraging behavior of harvester ants in the desert regulates activity to manage water loss, while the trail networks of turtle ants in the canopy tropical forest respond to rapidly changing resources and vegetation. These examples illustrate some broad correspondences in natural systems between the dynamics of collective behavior and the dynamics of the surroundings. To outline how interactions among participants, acting in relation with changing surroundings, achieve collective outcomes, I focus on three aspects of collective behavior: the rate at which interactions adjust to conditions, the feedback regime that stimulates and inhibits activity, and the modularity of the network of interactions. To characterize the dynamics of the surroundings, I consider gradients in stability, energy flow, and the distribution of resources and demands. I then propose some hypotheses that link how collective behavior operates with changing environments.