Distributed load adaptive scheduling for throughput and delay guarantees in fading wireless LANs

We consider a problem of providing mean delay and average throughput guarantees in random access fading wireless channels using CSMA/CA algorithm. This problem becomes much more challenging when the scheduling is distributed as is the case in a typical local area wireless network. We model the CSMA network using a novel queueing network based approach. The optimal throughput per device and throughput optimal policy in an M device network is obtained. We provide a simple contention control algorithm that adapts the attempt probability based on the network load and obtain bounds for the packet transmission delay. The information we make use of is the number of devices in the network and the queue length (delayed) at each device. The proposed algorithms stay within the requirements of the IEEE 802.11 standard.

Influence of Spatial Scales on the Performance of Saturated Subsurface Flow and Transport Models

Numerical modeling of saturated subsurface flow and transport has been widely used in the past using different numerical schemes such as finite difference and finite element methods. Such modeling often involves discretization of the problem in spatial and temporal scales. The choice of the spatial and temporal scales for a modeling scenario is often not straightforward. For example, a basin-scale saturated flow and transport analysis demands larger spatial and temporal scales than a meso-scale study, which in turn has larger scales compared to a pore-scale study. The choice of spatial-scale is often dictated by the computational capabilities of the modeler as well as the availability of fine-scale data. In this study, we analyze the impact of different spatial scales and scaling procedures on saturated subsurface flow and transport simulations.

Dynamic properties of sand from dry to fully saturated states

By using bender and extender elements test, the velocities of the primary and shear waves, V(P) and V(s) respectively, were measured for a sandy material by gradually varying the degree of saturation, S(r), between the dry and fully saturated states. The effect on the results of varying the relative density and effective confining pressure was also studied. The measurements clearly reveal that for a certain optimum S(r), which is around 0.7-0.9% for the chosen sand, the value of the shear modulus G reaches a maximum value, whereas the corresponding Poisson's ratio nu attains a minimum value. The values of the shear modulus corresponding to S(r) approximate to 0% and S(r) = 100% tend towards the same value. For values of Skempton's B parameter greater than 0.99, the values of V(P) and nu rise very sharply to those of water. The predictions from Biot's theory with respect to the variation of V(P) with S(r) match well with the measured experimental data.

Aggregate download throughput for TCP-controlled long file transfers in a WLAN with multiple STA-AP association rates

We consider several WLAN stations associated at rates r(1), r(2), ... r(k) with an Access Point. Each station (STA) is downloading a long file from a local server, located on the LAN to which the Access Point (AP) is attached, using TCP. We assume that a TCP ACK will be produced after the reception of d packets at an STA. We model these simultaneous TCP-controlled transfers using a semi-Markov process. Our analytical approach leads to a procedure to compute aggregate download, as well as per-STA throughputs, numerically, and the results match simulations very well. (C) 2012 Elsevier B.V. All rights reserved.

State Dependent Attempt Rate modeling of single cell IEEE 802.11 WLANs with homogeneous nodes and Poisson packet arrivals

We study a State Dependent Attempt Rate (SDAR) approximation to model M queues (one queue per node) served by the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol as standardized in the IEEE 802.11 Distributed Coordination Function (DCF). The approximation is that, when n of the M queues are non-empty, the (transmission) attempt probability of each of the n non-empty nodes is given by the long-term (transmission) attempt probability of n saturated nodes. With the arrival of packets into the M queues according to independent Poisson processes, the SDAR approximation reduces a single cell with non-saturated nodes to a Markovian coupled queueing system. We provide a sufficient condition under which the joint queue length Markov chain is positive recurrent. For the symmetric case of equal arrival rates and finite and equal buffers, we develop an iterative method which leads to accurate predictions for important performance measures such as collision probability, throughput and mean packet delay. We replace the MAC layer with the SDAR model of contention by modifying the NS-2 source code pertaining to the MAC layer, keeping all other layers unchanged. By this model-based simulation technique at the MAC layer, we achieve speed-ups (w.r.t. MAC layer operations) up to 5.4. Through extensive model-based simulations and numerical results, we show that the SDAR model is an accurate model for the DCF MAC protocol in single cells. (C) 2012 Elsevier B.V. All rights reserved.

Large improvements in application throughput of long-running multi-component applications using batch grids

Computational grids with multiple batch systems (batch grids) can be powerful infrastructures for executing long-running multi-component parallel applications. In this paper, we evaluate the potential improvements in throughput of long-running multi-component applications when the different components of the applications are executed on multiple batch systems of batch grids. We compare the multiple batch executions with executions of the components on a single batch system without increasing the number of processors used for executions. We perform our analysis with a foremost long-running multi-component application for climate modeling, the Community Climate System Model (CCSM). We have built a robust simulator that models the characteristics of both the multi-component application and the batch systems. By conducting large number of simulations with different workload characteristics and queuing policies of the systems, processor allocations to components of the application, distributions of the components to the batch systems and inter-cluster bandwidths, we show that multiple batch executions lead to 55% average increase in throughput over single batch executions for long-running CCSM. We also conducted real experiments with a practical middleware infrastructure and showed that multi-site executions lead to effective utilization of batch systems for executions of CCSM and give higher simulation throughput than single-site executions. Copyright (c) 2011 John Wiley & Sons, Ltd.

