@article{cai_eun_ha_rhee_xu_2009, title={Stochastic convex ordering for multiplicative decrease internet congestion control}, volume={53}, ISSN={["1872-7069"]}, DOI={10.1016/j.comnet.2008.10.012}, abstractNote={Window growth function for congestion control is a strong determinant of protocol behaviors, especially its second and higher-order behaviors associated with the distribution of transmission rates, its variances, and protocol stability. This paper presents a new stochastic tool, called convex ordering, that provides an ordering of any convex function of transmission rates of two multiplicative-decrease protocols and valuable insights into high-order behaviors of protocols. As the ordering determined by this tool is consistent with any convex function of rates, it can be applied to any unknown metric for protocol performance that consists of some high-order moments of transmission rates, as well as those already known such as rate variance. Using the tool, it is analyzed that a protocol with a growth function that starts off with a concave function and then switches to a convex function (e.g., an odd order function such as x3 and x5) around the maximum window size in the previous loss epoch, gives the smallest rate variation under a variety of network conditions. Among existing protocols, BIC and CUBIC have this window growth function. Experimental and simulation results confirm the analytical findings.}, number={3}, journal={COMPUTER NETWORKS}, author={Cai, Han and Eun, Do Young and Ha, Sangtae and Rhee, Injong and Xu, Lisong}, year={2009}, month={Feb}, pages={365–381} }
 @article{rhee_xu_2007, title={Limitations of equation-based congestion control}, volume={15}, ISSN={["1558-2566"]}, DOI={10.1109/TNET.2007.893883}, abstractNote={We study limitations of an equation-based congestion control protocol, called TCP-Friendly Rate Control (TFRC). It examines how the three main factors that determine TFRC throughput, namely, the TCP-friendly equation, loss event rate estimation, and delay estimation, can influence the long-term throughput imbalance between TFRC and TCP. Especially, we show that different sending rates of competing flows cause these flows to experience different loss event rates. There are several fundamental reasons why TFRC and TCP flows have different average sending rates, from the first place. Earlier work shows that the convexity of the TCP-friendly equation used in TFRC causes the sending rate difference. We report two additional reasons in this paper: 1) the convexity of 1/x where x is a loss event period and 2) different retransmission timeout period (RTO) estimations of TCP and TFRC. These factors can be the reasons for TCP and TFRC to experience initially different sending rates. But we find that the loss event rate difference due to the differing sending rates greatly amplifies the initial throughput difference; in some extreme cases, TFRC uses around 20 times more, or sometimes 10 times less, bandwidth than TCP. Despite these factors influencing the throughput difference, we also find that simple heuristics can greatly mitigate the problem.}, number={4}, journal={IEEE-ACM TRANSACTIONS ON NETWORKING}, author={Rhee, Injong and Xu, Lisong}, year={2007}, month={Aug}, pages={852–865} }
 @article{rhee_xu_2005, title={Limitations of equation-based congestion control}, volume={35}, ISSN={["1943-5819"]}, DOI={10.1145/1090191.1080099}, abstractNote={
            We study limitations of an equation-based congestion control protocol, called TFRC (TCP Friendly Rate Control). It examines how the three main factors that determine TFRC throughput, namely, the TCP friendly equation, loss event rate estimation and delay estimation, can influence the long-term throughput imbalance between TFRC and TCP. Especially, we show that different sending rates of competing flows cause these flows to experience different loss event rates. There are several fundamental reasons why TFRC and TCP flows have different average sending rates, from the first place. Earlier work shows that the convexity of the TCP friendly equation used in TFRC causes the sending rate difference. We report two additional reasons in this paper: (1) the convexity of 1/
            x
            where
            x
            is a loss event period and (2) different RTO (retransmission timeout period) estimations of TCP and TFRC. These factors can be the reasons for TCP and TFRC to experience initially different sending rates. But we find that the loss event rate difference due to the differing sending rates greatly amplifies the initial throughput difference; in some extreme cases, TFRC uses around 20 times more, or sometimes 10 times less, bandwidth than TCP.
          }, number={4}, journal={ACM SIGCOMM COMPUTER COMMUNICATION REVIEW}, author={Rhee, I and Xu, LS}, year={2005}, month={Oct}, pages={49–60} }
 @article{xu_perros_rouskas_2003, title={A simulation study of optical burst switching and access protocols for WDM ring networks}, volume={41}, ISSN={["1389-1286"]}, DOI={10.1016/s1389-1286(02)00371-7}, abstractNote={We consider a wavelength division multiplexing metro ring architecture with optical burst switching. The ring consists of N nodes, and each node owns a home wavelength on which it transmits its bursts. The ring operates under the fixed transmitter tunable receiver scheme. Control information is transmitted on a separate control channel. Five different burst switching access protocols are proposed, and their performance and fairness is evaluated by simulation.}, number={2}, journal={COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING}, author={Xu, LS and Perros, HG and Rouskas, GN}, year={2003}, month={Feb}, pages={143–160} }
 @article{xu_perros_rouskas_2003, title={Access protocols for optical burst-switched ring networks}, volume={149}, ISSN={["0020-0255"]}, DOI={10.1016/S0020-0255(02)00247-5}, abstractNote={In this paper, we consider a WDM metro ring architecture with optical burst switching. Several access protocols are proposed and their performance is analyzed by simulation.}, number={1-3}, journal={INFORMATION SCIENCES}, author={Xu, LS and Perros, HG and Rouskas, GN}, year={2003}, month={Jan}, pages={75–81} }