A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

Green Falcon IV: An Unmanned Aerial System and an integrated Wireless Sensor Network for remote sensing tasks

This report summarises the development of an Unmanned Aerial System and an integrated Wireless Sensor Network (WSN), suitable for the real world application in remote sensing tasks. Several aspects are discussed and analysed to provide improvements in flight duration, performance and mobility of the UAV, while ensuring the accuracy and range of data from the wireless sensor system.

Computing TCP Throughput in a UMTS Network

We compute the throughput obtained by a TCP connection in a UMTS environment. For downloading data at a mobile terminal, the packets of each TCP connection are stored in separate queues at the base station (node B). Also due to fragmentation of the TCP packets into Protocol Data Units (PDU) and link layer retransmissions of PDUs there can be significant delays at the queue of the node B. In such a scenario the existing models of TCP may not be sufficient. Thus, we provide a new approximate TCP model and also obtain new closed-form expressions of mean window size. Using these we obtain the throughput of a TCP connection which matches with simulations quite well.

Electron-electron interaction in percolative network of polymer-amorphous carbon composites

The polymer-amorphous carbon composites show a negative magnetoconductance which varies as B-2 at low fields which changes to B-1/2 at sufficiently high fields. The magnetoconductance gives the evidence of electron-electron interaction in composites whose conductivity follows thermal fluctuation induced tunneling and falls in the critical regime. (c) 2006 Elsevier B.V. All rights reserved.

Heritability of the network architecture of intrinsic brain functional connectivity

The brain's functional network exhibits many features facilitating functional specialization, integration, and robustness to attack. Using graph theory to characterize brain networks, studies demonstrate their small-world, modular, and "rich-club" properties, with deviations reported in many common neuropathological conditions. Here we estimate the heritability of five widely used graph theoretical metrics (mean clustering coefficient (γ), modularity (Q), rich-club coefficient (ϕnorm), global efficiency (λ), small-worldness (σ)) over a range of connection densities (k=5-25%) in a large cohort of twins (N=592, 84 MZ and 89 DZ twin pairs, 246 single twins, age 23±2.5). We also considered the effects of global signal regression (GSR). We found that the graph metrics were moderately influenced by genetic factors h2 (γ=47-59%, Q=38-59%, ϕnorm=0-29%, λ=52-64%, σ=51-59%) at lower connection densities (≤15%), and when global signal regression was implemented, heritability estimates decreased substantially h2 (γ=0-26%, Q=0-28%, ϕnorm=0%, λ=23-30%, σ=0-27%). Distinct network features were phenotypically correlated (|r|=0.15-0.81), and γ, Q, and λ were found to be influenced by overlapping genetic factors. Our findings suggest that these metrics may be potential endophenotypes for psychiatric disease and suitable for genetic association studies, but that genetic effects must be interpreted with respect to methodological choices.

Heritability of brain network topology in 853 twins and siblings

Anatomical brain networks change throughout life and with diseases. Genetic analysis of these networks may help identify processes giving rise to heritable brain disorders, but we do not yet know which network measures are promising for genetic analyses. Many factors affect the downstream results, such as the tractography algorithm used to define structural connectivity. We tested nine different tractography algorithms and four normalization methods to compute brain networks for 853 young healthy adults (twins and their siblings). We fitted genetic structural equation models to all nine network measures, after a normalization step to increase network consistency across tractography algorithms. Probabilistic tractography algorithms with global optimization (such as Probtrackx and Hough) yielded higher heritability statistics than 'greedy' algorithms (such as FACT) which process small neighborhoods at each step. Some global network measures (probtrackx-derived GLOB and ST) showed significant genetic effects, making them attractive targets for genome-wide association studies.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

Journalism, media & communication network: Final report 2015

