TCP-friendly SIMD Congestion Control and Its Convergence Behavior

The increased diversity of Internet application requirements has spurred recent interests in flexible congestion control mechanisms. Window-based congestion control schemes use increase rules to probe available bandwidth, and decrease rules to back off when congestion is detected. The parameterization of these control rules is done so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and packet loss rate. In this paper, we propose a novel window-based congestion control algorithm called SIMD (Square-Increase/Multiplicative-Decrease). Contrary to previous memory-less controls, SIMD utilizes history information in its control rules. It uses multiplicative decrease but the increase in window size is in proportion to the square of the time elapsed since the detection of the last loss event. Thus, SIMD can efficiently probe available bandwidth. Nevertheless, SIMD is TCP-friendly as well as TCP-compatible under RED, and it has much better convergence behavior than TCP-friendly AIMD and binomial algorithms proposed recently.

Open Issues on TCP for Mobile Computing

We discuss the design principles of TCP within the context of heterogeneous wired/wireless networks and mobile networking. We identify three shortcomings in TCP's behavior: (i) the protocol's error detection mechanism, which does not distinguish different types of errors and thus does not suffice for heterogeneous wired/wireless environments, (ii) the error recovery, which is not responsive to the distinctive characteristics of wireless networks such as transient or burst errors due to handoffs and fading channels, and (iii) the protocol strategy, which does not control the tradeoff between performance measures such as goodput and energy consumption, and often entails a wasteful effort of retransmission and energy expenditure. We discuss a solution-framework based on selected research proposals and the associated evaluation criteria for the suggested modifications. We highlight an important angle that did not attract the required attention so far: the need for new performance metrics, appropriate for evaluating the impact of protocol strategies on battery-powered devices.

How does TCP generate Pseudo-self-similarity?

Long-range dependence has been observed in many recent Internet traffic measurements. In addition, some recent studies have shown that under certain network conditions, TCP itself can produce traffic that exhibits dependence over limited timescales, even in the absence of higher-level variability. In this paper, we use a simple Markovian model to argue that when the loss rate is relatively high, TCP's adaptive congestion control mechanism indeed generates traffic with OFF periods exhibiting power-law shape over several timescales and thus introduces pseudo-long-range dependence into the overall traffic. Moreover, we observe that more variable initial retransmission timeout values for different packets introduces more variable packet inter-arrival times, which increases the burstiness of the overall traffic. We can thus explain why a single TCP connection can produce a time-series that can be misidentified as self-similar using standard tests.

A Spectrum of TCP-Friendly Window-Based Congestion Control Algorithms

The increased diversity of Internet application requirements has spurred recent interests in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The parameterization of these control rules is done so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. In this paper, we define a new spectrum of window-based congestion control algorithms that are TCP-friendly as well as TCP-compatible under RED. Contrary to previous memory-less controls, our algorithms utilize history information in their control rules. Our proposed algorithms have two salient features: (1) They enable a wider region of TCP-friendliness, and thus more flexibility in trading off among smoothness, aggressiveness, and responsiveness; and (2) they ensure a faster convergence to fairness under a wide range of system conditions. We demonstrate analytically and through extensive ns simulations the steady-state and transient behaviors of several instances of this new spectrum of algorithms. In particular, SIMD is one instance in which the congestion window is increased super-linearly with time since the detection of the last loss. Compared to recently proposed TCP-friendly AIMD and binomial algorithms, we demonstrate the superiority of SIMD in: (1) adapting to sudden increases in available bandwidth, while maintaining competitive smoothness and responsiveness; and (2) rapidly converging to fairness and efficiency.

A Spectrum of TCP-friendly Window-Based Congestion Control Algorithms

The increasing diversity of Internet application requirements has spurred recent interest in transport protocols with flexible transmission controls. In window-based congestion control schemes, increase rules determine how to probe available bandwidth, whereas decrease rules determine how to back off when losses due to congestion are detected. The control rules are parameterized so as to ensure that the resulting protocol is TCP-friendly in terms of the relationship between throughput and loss rate. This paper presents a comprehensive study of a new spectrum of window-based congestion controls, which are TCP-friendly as well as TCP-compatible under RED. Our controls utilize history information in their control rules. By doing so, they improve the transient behavior, compared to recently proposed slowly-responsive congestion controls such as general AIMD and binomial controls. Our controls can achieve better tradeoffs among smoothness, aggressiveness, and responsiveness, and they can achieve faster convergence. We demonstrate analytically and through extensive ns simulations the steady-state and transient behavior of several instances of this new spectrum.

Differentiated Predictive Fair Service for TCP Flows