Analytical model for congestion control and throughput with TCP CUBIC connections

We develop a Markov model for a TCP CUBIC connection. Next we use it to obtain approximate expressions for throughput when there may be queuing in the network. Finally we provide the throughputs different TCP CUBIC and TCP NewReno connections obtain while sharing a channel when they may have different round trip delays and packet loss probabilities.

W/T SPR codes offer higher throughput in OCDMA networks

In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. Two types of random access protocols are proposed for packet transmission. In protocol 1, all distinct codes and in protocol 2, distinct codes as well as shifted versions of all these codes are used. O-CDMA network performance using optical orthogonal codes (OOCs) 1-D and two-dimensional (2-D) wavelength/time single-pulse-per-row (W/T SPR) codes are analyzed. The main advantage of using 2-D codes instead of one-dimensional (1-D) codes is to reduce the errors due to multiple access interference among different users. SPR codes are chosen as they have nearly ideal correlation properties. In this paper, correlation receiver is considered in the analysis. Using analytical model, we compare the OOC and SPR code performances in O-CDMA networks. We compute packet-success probability and throughput for both the types of codes. The analysis shows improved performance with SPR codes as compared to OOC codes.

Molecular structures and antiproliferative activity of side-chain saturated and homologated analogs of 2-chloro-3-(n-alkylamino)-1,4-napthoquinone

Side chain homologated derivatives of 2-chloro-3-(n-alkylamino)-1,4-naphthoquinone {n-alkyl: pentyl; L-5, hexyl; L-6, heptyl; L-7 and octyl; L-8} have been synthesized and characterized by elemental analysis, FT-IR, H-1 NMR, UV-visible spectroscopy and LC-MS. Compounds, L-4, n-alkyl: butyl; L-4}, L-6 and L-8 have been characterized by single crystal X-ray diffraction studies. The single crystal X-ray structures reveal that L-4 and L-8 crystallizes in P2(1) space group, while L-6 in P2(1)/c space group. Molecules of L-4 and L-8 from polymeric chains through C-H center dot center dot center dot O and N-H center dot center dot center dot O close contacts. L-6 is a dimer formed by N-H center dot center dot center dot O interaction. Slipped pi-pi stacking interactions are observed between quinonoid and benzenoid rings of L-4 and L-8. Orientations of alkyl group in L-4 and L-8 is on same side of the chain and polymeric chains run opposite to one another to form zip like structure to the alkyl groups. Antiproliferative activities of L-1 to L-8{n-alkyl: methyl; L-1, ethyl; L-2, propyl; L-3 and butyl; L-4} were studied in cancer cells of colon (COLO205), brain (U87MG) and pancreas (MIAPaCa2) where L-1, L-2 and L-3 were active in MIAPaCa2 (L-1 = 1-2 > L-3) and COLO205 (L-2 = L-3 > L-1) and inactive in U87MG. From antiproliferative studies with compounds L-1 to L-8 it can be concluded that homologation of 2-chloro-3-(n-alkylamino)-1,4-napthoquinone with saturated methyl groups yielded tissue specific compounds such as L-2 (for MIAPaCa2) and L-3 (for COLO205) with optimal activity. (c) 2013 Elsevier B.V. All rights reserved.

Implementation of throughput enhancing client-AP association scheme On a WLAN controller

In a typical enterprise WLAN, a station has a choice of multiple access points to associate with. The default association policy is based on metrics such as Re-ceived Signal Strength(RSS), and “link quality” to choose a particular access point among many. Such an approach can lead to unequal load sharing and diminished system performance. We consider the RAT (Rate And Throughput) policy [1] which leads to better system performance. The RAT policy has been implemented on home-grown centralized WLAN controller, ADWISER [2] and we demonstrate that the RAT policy indeed provides a better system performance.

High Throughput, Low Latency, Memory Optimized 64K Point FFT Architecture using Novel Radix-4 Butterfly Unit

In this paper we propose a fully parallel 64K point radix-4(4) FFT processor. The radix-4(4) parallel unrolled architecture uses a novel radix-4 butterfly unit which takes all four inputs in parallel and can selectively produce one out of the four outputs. The radix-4(4) block can take all 256 inputs in parallel and can use the select control signals to generate one out of the 256 outputs. The resultant 64K point FFT processor shows significant reduction in intermediate memory but with increased hardware complexity. Compared to the state-of-art implementation 5], our architecture shows reduced latency with comparable throughput and area. The 64K point FFT architecture was synthesized using a 130nm CMOS technology which resulted in a throughput of 1.4 GSPS and latency of 47.7 mu s with a maximum clock frequency of 350MHz. When compared to 5], the latency is reduced by 303 mu s with 50.8% reduction in area.

Relation between the Isentropic Index and the Gruneisen Parameter for Saturated Liquids

We investigate the isentropic index along the saturated vapor line as a correlating parameter with quantities both in the saturated liquid phase and the saturated vapor phase. The relation is established via temperatures such as T-hgmax and T* where the saturated vapor enthalpy and the product of saturation temperature and saturated liquid density attain a maximum, respectively. We obtain that the saturated vapor isentropic index is correlated with these temperatures but also with the saturated liquid Gruneisen parameters at T-hgmax. and T*.