The JoMeC Network project had three key objectives. These were to: 1. Benchmark the pedagogical elements of journalism, media and communication (JoMeC) programs at Australian universities in order to develop a set of minimum academic standards, to be known as Threshold Learning Outcomes (TLOs), which would applicable to the disciplines of Journalism, Communication and/or Media Studies, and Public Relations; 2. Build a learning and teaching network of scholars across the JoMeC disciplines to support collaboration, develop leadership potential among educators, and progress shared priorities; 3. Create an online resources hub to support learning and teaching excellence and foster leadership in learning and teaching in the JoMeC disciplines. In order to benchmark the pedagogical elements of the JoMeC disciplines, the project started with a comprehensive review of the disciplinary settings of journalism, media and communication-related programs within Higher Education in Australia plus an analysis of capstone units (or subjects) offered in JoMeC-related degrees. This audit revealed a diversity of degree titles, disciplinary foci, projected career outcomes and pedagogical styles in the 36 universities that offered JoMeC-related degrees in 2012, highlighting the difficulties of classifying the JoMeC disciplines collectively or singularly. Instead of attempting to map all disciplines related to journalism, media and communication, the project team opted to create generalised TLOs for these fields, coupled with detailed TLOs for bachelor-level qualifications in three selected JoMeC disciplines: Journalism, Communication and/or Media Studies, and Public Relations. The initial review’s outcomes shaped the methodology that was used to develop the TLOs. Given the complexity of the JoMeC disciplines and the diversity of degrees across the network, the project team deployed an issue-framing process to create TLO statements. This involved several phases, including discussions with an issue-framing team (an advisory group of representatives from different disciplinary areas); research into accreditation requirements and industry-produced materials about employment expectations; evaluation of learning outcomes from universities across Australia; reviews of scholarly literature; as well as input from disciplinary leaders in a variety of forms. Draft TLOs were refined after further consultation with industry stakeholders and the academic community via email, telephone interviews, and meetings and public forums at conferences. This process was used to create a set of common TLOs for JoMeC disciplines in general and extended TLO statements for the specific disciplines of Journalism and Public Relations. A TLO statement for Communication and/or Media Studies remains in draft form. The Australian and New Zealand Communication Association (ANZCA) and Journalism Education and Research Association of Australian (JERAA) have agreed to host meetings to review, revise and further develop the TLOs. The aim is to support the JoMeC Network’s sustainability and the TLOs’ future development and use.

Electrical switching and thermal studies on Ge22Te78-xIx chalcohalide glasses: The effect of iodine on network-topology

Investigations on the electrical switching behavior and thermal studies using Alternating Differential Scanning Calorimetry have been undertaken on bulk, melt-quenched Ge22Te78-,Is (3 <= x <= 10) chalcohalide glasses. All the glasses studied have been found to exhibit memory-type electrical switching. The threshold voltages of Ge22Te78-I-x(x) glasses have been found to increase with the addition of iodine and the composition dependence of threshold voltages of Ge22Te78-xIx glasses exhibits a cusp at 5 at.% of iodine. Also, the variation with composition of the glass transition temperature (Tg) of Ge22Te78-I-x(x) glasses, exhibits a broad hump around this composition. Based on the present results, the composition x = 5 has been identified as the inverse rigidity percolation threshold at which Ge22Te78-I-x(x) glassy system exhibits a change from a stressed rigid amorphous solid to a flexible polymeric glass. Further, a sharp minimum is seen in the composition dependence of non-reversing enthalpy (Delta H-nr) of Ge22Te78-I-x(x) glasses at x = 5, which is suggestive of a thermally reversing window at this composition. (C) 2007 Elsevier Ltd. All rights reserved.

Enhancing sensor network lifetime using interactive communication

We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message interactive communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message interactive communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.

System-level analysis of network interfaces for hierarchical MPSoCs

Network Interfaces (NIs) are used in Multiprocessor System-on-Chips (MPSoCs) to connect CPUs to a packet switched Network-on-Chip. In this work we introduce a new NI architecture for our hierarchical CoreVA-MPSoC. The CoreVA-MPSoC targets streaming applications in embedded systems. The main contribution of this paper is a system-level analysis of different NI configurations, considering both software and hardware costs for NoC communication. Different configurations of the NI are compared using a benchmark suite of 10 streaming applications. The best performing NI configuration shows an average speedup of 20 for a CoreVA-MPSoC with 32 CPUs compared to a single CPU. Furthermore, we present physical implementation results using a 28 nm FD-SOI standard cell technology. A hierarchical MPSoC with 8 CPU clusters and 4 CPUs in each cluster running at 800MHz requires an area of 4.56mm2.

High pressure studies on the electrical resistivity of As-Te-bond Si glasses and the effect of network topological thresholds

The variation of resistivity in an amorphous As30Te70-xSix system of glasses with high pressure has been studied for pressures up to 8 GPa. It is found that the electrical resistivity and the conduction activation energy decrease continuously with increase in pressure, and samples become metallic in the pressure range 1.0-2.0 GPa. Temperature variation studies carried out at a pressure of 0.92 GPa show that the activation energies lie in the range 0.16-0.18eV. Studies on the composition/average co-ordination number (r) dependence of normalized electrical resistivity at different pressures indicate that rigidity percolation is extended, the onset of the intermediate phase is around (r) = 2.44, and completion at (r) = 2.56, respectively, while the chemical threshold is at (r) = 2.67. These results compare favorably with those obtained from electrical switching and differential scanning calorimetric studies.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.