The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion avoidance mechanism and its effect on the performance of short and long data transfers. At the same time, the rising interest in enhancing Internet services while keeping the implementation cost low has led to several service-differentiation proposals. In such service-differentiation architectures, much of the complexity is placed only in access routers, which classify and mark packets from different flows. Core routers can then allocate enough resources to each class of packets so as to satisfy delivery requirements, such as predictable (consistent) and fair service. In this paper, we investigate the interaction among short and long TCP flows, and how TCP service can be improved by employing a low-cost service-differentiation scheme. Through control-theoretic arguments and extensive simulations, we show the utility of isolating TCP flows into two classes based on their lifetime/size, namely one class of short flows and another of long flows. With such class-based isolation, short and long TCP flows have separate service queues at routers. This protects each class of flows from the other as they possess different characteristics, such as burstiness of arrivals/departures and congestion/sending window dynamics. We show the benefits of isolation, in terms of better predictability and fairness, over traditional shared queueing systems with both tail-drop and Random-Early-Drop (RED) packet dropping policies. The proposed class-based isolation of TCP flows has several advantages: (1) the implementation cost is low since it only requires core routers to maintain per-class (rather than per-flow) state; (2) it promises to be an effective traffic engineering tool for improved predictability and fairness for both short and long TCP flows; and (3) stringent delay requirements of short interactive transfers can be met by increasing the amount of resources allocated to the class of short flows.

TCP Control Groups: Aggregated Congestion Control for TCP (MA Thesis)

This thesis presents a framework for aggregated congestion management for TCP flows and shows how to integrate such an approach in an existing TCP protocol stack. The thesis presents an initial implementation of this congestion management scheme in Linux, with performance evaluation in ns as well.

Novel associations of UDP-glucuronosyltransferase 2B gene variants with prostate cancer risk in a multiethnic study.

BACKGROUND: We have previously shown that a functional polymorphism of the UGT2B15 gene (rs1902023) was associated with increased risk of prostate cancer (PC). Novel functional polymorphisms of the UGT2B17 and UGT2B15 genes have been recently characterized by in vitro assays but have not been evaluated in epidemiologic studies. METHODS: Fifteen functional SNPs of the UGT2B17 and UGT2B15 genes, including cis-acting UGT2B gene SNPs, were genotyped in African American and Caucasian men (233 PC cases and 342 controls). Regression models were used to analyze the association between SNPs and PC risk. RESULTS: After adjusting for race, age and BMI, we found that six UGT2B15 SNPs (rs4148269, rs3100, rs9994887, rs13112099, rs7686914 and rs7696472) were associated with an increased risk of PC in log-additive models (p < 0.05). A SNP cis-acting on UGT2B17 and UGT2B15 expression (rs17147338) was also associated with increased risk of prostate cancer (OR = 1.65, 95% CI = 1.00-2.70); while a stronger association among men with high Gleason sum was observed for SNPs rs4148269 and rs3100. CONCLUSIONS: Although small sample size limits inference, we report novel associations between UGT2B15 and UGT2B17 variants and PC risk. These associations with PC risk in men with high Gleason sum, more frequently found in African American men, support the relevance of genetic differences in the androgen metabolism pathway, which could explain, in part, the high incidence of PC among African American men. Larger studies are required.

Discovery of the Elusive UDP-Diacylglucosamine Hydrolase in the Lipid A Biosynthetic Pathway in Chlamydia trachomatis.

Constitutive biosynthesis of lipid A via the Raetz pathway is essential for the viability and fitness of Gram-negative bacteria, includingChlamydia trachomatis Although nearly all of the enzymes in the lipid A biosynthetic pathway are highly conserved across Gram-negative bacteria, the cleavage of the pyrophosphate group of UDP-2,3-diacyl-GlcN (UDP-DAGn) to form lipid X is carried out by two unrelated enzymes: LpxH in beta- and gammaproteobacteria and LpxI in alphaproteobacteria. The intracellular pathogenC. trachomatislacks an ortholog for either of these two enzymes, and yet, it synthesizes lipid A and exhibits conservation of genes encoding other lipid A enzymes. Employing a complementation screen against aC. trachomatisgenomic library using a conditional-lethallpxHmutantEscherichia colistrain, we have identified an open reading frame (Ct461, renamedlpxG) encoding a previously uncharacterized enzyme that complements the UDP-DAGn hydrolase function inE. coliand catalyzes the conversion of UDP-DAGn to lipid Xin vitro LpxG shows little sequence similarity to either LpxH or LpxI, highlighting LpxG as the founding member of a third class of UDP-DAGn hydrolases. Overexpression of LpxG results in toxic accumulation of lipid X and profoundly reduces the infectivity ofC. trachomatis, validating LpxG as the long-sought-after UDP-DAGn pyrophosphatase in this prominent human pathogen. The complementation approach presented here overcomes the lack of suitable genetic tools forC. trachomatisand should be broadly applicable for the functional characterization of other essentialC. trachomatisgenes.IMPORTANCEChlamydia trachomatisis a leading cause of infectious blindness and sexually transmitted disease. Due to the lack of robust genetic tools, the functions of manyChlamydiagenes remain uncharacterized, including the essential gene encoding the UDP-DAGn pyrophosphatase activity for the biosynthesis of lipid A, the membrane anchor of lipooligosaccharide and the predominant lipid species of the outer leaflet of the bacterial outer membrane. We designed a complementation screen against theC. trachomatisgenomic library using a conditional-lethal mutant ofE. coliand identified the missing essential gene in the lipid A biosynthetic pathway, which we designatedlpxG We show that LpxG is a member of the calcineurin-like phosphatases and displays robust UDP-DAGn pyrophosphatase activityin vitro Overexpression of LpxG inC. trachomatisleads to the accumulation of the predicted lipid intermediate and reduces bacterial infectivity, validating thein vivofunction of LpxG and highlighting the importance of regulated lipid A biosynthesis inC. trachomatis.