A Proof of Convergence of the B-RED and P-RED Algorithms for Random Early Detection

In [8], we recently presented two computationally efficient algorithms named B-RED and P-RED for random early detection. In this letter, we present the mathematical proof of convergence of these algorithms under general conditions to local minima.

Performance analysis of the random early detection algorithm

In this article we consider a finite queue with its arrivals controlled by the random early detection algorithm. This is one of the most prominent congestion avoidance schemes in the Internet routers. The aggregate arrival stream from the population of transmission control protocol sources is locally considered stationary renewal or Markov modulated Poisson process with general packet length distribution. We study the exact dynamics of this queue and provide the stability and the rates of convergence to the stationary distribution and obtain the packet loss probability and the waiting time distribution. Then we extend these results to a two traffic class case with each arrival stream renewal. However, computing the performance indices for this system becomes computationally prohibitive. Thus, in the latter half of the article, we approximate the dynamics of the average queue length process asymptotically via an ordinary differential equation. We estimate the error term via a diffusion approximation. We use these results to obtain approximate transient and stationary performance of the system. Finally, we provide some computational examples to show the accuracy of these approximations.

Employing denaturation for rapid electrochemical detection of myoglobin using TiO2 nanotubes

An alternative antibody-free strategy for the rapid electrochemical detection of cardiac myoglobin has been demonstrated here using hydrothermally synthesized TiO2 nanotubes (Ti-NT). The denaturant induced unfolding of myoglobin led to easy access of the deeply buried electroactive heme center and thus the efficient reversible electron transfer from protein to electrode surface. The sensing performance of the Ti-NT modified electrodes were compared vis a vis commercially available titania and GCEs. The tubular morphology of the Ti-NT led to facile transfer of electrons to the electrode surface, which eventually provided a linear current response (obtained from cyclic voltammetry) over a wide range of Mb concentration. The sensitivity of the Ti-NT based sensor was remarkable and was equal to 18 mu A mg(-1) ml (detection limit = 50 nM). This coupled with the rapid analysis time of a few tens of minutes (compared to a few days for ELISA) demonstrates its potential usefulness for the early detection of acute myocardial infarction (AMI).

Lesion Detection in Breast Ultrasound Images Using Tissue Transition Analysis

Breast cancer is one of the leading cause of cancer related deaths in women and early detection is crucial for reducing mortality rates. In this paper, we present a novel and fully automated approach based on tissue transition analysis for lesion detection in breast ultrasound images. Every candidate pixel is classified as belonging to the lesion boundary, lesion interior or normal tissue based on its descriptor value. The tissue transitions are modeled using a Markov chain to estimate the likelihood of a candidate lesion region. Experimental evaluation on a clinical dataset of 135 images show that the proposed approach can achieve high sensitivity (95 %) with modest (3) false positives per image. The approach achieves very similar results (94 % for 3 false positives) on a completely different clinical dataset of 159 images without retraining, highlighting the robustness of the approach.

A probabilistic constrained nonlinear optimization framework to optimize RED parameters

The random early detection (RED) technique has seen a lot of research over the years. However, the functional relationship between RED performance and its parameters viz,, queue weight (omega(q)), marking probability (max(p)), minimum threshold (min(th)) and maximum threshold (max(th)) is not analytically availa ble. In this paper, we formulate a probabilistic constrained optimization problem by assuming a nonlinear relationship between the RED average queue length and its parameters. This problem involves all the RED parameters as the variables of the optimization problem. We use the barrier and the penalty function approaches for its Solution. However (as above), the exact functional relationship between the barrier and penalty objective functions and the optimization variable is not known, but noisy samples of these are available for different parameter values. Thus, for obtaining the gradient and Hessian of the objective, we use certain recently developed simultaneous perturbation stochastic approximation (SPSA) based estimates of these. We propose two four-timescale stochastic approximation algorithms based oil certain modified second-order SPSA updates for finding the optimum RED parameters. We present the results of detailed simulation experiments conducted over different network topologies and network/traffic conditions/settings, comparing the performance of Our algorithms with variants of RED and a few other well known adaptive queue management (AQM) techniques discussed in the literature.

Pseudo-time marching schemes for inverse problems in structural health assessment and medical imaging

We propose a self-regularized pseudo-time marching strategy for ill-posed, nonlinear inverse problems involving recovery of system parameters given partial and noisy measurements of system response. While various regularized Newton methods are popularly employed to solve these problems, resulting solutions are known to sensitively depend upon the noise intensity in the data and on regularization parameters, an optimal choice for which remains a tricky issue. Through limited numerical experiments on a couple of parameter re-construction problems, one involving the identification of a truss bridge and the other related to imaging soft-tissue organs for early detection of cancer, we demonstrate the superior features of the pseudo-time marching schemes.

