Adaptive Measurement-Based Policy-Driven QoS Management with Fuzzy-Rule-based Resource Allocation

Fixed and wireless networks are increasingly converging towards common connectivity with IP-based core networks. Providing effective end-to-end resource and QoS management in such complex heterogeneous converged network scenarios requires unified, adaptive and scalable solutions to integrate and co-ordinate diverse QoS mechanisms of different access technologies with IP-based QoS. Policy-Based Network Management (PBNM) is one approach that could be employed to address this challenge. Hence, a policy-based framework for end-to-end QoS management in converged networks, CNQF (Converged Networks QoS Management Framework) has been proposed within our project. In this paper, the CNQF architecture, a Java implementation of its prototype and experimental validation of key elements are discussed. We then present a fuzzy-based CNQF resource management approach and study the performance of our implementation with real traffic flows on an experimental testbed. The results demonstrate the efficacy of our resource-adaptive approach for practical PBNM systems

Switching between molecular switch types by module rearrangement:Ca -enabled, H-driven 'off-on-off', H-driven YES and PASS 0 as well as H, Ca-driven AND logic operations

Several logic gates and switches can be accessed from two different combinations of a single set of fluorophore, receptor and spacer components.

A balanced polymorphism in biomass resource allocation controlled by phosphate in grasses screened through arsenate tolerance

The response of arsenate and non-tolerant Holcus lanatus L. phenotypes, where tolerance is achieved through suppression of high affinity phosphate/arsenate root uptake, was investigated under different growth regimes to investigate why there is a polymorphism in tolerance found in populations growing on uncontaminated soil. Tolerant plants screened from an arsenic uncontaminated population differed, when grown on the soil from the populations origin, from non-tolerants, in their biomass allocation under phosphate fertilization: non-tolerants put more resources into tiller production and down regulated investment in root production under phosphate fertilization while tolerants tillered less effectively and did not alter resource allocation to shoot biomass under phosphate fertilization. The two phenotypes also differed in their shoot mineral status having higher concentrations of copper, cadmium, lead and manganese, but phosphorus status differed little, suggesting tight homeostasis. The polymorphism was also widely present (40%) in other wild grass species suggesting an important ecological role for this gene that can be screened through plant root response to arsenate.

A generalized functional response for predators that switch between multiple prey species

We develop a theory for the food intake of a predator that can switch between multiple prey species. The theory addresses empirical observations of prey switching and is based on the behavioural assumption that a predator tends to continue feeding on prey that are similar to the prey it has consumed last, in terms of, e.g., their morphology, defences, location, habitat choice, or behaviour. From a predator's dietary history and the assumed similarity relationship among prey species, we derive a general closed-form multi-species functional response for describing predators switching between multiple prey species. Our theory includes the Holling type II functional response as a special case and makes consistent predictions when populations of equivalent prey are aggregated or split. An analysis of the derived functional response enables us to highlight the following five main findings. (1) Prey switching leads to an approximate power-law relationship between ratios of prey abundance and prey intake, consistent with experimental data. (2) In agreement with empirical observations, the theory predicts an upper limit of 2 for the exponent of such power laws. (3) Our theory predicts deviations from power-law switching at very low and very high prey-abundance ratios. (4) The theory can predict the diet composition of a predator feeding on multiple prey species from diet observations for predators feeding only on pairs of prey species. (5) Predators foraging on more prey species will show less pronounced prey switching than predators foraging on fewer prey species, thus providing a natural explanation for the known difficulties of observing prey switching in the field. (C) 2013 Elsevier Ltd. All rights reserved.

Channel Time Allocation PSO for Gigabit Multimedia Wireless Networks

This article introduces a resource allocation solution capable of handling mixed media applications within the constraints of a 60 GHz wireless network. The challenges of multimedia wireless transmission include high bandwidth requirements, delay intolerance and wireless channel availability. A new Channel Time Allocation Particle Swarm Optimization (CTA-PSO) is proposed to solve the network utility maximization (NUM) resource allocation problem. CTA-PSO optimizes the time allocated to each device in the network in order to maximize the Quality of Service (QoS) experienced by each user. CTA-PSO introduces network-linked swarm size, an increased diversity function and a learning method based on the personal best, Pbest, results of the swarm. These additional developments to the PSO produce improved convergence speed with respect to Adaptive PSO while maintaining the QoS improvement of the NUM. Specifically, CTA-PSO supports applications described by both convex and non-convex utility functions. The multimedia resource allocation solution presented in this article provides a practical solution for real-time wireless networks.

Power allocation strategies across N orthogonal channels for single-relay networks at both source and relay

We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed over N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing is employed for data communications. Since the power available at the source and relay is limited, we study optimal power allocation strategies at the source and relay in order to maximize the overall source-destination capacity. Depending on the availability of the channel state information at both the source and relay or only at the relay, power allocation is performed at both the source and relay or only at the relay. Considering different setups for the problem, various optimization problems are formulated and solved. Some properties of the optimal solution are also proved.

Secure Transmission with Optimal Power Allocation in Untrusted Relay Networks

We consider the problem of secure transmission in two-hop amplify-and-forward untrusted relay networks. We analyze the ergodic secrecy capacity (ESC) and present compact expressions for the ESC in the high signal-to-noise ratio regime. We also examine the impact of large scale antenna arrays at either the source or the destination. For large antenna arrays at the source, we confirm that the ESC is solely determined by the channel between the relay and the destination. For very large antenna arrays at the destination, we confirm that the ESC is solely determined by the channel between the source and the relay.

Power-Capped DVFS and Thread Allocation with ANN Models on Modern NUMA Systems

Abstract—Power capping is an essential function for efficient power budgeting and cost management on modern server systems. Contemporary server processors operate under power caps by using dynamic voltage and frequency scaling (DVFS). However, these processors are often deployed in non-uniform memory
access (NUMA) architectures, where thread allocation between cores may significantly affect performance and power consumption. This paper proposes a method which maximizes performance under power caps on NUMA systems by dynamically optimizing two knobs: DVFS and thread allocation. The method selects the optimal combination of the two knobs with models based on artificial neural network (ANN) that captures the nonlinear effect of thread allocation on performance. We implement
the proposed method as a runtime system and evaluate it with twelve multithreaded benchmarks on a real AMD Opteron based NUMA system. The evaluation results show that our method outperforms a naive technique optimizing only DVFS by up to
67.1%, under a power cap.