@conference {
	title = {Markov Processes with State-Dependent Failure Rates and Application to RED and TCP Window Dynamics},
	author = {Misra, Archan., Ott, Teunis., Baras, John S.},
	year = {2003},
	month = {06/2003},
	abstract = {This paper presents a mathematical technique for computing the stationary distribution of Markov processes that evolve deterministically between arbitrarily distributed {\textquoteleft}failure events{\textquoteright}. The key innovation in this paper is the use of a state-dependent time rescaling technique, such that the re-scaled process can be described by a Poisson-interrupted stochastic differential equation. This technique is first applied to compute the stationary window distribution of a TCP flow performing idealized classical congestion avoidance under variable, but state-dependent, packet loss, and subsequently, to study the distribution of a TCP flow performing generalized congestion avoidance. We show how the stochastic differential equation can be solved by a rapidly convergent numerical technique to obtain the stationary distribution in the re-scaled (subjective) time, and present the re-scalings needed to eventually obtain the distribution of the original Markov process. We demonstrate how this analysis can be used to compute the window distribution of a TCP flow interacting with a RED, ERD or ECN queue, with or without minimally assured throughput guarantees.},
	address = {Rhodes, Greece},
	booktitle = {11th Mediterranean Conference on Control and Automation (MED\&rsquo;03)}
}
@conference {
	title = {Effect of Exponential Averaging on the variability of a RED Queue},
	author = {Misra, Archan., Ott, Teunis., Baras, John S.},
	year = {2001},
	month = {06/2001},
	abstract = {The paper analyzes how using a longer memory of the past queue occupancy in computing the average queue occupancy affects the stability and variability of a RED queue. Extensive simulation studies with both persistent and Web TCP sources are used to study the variance of the RED queue as a function of the memory of the averaging process. Our results show that there is very little performance improvement (and in fact, possibly significant performance degradation) if the length of memory is increased beyond a very small value. Contrary to current practice, our results show that a longer memory reduces the negative correlation typically observed among the windows of the constituent TCP flows, and hence, suggest the use of the instantaneous queue occupancy in practical RED queues.},
	address = {Helsinki, Finland},
	booktitle = {IEEE International Conference on Communications (ICC) 2001},
	pages = {pp. 1817-1823}
}
@conference {
	title = {Generalized TCP Congestion Avoidance and Its Effect on Bandwidth Sharing and Variability},
	author = {Misra, Archan., Baras, John S., Ott, Teunis.},
	year = {2000},
	month = {11/2000},
	abstract = {To model possible suggested changes in TCP window adaptation in response to randomized feedback, such as ECN, we formulate a generalized verslon of the TCP congestion avoidance algorithm. We first consider multiple such generalized TCP flows sharing a bottleneck buffer under the Assured Service model and use a fixed point technique to obtain the mean window sizes and throughputs for the TCP flows. To further study how changes in the adaptation algorithm affect the variability in the throughput, we use an analytical-cum-numerical technique to derive the window distribution (and related statistics) of a single generalized flow under state-dependent randomized congestion feedback.},
	address = {San Francisco, California},
	booktitle = {IEEE Global Telecommunications Conference (GLOBECOM), Communications: The Global Bridge},
	pages = {pp. 329-337.}
}
@conference {
	title = {Using Drop{\textendash}Biasing to stabilize the Occupancy of Random-Drop Queues with TCP Traffic},
	author = {Misra, Archan., Ott, Teunis., Baras, John S.},
	year = {2000},
	month = {11/2000},
	abstract = {The paper describes how the use of {\textquoteleft}drop-biasing{\textquoteright}, a technique to control the distribution of the gap between consecutive packet losses in random drop queues (such as RED) can be used to reduce the variability of the queue occupancy with TCP traffic. Reducing the variance of the queue occupancy reduces delay jitter for buffered packets, as well as decreases the likelihood of buffer underflow. We find that modifying the packet drop probabilities to ensure a minimum separation between consecutive packet drops serves to decrease the variability in the queue occupancy. This is really achieved as a result of the increased negative correlation among the congestion windows of the constituent TCP flows. Such negative correlation explains why the use of simple drop-biasing strategies can reduce the queue variability without increasing the likelihood of bursts of packet losses. The results of our investigations have relevance for the design and deployment of RED-like algorithms for congestion control in the Internet.},
	address = {Singapore},
	booktitle = {IEEE International Conference on Communications Systems(ICCS)},
	pages = {pp. 1-9}
}
@conference {
	title = {The Window Distribution of Multiple TCPs with Random Loss Queues},
	author = {Misra, Archan., Ott, Teunis., Baras, John S.},
	year = {1999},
	month = {12/1999},
	abstract = {Two approximate techniques for analyzing the window size distribution of TCP flows sharing an RED-like bottleneck queue are presented. Both methods presented first to use a fixed point algorithm to obtain the mean window sizes of the flows, and the mean queue length in the bottleneck buffer. The simpler of the two methods then uses the {\textquoteleft}square root formula{\textquoteright} for TCP; the other method is more complicated. More often than not, the simpler method is slightly more accurate; this is probably due to the fact that window sizes of the different flows are negatively correlated.},
	address = {Rio de Janeiro, Brazil},
	booktitle = {1999 IEEE Global Telecommunications Conference (GLOBECOM)},
	pages = {pp.  1714-1726}
}
@article {
	title = {Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows},
	author = {Misra, Archan., Ott, Teunis., Baras, John S.},
	year = {2002},
	month = {11/2002},
	abstract = {The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each flow is assured a minimum traffic rate. Simulations are used to demonstrate the accuracy of this technique for relatively low values of packet dropping probability and a much wider range of packet marking probability.},
	pages = {pp. 557-576},
	volume = {Volume 40},
	number = {Issue 4},
	journal = {Computer Networks Journal}
}