An optimal weighted-average congestion based pricing scheme for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

A four-timescale algorithm for constrained stochastic optimization of RED

The overall performance of random early detection (RED) routers in the Internet is determined by the settings of their associated parameters. The non-availability of a functional relationship between the RED performance and its parameters makes it difficult to implement optimization techniques directly in order to optimize the RED parameters. In this paper, we formulate a generic optimization framework using a stochastically bounded delay metric to dynamically adapt the RED parameters. The constrained optimization problem thus formulated is solved using traditional nonlinear programming techniques. Here, we implement the barrier and penalty function approaches, respectively. We adopt a second-order nonlinear optimization framework and propose a novel four-timescale stochastic approximation algorithm to estimate the gradient and Hessian of the barrier and penalty objectives and update the RED parameters. A convergence analysis of the proposed algorithm is briefly sketched. We perform simulations to evaluate the performance of our algorithm with both barrier and penalty objectives and compare these with RED and a variant of it in the literature. We observe an improvement in performance using our proposed algorithm over RED, and the above variant of it.

An optimal weighted-average congestion based pricing scheme for enhanced QoS, , LNCS 4882, 2007

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

Optimal multi-layered congestion based pricing schemes for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes with multiple queues and multiple grades of service. We present a closed-loop multi-layered pricing scheme and propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. This is different from most adaptive pricing schemes in the literature that do not obtain a closed-loop state dependent pricing policy. The method that we propose finds optimal price levels that are functions of the queue lengths at individual queues. Further, we also propose a variant of the above scheme that assigns prices to incoming packets at each node according to a weighted average queue length at that node. This is done to reduce frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using both of our schemes over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our first scheme exhibits a throughput improvement in the range of 67-82% among all routes over the above scheme. (C) 2011 Elsevier B.V. All rights reserved.

Ascorbate Protects Neurons against Oxidative Stress: A Raman Microspectroscopic Study

Oxidative stress due to excessive accumulation of reactive oxygen or nitrogen species in the brain as seen in certain neurodegenerative diseases can have deleterious effects on neurons. Hydrogen peroxide, endogenously generated in neurons under normal physiological conditions, can produce an excess of hydroxyl radical via a Fenton mediated mechanism. This may induce acute oxidative injury if not scavenged or removed effectively by antioxidants. There are several biochemical assay methods to estimate oxidative injury in cells; however, they do not provide information on the biochemical changes as the cells get damaged progressively under oxidative stress. Raman microspectroscopy offers the possibility of real time monitoring of the chemical composition of live cells undergoing oxidative stress under physiological conditions. In the present study, a hippocampal neuron coculture was used to observe the acute impact of hydroxyl radicals generated by hydrogen peroxide in the presence of Fe2+ (Fenton reaction). Raman peaks related to nucleic acids (725, 782, 1092, 1320, 1340, 1420, and 1576 cm(-1)) showed time-dependent changes over the experimental period (60 mm), indicating the breakdown of the phosphodiester backbone as well as nuclear bases. Interestingly, ascorbic acid (a potent antioxidant) when cotreated with Fenton reactants showed protection of cells as inferred from the Raman spectra, presumably by scavenging hydroxyl radicals. Little or no change in the Raman spectra was observed for untreated control cells and for cells exposed to Fe2+ only, H2O2 only, and ascorbate only. A live dead assay study also supported the current observations. Hence, Raman microspectroscopy has the potential to be an excellent noninvasive tool for early detection of oxidative stress that is seen in neurodegenerative diseases.

Identification of immuno-dominant antigens of Trypanosoma evansi for detection of chronic trypanosomosis using experimentally infected equines

Trypanosoma evansi is the most extensively distributed trypanosome responsible for disease called surra in livestock in many countries including frequent outbreaks in India. The prevalence of this disease is most commonly reported by standard parasitological detection methods (SPDM); however, antibody ELISA is being in practice by locally produced whole cell lysate (WCL) antigens in many countries. In the present investigation, we attempted to identify and purify immuno dominant, infection specific trypanosome antigens from T. evansi proteome using experimentally infected equine serum by immuno blot. Three immuno dominant clusters of proteins i.e. 62-66 kDa, 52-55 kDa and 41-43 kDa were identified based on their consistent reactivity with donkey sequential serum experimentally infected T. evansi up to 280 days post infection (dpi). The protein cluster of 62-66 kDa was purified in bulk in native form and comparatively evaluated with whole cell lysate antigen (WCL). ELISA and immuno blot showed that polypeptide of this cluster is 100% sensitive in detection of early and chronic infection. Further, this protein cluster was also found immuno reactive against hyper immune serum raised against predominantly 66 kDa exo antigen, revealed that this is a common immunodominant moieties in proteome and secretome of T. evansi.