An Analytical RED Function Design Guaranteeing Stable System Behavior
|
|
- MargaretMargaret Page
- 6 years ago
- Views:
Transcription
1 An Analytical RED Function Design Guaranteeing Stable System Behavior Erich Plasser, Thomas Ziegler Telecommunications Research Center Vienna {plasser, Abstract This paper introduces the procedure for an analytical derivation of the drop probability function for the Random Early Detection queue management mechanism. The procedure is based on a model of the TCP window system and the establishment for a criterion for system stability with methods of control theory. The term stability refers to the oscillation amplitude of the steady state queue size. The outcome is a ial function of the queue size, which can be approximated with a power function of the queue size. Besides the goal of achieving low oscillations for the whole load range, this derived function shows yet other advantages. There are no parameters to adjust, which extends the applicability of RED to a wide range of load situations applying the derived function. Additionally, the under-utilization at low loads, as often experienced with the original RED function, is avoided automatically. Simulations show clear evidence that the derived function outperforms the original linear RED function.. Introduction The Internet research community regards Active Queue Management (AQM) as an important mechanism to notify traffic sources about the early stages of congestion and thus avoid the need for strong source reactions due to heavy overload [?]. The original Random Early Detection (RED) algorithm, defined in [?], can be considered to be the most popular AQM mechanism. With RED, the drop probability p increases linearly between two thresholds th min and th max in dependence on the average queue size q. The drop probability is constrained with a maximum value p max. The average queue size is calculated from the instantaneous queue size by using an EWMA (exponentially weighted moving This work was supported by the Austrian Kplus program and the IST project Moby Dick average) filter with the weighting factor w q. Since the publishing of [?], significant research has been devoted to the analysis of the dynamics of RED in interaction with TCP congestion control. Besides [?], several papers like [?], [?], [?], [?], [?] introduce models aimed at finding an appropriate set of the th min, th max, p max, w q parameters. Modified versions of RED are GRED [?] and ARED [?]. GRED is a fragmented extension for the RED function. Two concatenated linear RED curves with different slopes are established to meet the requirements for low and heavy loads. The problem of parameter setting remains the same as in the original RED. ARED and related forms, such as discussed in [?], adapt the maximum drop probability p max according to the load. Both RED versions do not reduce the total number of parameters. The goal of a proper RED adjustment, also aimed by the former mentioned models, is to maintain the average queue size between th min and th max at low oscillations and in turn help to avoid forced drops (i.e. either the instantaneous queue size exceeds the buffer size or the average queue size exceeds th max ) and link under-utilization (i.e. the instantaneous queue size decreases to zero). According to the literature, it turned out to be very difficult to find an appropriate parameter set to adjust RED for general deployment. The weakness of the known models is their orientation on assumed values related to the load, especially such as the round trip time (R) and the number of flows (N). Even if the assumptions on the input parameters fit the scenario, the applicability of the original RED mechanism, adjusted accordingly to the models, would be restricted to a small range of the assumed load values only. But in real-life deployments of RED varying and unknown load situations are typical, which basically rules out that one specific set of parameters found by these models is applicable to all possible scenarios. This restriction is caused by the linearity of the original RED function. In [?] it is illustrated that a high load requires a disproportionately higher drop probability than a low load to keep the queue size in the same range, a require /3 $7. 23 IEEE
2 ment met only by a non-linear drop function. Therefore (in [?]), several approaches to obtain a non-linear drop function for RED are proposed, where, similar to the original RED function, the majority of these approaches were established by heuristics. Such non-linear functions fulfill the requirement of the queue size remaining between th min and th max for a much broader load range than the original linear RED function. Note, that the shape of such a non-linear function has to be designed carefully, otherwise heavy oscillations may occur. Building on these earlier findings, we set out in this paper to find a procedure for deriving a drop function which meets first of all the requirements for the avoidance of heavy oscillations. At the same time, this function is expected to depend solely on system immanent parameters, superseding the impractical adjustment for the th min, th max, p max parameters for different loads. As a consequence this drop function should be applicable independent on the load range. Given our emphasis placed on oscillations, we consider heavy oscillations as a state of instability which is best treated by control theory. Thereby, based on a mathematical description of the TCP window system, we determine that maximum value of the drop probability which keeps the system stable at each considered load. The result is a non-linear continuous ial function of the queue size as interpolation from the calculated drop probability values in discrete form. If we compare the performance of the original RED algorithm with a single parameter set in simulations, we see that this function shows significant performance improvements in scenarios with constant load as well as with varying/unknown load and round trip time distributions. The rest of the paper is organized as follows: In section 2 the mathematical model used to describe the TCP window system is introduced. The model is linearized and transformed to a transfer function in the Laplace-domain. Thereafter, the criterion for the stability range of the whole system is explained in general. Section 3 outlines how to obtain the drop function based on the TCP window model in six steps. The drop function is then compared to a simpler function (a power function) of the queue size for the purpose of easier implementation. Section 4 is divided into a subsection describing the simulation environment and a subsection presenting the simulation results. The simulations show the response of the derived function and other RED functions to FTP traffic. 2. The Marginal Stability of the TCP System As the application for control theory requires a mathematical description of the system, we use the model in [?] and [?], formulated as stochastic differential equations. This model allows to analytically investigate the behavior of TCP flows, which operate with active queue management. Note that these equations describe only a rough model, as they neglect the Slow-start and timeout effect. where dw (t) dt = R(t) W (t) 2 dq(t) dt W (t τ) p(t τ) () R(t τ) = N W (t) C (2) R(t) R(t) = q(t) C + T p (3) W... mean TCP window size of all flows [packets], q... queue length [packets], R... round trip time [sec], C...link capacity [packets per sec], T p... propagation delay [sec], N... number of TCP sessions, p... probability of packet loss, τ... time delay at which packet loss occurs Equation () describes the increase of the window size by one packet per round trip time. Each time a packet loss is detected, the window size is halved. A packet loss happens at time (t τ) as it is indicated in the right part of (). The time shift can be seen roughly as one round trip time. Equation (2) expresses the accumulation of the queue size. Equation (3) describes the round trip time as the sum of the queuing delay and the propagation delay. For stability investigations we use the definition of BIBO stability. The system is called asymptotically stable if the magnitude of the transfer function is less than one for a phase of -π in the Bode-diagram. To perform the investigation about stability, the non-linear model in (), (2), (3) has to be linearized at the value of the equilibrium state. Under the assumption of T p,c,n = const, the equilibrium state is obtained by: p = 2 and W W 2 = CR N. The overall transfer function of the linearized TCP system is denoted by: G(s) = q p = 2 C 2N e sr ( s + R )( s + 2N R 2 C ) (4) Before applying the Bode-diagram, we have to include the role of the AQM mechanism as indicated in (). To provide better insight into the interworking of the transfer function with the AQM mechanism, figure depicts the block diagram of the modeled TCP window system. The inherent negative feedback loop can be easily recognized, which makes the system generally applicable to control theory. The queue size influences the window size and vice versa. The round block represents a P-controller, which can be denoted as the AQM drop function in this case. The AQM consist of a variable factor K in analogy to the definition of the drop probability of the original RED function, p where K is constant (p = max (th max th min) q = K q). To the left of the block diagram the optional reference input parameter q ref (for a typical P-controller) is displayed. In our work we regard the pure RED function, thus q ref = /3 $7. 23 IEEE
3 qr ef p = K q p G W W G 2 q is obtained by expanding (4) with s=jω and by calculating the amount of the resulting complex term. Figure : Block diagram of the TCP window system At the critical frequency ω g in the Bode diagram the phase reaches the value of -π. The condition of the system to be marginally stable is that the magnitude of the transfer function G(s) combined with the factor K must be one at the critical frequency. As the magnitude of G(s) is determinable for a specific load, it is easy to calculate the factor K g with K g G(s) =, which we denote as the highest factor K to keep the system stable. 3. Formation of a Drop Function To begin with, we have to find the critical frequency ω g and calculate the factor K g at different loads. As we see in (4), the transfer function is dependent on the load N, thus we expect a different factor K g at each different load. By interpolating the different K g s, we are thus able to present a new drop function. For the derivation the parameters of the equilibrium state are used, denoted as q, R, W, p. In packet simulations the averaged value of the measured queue size (denoted as average queue size in RED notations) over the simulation time can be used as an approximation of the equilibrium state of the queue size q. The drop function is derived in six steps: Step : The critical frequency ω g can be achieved from the initial condition of the phase of the system without load (N=). In this situation the queue size q =, and because of (3), R =T p. The phase of the system is equated to the phase margin set to -π ( 8 o ). Equation (6) is the initial version of (5) to calculate ω g. ϕ = π = arctan( ω gr 2 C 2N ) arctan(ω gr ) (ω g R ) (5) π 2 =arctan(ω g R )+(ω g R ) (6) By transforming (6) and substituting for R =T p, we obtain ω g =.863 T p and with T p =.2 sec, ω g = 4.3 rad. Step 2: In this step the round trip time R = R (N,C,ω g ) is determined by varying the load N =-N max in discrete steps. We increase the load until p= is reached. A closed form for R could not be found because of the high order of R, not even by substitution with a rough approximation of tan(ωr ). Thus we have to determine the round trip time R numerically. Step 3: Now, all necessary values are determined to calculate the maximum value of K g = G(j ω g). Equation (7) K g = ( ω2 g R3 C 2N ) 2 ( + ω 2 g R 2 RC 2N +) 2 C 3 R 3 4N 2 (7) Step 4: The steady state queue size corresponding to the load is easily obtained by a slight transcription of (3) into q =(R T p ) C and using R from step 2. Step 5: So far we have obtained two functions in dependency of the load (q (N), K g (N)). For deployment of RED the AQM mechanism calculates the drop probability as a function of the average queue size. Instead the dependency of q and K g on the queue size is required, which is the goal of this step 5. This can be easily reached by assigning the discrete values of q (N) and K g (N), which may also be regarded as vectors, to a discrete vector K g (q ). In contrast to the original RED function, where K g is constant for all load situations, this derivation denotes K g as a non-linear function of q. Step 6: Finally, we attain the desired function p (q )by integrating K g over q. The motivation behind is that q is modeled as a harmonic signal with an amplitude K and a frequency ω. As a small variation of the queue size provokes a small variation on the drop probability, we conclude K g is the slope of the drop probability function. This is consistent with simulation experience stating that the slope of the loss probability curve is responsible for oscillations. To achieve a continuous function, we now approximate the resulting discrete function p(q ) with a ial. The approximations where the continuous function best fits the discrete function is of order three, where we do not emphasize to find the optimum approximation. The value of the drop function reaches the maximum p= at q =36. Because p= is never reached in operation the buffer size need not to be that large as 36 packets. The resulting drop function with C=25 and T p =.2 is: p = 3.96e 6 q 6 2.9e 3 q e q 4 (8).49e 8 q e 6 q e 5 q +.9e 3 For an easier implementation of (8) in routers we compare the derived function with several simple non-linear approaches in [?]. These approaches have the form of q p = p max ( th max th min ) i, where the exponent i and p max are to be defined. For normalization reasons th max is fixed with the largest queue size in the derived drop function, here q =36 for p max =, th min =. Through this comparison, we see that the derived drop function with the parameters C=25, Tp=.2 is best approximated by an exponent of the queue size of i=3. This approximation simplifies implementation in routers avoiding the calculation of the ial of high order /3 $7. 23 IEEE
4 In this paper we address the effects of variations of C and T p only in a few words, because they have no effect on the procedure of this derivation and because of space limits. Detailed results will be presented in subsequent research outcomes. It is a fact, that large delay times can steer a system in an instable state easier than small delay times. Therefore we chose T p as relatively high to meet the requirement of the system remaining in the stable state for a large range of occurring T p s. It is assumed that an ISP operator is able to estimate an average T p for incoming flows which can be adjusted once. For the variation of the bottleneck capacity C it is an important fact that if C is increased/decreased in the same relation as the considered load N max, the minimum window size remains the same as in this example. Accordingly, the derived shape of the drop function will be the same. Note, that also the scale of the queue size will change with the same ratio as C and N max. The approximation curve remains proportional to the cubic of the queue size. In general, the link capacity does not change in router deployment, thus the drop curve has to be calculated only once. loss probability derived function q queue size Figure 2: Derived drop function in comparison with the cubic function In figure 2 we see the resulting derived drop function compared with the normalized cubic RED function. The derived drop function guarantees the prevention of heavy oscillations for all considered loads, and additionally, as the factor K g is determined to be maximal (and so is p), the function pursuits keeping the queue size, and hence the delay low. Arguments that for a low queue size there is a high possibility of under-utilization can be responded by considering the shape of the curve at this queue size in figure 2. On one hand, at low load the function features a flat slope (small drop probability), meeting exactly a requirement for avoiding under-utilization as proposed in [?]. On the other hand, a high load forces a disproportional high drop probability to keep the queue size in a range compared to low load. We already mentioned this requirement in section. Another advantage of the derived drop function is its applicability for the whole load range considered in the derivation, which even does not exclude the theoretical limit of infinite load. All higher loads requiring higher loss probability as one are treated with p= anyway. 4. Verification with FTP and Web Traffic Simulations 4.. Environment For packet simulations we use the ns-2 simulator [?] configured with the topology depicted in figure 3. In our investigation we simulate FTP and Web traffic but due to constraints in space in this paper we show the results with FTP traffic only. For FTP traffic the access hosts (h -h 4 ) on the left side act as sources, the access hosts (h 5 -h 8 ) on the right side act as sinks. The access links to the routers each have a capacity of Mbps. The propagation delay to their connected router r or r 2 is distributed with a mean of ms and a variation of 5 ms at maximum. The two routers r, r 2 are connected to the bottleneck link where RED AQM is performed. The bottleneck link capacity is C= Mbps (25 packets/sec) and the propagation delay on this link is T p = ms in one direction. The thresholds at which the drop function starts and ends to work are: th min = packets, th max =36 packets. The buffer size is B=4 packets. The weighting parameter is set to w q =., as recommended in [?]. h h2 h3 h4 Mbps, 5ms Mbps, 8.3ms Mbps,.6ms Mbps, 5ms r Mbps ms Mbps, 5ms Mbps, 8.3ms Mbps,.6ms Mbps, 5ms Figure 3: Simulation topology The RED algorithm operates in packet mode. TCP data senders are of type New-Reno. The TCP packet sizes are uniformly distributed with a mean of 5 bytes between an interval of [45,55] bytes, The simulations with FTP traffic are run for 2 seconds simulation time. We have concisely verified that confidence intervals are small for all scenarios. For these simulations the load is varied from N min =2, 5,, 2, 3 to N max =4 FTP flows. r2 h5 h6 h7 h /3 $7. 23 IEEE
5 4.2. Simulation Results To compare the performance of different drop functions we chose the original linear RED function to show the advantage of a non-linear function against the linear function. We took two versions of the linear function with extremal values for p max : p max =. (indicated as lin ) for the lower case, p max =. (indicated as lin ) for the higher case. Additionally we simulate the approximated cubic curve (indicated as ) to show the slight differences to the derived function in (8). Both linear RED functions and the cubic function are adjusted with th min = and th max =36. For the derived ial function (indicated as ) no parameters are necessary lin lin simulation period, providing a metric for link-underutilization. Underflows occur if a packet arrives and the instantaneous queue size is zero. 4. the coefficient of variation of the queue size, averaged over the whole simulation period (coeff. of var. = standard deviation / mean) ; this is a normalized measure of the amplitudes of the oscillations, we want to keep in control. underflows [packets] x 6 lin lin average queue size [packets] Figure 4: Average queue size - FTP traffic forced drops [packets] 2.5 x lin lin Figure 5: Number of forced drops - FTP traffic We use the simulations to extract four measures:. the mean of the average queue size calculated over the whole simulation period and corresponds to q in section 2; this measure shows the characteristics of the queue size q at different loads; 2. the forced drops accumulated over the whole simulation period; forced drops are undesirable as they disable ECN [?] and may cause global synchronization, 3. the occurred underflows accumulated over the whole Figure 6: Number of underflows - FTP traffic The figure 4 shows the mean value of the average queue size. If we consider the queue size only, an ideal AQM performs with a mean queue size to be as constant as possible over a broad load range. It can be observed that the performance of the cubic and the derived function is very similar and that both functions manage to keep the average queue size reasonably high in low load scenarios and significantly smaller than the maximum threshold for the linear functions (th max =36 packets) in the high load scenarios. In case of low load, the derived and the cubic functions have a higher q than the linear functions for the simulations. The linear function with p max =. exhibits the highest dependency on the load and converges to th max in case of high load. The figure 5 illustrates that the linear function with p max =. is the only function with forced drops. This is in line with our expectations because with p max =. the slope is low, allowing the queue size to be very high. The figure 6 shows the number of underflows. Because the linear function with p max =. forces a low queue size in general, this function show the highest number of underflows. In comparison the cubic and the derived function best in this metric. Finally, the figure 7 illustrates the coefficient of variation of the instantaneous RED queue size as a metric for the normalized amplitude of queue size oscillations. Also in this measure the cubic and the derived function show a good performance. No linear function is able to stabilize the queue for all load situations. Looking at the figure 4 we observe that the lin - function shows the highest value for q at high loads. Thus the slightly better performance of the lin -function for /3 $7. 23 IEEE
6 coefficient of variation lin lin Figure 7: Coefficient of variations - FTP traffic high loads in figures 7 can be explained by the normalization effect using the coefficient of variation calculation. Observing the performance of the linear functions only, we see immediately that there does not exist a single linear drop function which is able to deal with all load situations. Although the linear function with p max =. features few underflows (see figure 6) and minimal oscillations (figure 7) its performance concerning forced drops in case of high load is poor (figure 5), because q is significantly the highest (figure 4) of all compared functions. On the other hand, the linear function with p max =. performs reasonably well in case of forced drops (figure 5), but performs poorly in low load scenarios at the measure of underflows (figure 6). At high loads even the coefficient of variation is relatively high (figure 7), because of the very small queue size q (figure 4) at the whole load range. The cubic and the derived functions are very similar in their behavior combining performance in all scenarios as best. 5. CONCLUSIONS In this paper we introduced an algorithm for analytically deriving a RED drop function which guarantees low oscillations for all loads. The derivation is based on applying stability investigations using a mathematical model for the TCP window system. Heavy oscillations are compared to an instable state of the system. Consequently, by means of control theory that shape of the drop function is determined to keep the system stable. The resulting function is non-linear and can be described by a ial expression. The advantage of this function lies not only in avoiding heavy oscillations but also in avoiding link under-utilization at low loads. The applicability of the derived function is independent of the load range, no parameters are to be adjusted. Compared to the original linear drop function applicability is extended by far. For implementation the shape of the derived function can be approximated with a normalized power function of the queue size. Our example with realistic system parameters gives an approximation function of the cubic of the queue size. The effort to implement the approximated cubic function is not much higher compared to the linear function. Verifications in simulation with FTP traffic show the advantages of the derived and the approximated cubic functions against the original linear shape using the measures of the mean queue size, forced drops, link-under-utilization and coefficient of variation of the queue size. As a result the derived function causes minimum dependency of the queue size on the load, and minimum link-under-utilization and forced packet drops. Rating the functions in a combination of the above measures the derived function performs best over the entire load range. Acknowledgement: We want to thank Christoph Mecklenbraeuker (ftw.) for his useful hints to handle the Matlab tool for non-linear equation solving. References [] NS Simulator Homepage: [2] B. Braden et al. Recommendations on queue management and congestion avoidance in the internet. RFC 239, 998. [3] W. Feng, D. Kandlur, D. Saha, and K. Shin. A selfconfiguring red gateway. Infocom, 999. [4] V. Firoiu and M. Borden. A study of active queue management for congestion control. [5] V. Firoiu and M. Borden. A study of active queue management for congestion control. Infocom, 2. [6] S. Floyd. Tcp and explicit congestion notification. ACM Computer Communication Review, 24(5), October 994. [7] S. Floyd. Recommandations on using the gentle variant of red. March 2. [8] S. Floyd, R. Gummadi, and S. Shenker. Adaptive red: An algorithm for increasing the robustness of red s active queue management. under Submission, 2. [9] S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking, pages , August 993. [] C. Hollot, V. Misra, D. Towsley, and W. Gong. A control theoretic analysis of red. IEEE Infocom, 2. [] G. Iannaccone, C. Brandauer, T. Ziegler, C. Diot, S. Fdida, and M. May. Comparison of tail drop and active queue management performance for bulk-data and web-like internet traffic. IEEE ISCC, July 2. [2] V. Misra, W. Gong, and D. Towsley. Fluid-based analysis of a network of aqm routers supporting tcp flows with an application to red. Proceedings of ACM / Sigcomm, 2. [3] E. Plasser and T. Ziegler. On the non linearity of the red drop function. ICCC, NS Simulator Homepage: August 22. [4] T. Ziegler. On averaging for active queue management congestion avoidance. IEEE ISCC, 22. [5] T. Ziegler, S. Fdida, and C. Brandauer. A quantitative model of red with tcp traffic. IEEE/ACM IWQoS, May /3 $7. 23 IEEE
RED behavior with different packet sizes
RED behavior with different packet sizes Stefaan De Cnodder, Omar Elloumi *, Kenny Pauwels Traffic and Routing Technologies project Alcatel Corporate Research Center, Francis Wellesplein, 1-18 Antwerp,
More informationThree-section Random Early Detection (TRED)
Three-section Random Early Detection (TRED) Keerthi M PG Student Federal Institute of Science and Technology, Angamaly, Kerala Abstract There are many Active Queue Management (AQM) mechanisms for Congestion
More informationAnalyzing the Receiver Window Modification Scheme of TCP Queues
Analyzing the Receiver Window Modification Scheme of TCP Queues Visvasuresh Victor Govindaswamy University of Texas at Arlington Texas, USA victor@uta.edu Gergely Záruba University of Texas at Arlington
More informationACTIVE QUEUE MANAGEMENT ALGORITHM WITH A RATE REGULATOR. Hyuk Lim, Kyung-Joon Park, Eun-Chan Park and Chong-Ho Choi
Copyright 22 IFAC 15th Triennial World Congress, Barcelona, Spain ACTIVE QUEUE MANAGEMENT ALGORITHM WITH A RATE REGULATOR Hyuk Lim, Kyung-Joon Park, Eun-Chan Park and Chong-Ho Choi School of Electrical
More information! Network bandwidth shared by all users! Given routing, how to allocate bandwidth. " efficiency " fairness " stability. !
Motivation Network Congestion Control EL 933, Class10 Yong Liu 11/22/2005! Network bandwidth shared by all users! Given routing, how to allocate bandwidth efficiency fairness stability! Challenges distributed/selfish/uncooperative
More informationAn Adaptive Neuron AQM for a Stable Internet
An Adaptive Neuron AQM for a Stable Internet Jinsheng Sun and Moshe Zukerman The ARC Special Research Centre for Ultra-Broadband Information Networks, Department of Electrical and Electronic Engineering,
More informationBuffer Requirements for Zero Loss Flow Control with Explicit Congestion Notification. Chunlei Liu Raj Jain
Buffer Requirements for Zero Loss Flow Control with Explicit Congestion Notification Chunlei Liu Raj Jain Department of Computer and Information Science The Ohio State University, Columbus, OH 432-277
More informationReduction of queue oscillation in the next generation Internet routers. By: Shan Suthaharan
Reduction of queue oscillation in the next generation Internet routers By: Shan Suthaharan S. Suthaharan (2007), Reduction of queue oscillation in the next generation Internet routers, Computer Communications
More informationMarkov Model Based Congestion Control for TCP
Markov Model Based Congestion Control for TCP Shan Suthaharan University of North Carolina at Greensboro, Greensboro, NC 27402, USA ssuthaharan@uncg.edu Abstract The Random Early Detection (RED) scheme
More informationEnhancing TCP Throughput over Lossy Links Using ECN-capable RED Gateways
Enhancing TCP Throughput over Lossy Links Using ECN-capable RED Gateways Haowei Bai AES Technology Centers of Excellence Honeywell Aerospace 3660 Technology Drive, Minneapolis, MN 5548 E-mail: haowei.bai@honeywell.com
More informationCPSC 826 Internetworking. Congestion Control Approaches Outline. Router-Based Congestion Control Approaches. Router-Based Approaches Papers
1 CPSC 826 Internetworking Router-Based Congestion Control Approaches Michele Weigle Department of Computer Science Clemson University mweigle@cs.clemson.edu October 25, 2004 http://www.cs.clemson.edu/~mweigle/courses/cpsc826
More informationOn the Deployment of AQM Algorithms in the Internet
On the Deployment of AQM Algorithms in the Internet PAWEL MROZOWSKI and ANDRZEJ CHYDZINSKI Silesian University of Technology Institute of Computer Sciences Akademicka 16, Gliwice POLAND pmrozo@go2.pl andrzej.chydzinski@polsl.pl
More informationSteady State Analysis of the RED Gateway: Stability, Transient Behavior, and Parameter Setting
Steady State Analysis of the RED Gateway: Stability, Transient Behavior, and Parameter Setting Hiroyuki Ohsaki, Masayuki Murata, and Hideo Miyahara Graduate School of Engineering Science, Osaka University
More informationFluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED
Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Department of Computer Science University of Massachusetts Amherst MA 13 misra@cs.umass.edu
More informationRandom Early Detection (RED) gateways. Sally Floyd CS 268: Computer Networks
Random Early Detection (RED) gateways Sally Floyd CS 268: Computer Networks floyd@eelblgov March 20, 1995 1 The Environment Feedback-based transport protocols (eg, TCP) Problems with current Drop-Tail
More informationINTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 A SURVEY ON EXPLICIT FEEDBACK BASED CONGESTION CONTROL PROTOCOLS Nasim Ghasemi 1, Shahram Jamali 2 1 Department of
More informationRandom Early Marking: Improving TCP Performance in DiffServ Assured Forwarding
Random Early Marking: Improving TCP Performance in DiffServ Assured Forwarding Sandra Tartarelli and Albert Banchs Network Laboratories Heidelberg, NEC Europe Ltd. Abstract In the context of Active Queue
More informationAppendix B. Standards-Track TCP Evaluation
215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error
More informationA Note on the Stability Requirements of Adaptive Virtual Queue
A ote on the Stability Requirements of Adaptive Virtual Queue Dina Katabi MIT-LCS dk@mit.edu Charles Blake MIT-LCS cb@mit.edu Abstract Choosing the correct values for the parameters of an Active Queue
More informationEnhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways
Enhancing TCP Throughput over Lossy Links Using ECN-Capable Capable RED Gateways Haowei Bai Honeywell Aerospace Mohammed Atiquzzaman School of Computer Science University of Oklahoma 1 Outline Introduction
More informationThe Comparative Analysis of RED, GF-RED and MGF-RED for Congestion Avoidance in MANETs
I J C T A, 9(41), 2016, pp. 157-164 International Science Press ISSN: 0974-5572 The Comparative Analysis of RED, GF-RED and MGF-RED for Congestion Avoidance in MANETs Makul Mahajan 1 and Mritunjay Kumar
More informationOn the Effectiveness of CoDel for Active Queue Management
1 13 Third International Conference on Advanced Computing & Communication Technologies On the Effectiveness of CoDel for Active Queue Management Dipesh M. Raghuvanshi, Annappa B., Mohit P. Tahiliani Department
More informationOne More Bit Is Enough
One More Bit Is Enough Yong Xia, RPI Lakshmi Subramanian, UCB Ion Stoica, UCB Shiv Kalyanaraman, RPI SIGCOMM 05, Philadelphia, PA 08 / 23 / 2005 Motivation #1: TCP doesn t work well in high b/w or delay
More informationAnalysis and Design of Controllers for AQM Routers Supporting TCP Flows. C. V. Hollot, V. Misra, D. Towsley and W. Gong
A Study Group Presentation Analysis and esign of Controllers for AQM outers Supporting TCP Flows C. V. Hollot, V. Misra,. Towsley and W. Gong Presented by: Tan Chee-Wei Advisors: Professor Winston Chiu,
More informationA New Rate-based Active Queue Management: Adaptive Virtual Queue RED
A New Rate-based Active Queue Management: Adaptive Virtual Queue RED Do J. Byun and John S. Baras, Fellow, IEEE Department of Computer Science, University of Maryland at College Park dbyun@hns.com, baras@isr.umd.edu
More informationEffective Utilization of Router Buffer by Threshold Parameter Setting Approach in RED
Effective Utilization of Router Buffer by Threshold Parameter Setting Approach in RED Kiran Chhabra Research Scholar Computer Science & Engineering Dr. C. V. Raman University, Bilaspur (C. G.) Manali Kshirsagar
More informationRECHOKe: A Scheme for Detection, Control and Punishment of Malicious Flows in IP Networks
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < : A Scheme for Detection, Control and Punishment of Malicious Flows in IP Networks Visvasuresh Victor Govindaswamy,
More informationHybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks
Hybrid Control and Switched Systems Lecture #17 Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Motivation Why model network traffic? to validate
More informationA COMPARATIVE STUDY OF TCP RENO AND TCP VEGAS IN A DIFFERENTIATED SERVICES NETWORK
A COMPARATIVE STUDY OF TCP RENO AND TCP VEGAS IN A DIFFERENTIATED SERVICES NETWORK Ruy de Oliveira Federal Technical School of Mato Grosso Brazil Gerência de Eletroeletrônica E-mail: ruy@lrc.feelt.ufu.br
More informationA Modification to RED AQM for CIOQ Switches
A Modification to RED AQM for CIOQ Switches Jay Kumar Sundararajan, Fang Zhao, Pamela Youssef-Massaad, Muriel Médard {jaykumar, zhaof, pmassaad, medard}@mit.edu Laboratory for Information and Decision
More informationCongestion Avoidance Using Adaptive Random Marking
Congestion Avoidance Using Adaptive Random Marking Marissa Borrego, Na Li, Gustavo de Veciana, San-qi Li Department of Electrical and Computer Engineering University of Texas at Austin Austin, Texas (marissa,
More information15-744: Computer Networking. Overview. Queuing Disciplines. TCP & Routers. L-6 TCP & Routers
TCP & Routers 15-744: Computer Networking RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay Product Networks L-6
More informationImpact of bandwidth-delay product and non-responsive flows on the performance of queue management schemes
Impact of bandwidth-delay product and non-responsive flows on the performance of queue management schemes Zhili Zhao Dept. of Elec. Engg., 214 Zachry College Station, TX 77843-3128 A. L. Narasimha Reddy
More informationCS 268: Computer Networking
CS 268: Computer Networking L-6 Router Congestion Control TCP & Routers RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay
More informationAdaptive RED: An Algorithm for Increasing the Robustness of RED s Active Queue Management or How I learned to stop worrying and love RED
Adaptive RED: An Algorithm for Increasing the Robustness of RED s Active Queue Management or How I learned to stop worrying and love RED! Presented by:! Frank Posluszny! Vishal Phirke 2/9/02 1 "Introduction
More informationLow pass filter/over drop avoidance (LPF/ODA): an algorithm to improve the response time of RED gateways
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS Int. J. Commun. Syst. 2002; 15:899 906 (DOI: 10.1002/dac.571) Low pass filter/over drop avoidance (LPF/ODA): an algorithm to improve the response time of
More informationAnalysis of Dynamic Behaviors of Many TCP Connections Sharing Tail Drop/RED Routers
Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail Drop/RED Routers Go Hasegawa and Masayuki Murata Cybermedia Center, Osaka University -3, Machikaneyama, Toyonaka, Osaka 560-853, Japan
More informationCongestion Propagation among Routers in the Internet
Congestion Propagation among Routers in the Internet Kouhei Sugiyama, Hiroyuki Ohsaki and Makoto Imase Graduate School of Information Science and Technology, Osaka University -, Yamadaoka, Suita, Osaka,
More informationImproving TCP Performance over Wireless Networks using Loss Predictors
Improving TCP Performance over Wireless Networks using Loss Predictors Fabio Martignon Dipartimento Elettronica e Informazione Politecnico di Milano P.zza L. Da Vinci 32, 20133 Milano Email: martignon@elet.polimi.it
More informationCongestion Control for High Bandwidth-delay Product Networks. Dina Katabi, Mark Handley, Charlie Rohrs
Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Outline Introduction What s wrong with TCP? Idea of Efficiency vs. Fairness XCP, what is it? Is it
More informationInvestigating the Use of Synchronized Clocks in TCP Congestion Control
Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle (UNC-CH) November 16-17, 2001 Univ. of Maryland Symposium The Problem TCP Reno congestion control reacts only to packet
More informationSteady State Analysis of the RED Gateway: Stability, Transient Behavior, and Parameter Setting
IEICE TRANS. COMMUN., VOL.E8 B, NO.1 JANUARY 1 PAPER Special Issue on Traffic Control and Performance Evaluation in Internet Steady State Analysis of the RED Gateway: Stability, Transient Behavior, and
More informationAn Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering April 2004 An Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management Srisankar
More informationA CONTROL THEORETICAL APPROACH TO A WINDOW-BASED FLOW CONTROL MECHANISM WITH EXPLICIT CONGESTION NOTIFICATION
A CONTROL THEORETICAL APPROACH TO A WINDOW-BASED FLOW CONTROL MECHANISM WITH EXPLICIT CONGESTION NOTIFICATION Hiroyuki Ohsaki, Masayuki Murata, Toshimitsu Ushio, and Hideo Miyahara Department of Information
More informationPerformance Evaluation of Controlling High Bandwidth Flows by RED-PD
Performance Evaluation of Controlling High Bandwidth Flows by RED-PD Osama Ahmed Bashir Md Asri Ngadi Universiti Teknology Malaysia (UTM) Yahia Abdalla Mohamed Mohamed Awad ABSTRACT This paper proposed
More informationA Generalization of a TCP Model: Multiple Source-Destination Case. with Arbitrary LAN as the Access Network
A Generalization of a TCP Model: Multiple Source-Destination Case with Arbitrary LAN as the Access Network Oleg Gusak and Tu rul Dayar Department of Computer Engineering and Information Science Bilkent
More informationControl Theory Optimization of MECN in Satellite Networks
Control Theory Optimization of MECN in Satellite Networks Arjan Durresi Louisiana State University, USA Department of Computer Science durresi@csc.lsu.edu Mukundan Sridharan, Sriram Chellappan, Raj Jain,
More informationEquation-Based Congestion Control for Unicast Applications. Outline. Introduction. But don t we need TCP? TFRC Goals
Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley AT&T Center for Internet Research (ACIRI) Jitendra Padhye Umass Amherst Jorg Widmer International Computer Science Institute
More informationRECENT advances in the modeling and analysis of TCP/IP networks have led to better understanding of AQM dynamics.
IEEE GLOBECOM 23 Conference Paper; ACM SIGMETRICS 23 Student Poster A Self-Tuning Structure for Adaptation in TCP/AQM Networks 1 Honggang Zhang, C. V. Hollot, Don Towsley and Vishal Misra Abstract Since
More informationStabilizing RED using a Fuzzy Controller
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 27 proceedings. Stabilizing RED using a Fuzzy Controller Jinsheng
More informationCongestion Avoidance
Congestion Avoidance Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks References K. K. Ramakrishnan, Raj Jain, A Binary Feedback Scheme for Congestion
More informationA New Fair Window Algorithm for ECN Capable TCP (New-ECN)
A New Fair Window Algorithm for ECN Capable TCP (New-ECN) Tilo Hamann Department of Digital Communication Systems Technical University of Hamburg-Harburg Hamburg, Germany t.hamann@tu-harburg.de Jean Walrand
More informationCS644 Advanced Networks
What we know so far CS644 Advanced Networks Lecture 6 Beyond TCP Congestion Control Andreas Terzis TCP Congestion control based on AIMD window adjustment [Jac88] Saved Internet from congestion collapse
More informationOn Designing Improved Controllers for AQM Routers Supporting TCP Flows
TO APPEAR IN IEEE INFOCOM 2 On Designing Improved Controllers for AQM Routers Supporting TCP Flows C.V. Hollot, Vishal Misra, Don Towsley and Wei-Bo Gong Abstract In this paper we study a previously developed
More information100 Mbps. 100 Mbps S1 G1 G2. 5 ms 40 ms. 5 ms
The Influence of the Large Bandwidth-Delay Product on TCP Reno, NewReno, and SACK Haewon Lee Λ, Soo-hyeoung Lee, and Yanghee Choi School of Computer Science and Engineering Seoul National University San
More informationThe Scaling Hypothesis: Simplifying the Prediction of Network Performance using Scaled-down Simulations
The Scaling Hypothesis: Simplifying the Prediction of Network Performance using Scaled-down Simulations Konstantinos Psounis, Rong Pan, Balaji Prabhakar, Damon Wischik Stanford Univerity, Cambridge University
More informationCore-Stateless Proportional Fair Queuing for AF Traffic
Core-Stateless Proportional Fair Queuing for AF Traffic Gang Cheng, Kai Xu, Ye Tian, and Nirwan Ansari Advanced Networking Laboratory, Department of Electrical and Computer Engineering, New Jersey Institute
More informationCongestion Control. Andreas Pitsillides University of Cyprus. Congestion control problem
Congestion Control Andreas Pitsillides 1 Congestion control problem growing demand of computer usage requires: efficient ways of managing network traffic to avoid or limit congestion in cases where increases
More informationCongestion Control and Sizing Router Buffers in the Internet
Congestion Control and Sizing Router uffers in the Internet Saverio Mascolo and Francesco Vacirca Abstract The Internet is made of communication links and packet switching nodes named routers. Routers
More informationA rate controller for long-lived TCP flows
A rate controller for long-lived TCP flows Peter Dorfinger 1, Christof Brandauer 2, and Ulrich Hofmann 2 1 Fachhochschule Salzburg, Schillerstrasse 30, A-5020 Salzburg, Austria pdorfing@fh-sbg.ac.at 2
More informationAnalytic End-to-End Estimation for the One-Way Delay and Its Variation
Analytic End-to-End Estimation for the One-Way Delay and Its Variation Jin-Hee Choi and Chuck Yoo Department of Computer Science and Engineering Korea University Email: {jhchoi, hxy}@os.korea.ac.kr Telephone:
More informationA Third Drop Level For TCP-RED Congestion Control Strategy
A Third Drop Level For TCP-RED Congestion Control Strategy Nabhan Hamadneh, Michael Dixon, Peter Cole, and David Murray Abstract This work presents the Risk Threshold RED (RTRED) congestion control strategy
More informationProportional-Integral Active Queue Management with an Anti-Windup Compensator
Conference on Information Sciences and Systems, Princeton University, March, Proportional-Integral Active Queue Management with an Anti-Windup Compensator Hyuk Lim, Kyung-Joon Park, Eun-Chan Park, and
More informationRandom Early Detection Gateways for Congestion Avoidance
Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson Lawrence Berkeley Laboratory University of California floyd@eelblgov van@eelblgov To appear in the August 1993 IEEE/ACM
More informationOn the Transition to a Low Latency TCP/IP Internet
On the Transition to a Low Latency TCP/IP Internet Bartek Wydrowski and Moshe Zukerman ARC Special Research Centre for Ultra-Broadband Information Networks, EEE Department, The University of Melbourne,
More informationRandom Early Detection Gateways for Congestion Avoidance
Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson Lawrence Berkeley Laboratory University of California floyd@eelblgov van@eelblgov To appear in the August 1993 IEEE/ACM
More informationTransmission Control Protocol (TCP)
TETCOS Transmission Control Protocol (TCP) Comparison of TCP Congestion Control Algorithms using NetSim @2017 Tetcos. This document is protected by copyright, all rights reserved Table of Contents 1. Abstract....
More informationAssignment 7: TCP and Congestion Control Due the week of October 29/30, 2015
Assignment 7: TCP and Congestion Control Due the week of October 29/30, 2015 I d like to complete our exploration of TCP by taking a close look at the topic of congestion control in TCP. To prepare for
More informationImproving Internet Congestion Control and Queue Management Algorithms. Wu-chang Feng March 17, 1999 Final Oral Examination
Improving Internet Congestion Control and Queue Management Algorithms Wu-chang Feng March 17, 1999 Final Oral Examination Outline Motivation Congestion control and queue management today (TCP, Drop-tail,
More informationAppendix A. Methodology
193 Appendix A Methodology In this appendix, I present additional details of the evaluation of Sync-TCP described in Chapter 4. In Section A.1, I discuss decisions made in the design of the network configuration.
More informationCongestion Control in TCP
Congestion Control in TCP Antonio Carzaniga Faculty of Informatics University of Lugano May 6, 2005 Outline Intro to congestion control Input rate vs. output throughput Congestion window Congestion avoidance
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More informationHarsh RED: Improving RED for Limited Aggregate Traffic
Harsh : Improving for Limited Aggregate Traffic Ilpo Järvinen, Yi Ding, Aki Nyrhinen and Markku Kojo Department of Computer Science University of Helsinki Helsinki, Finland Email: {firstname.lastname}@cs.helsinki.fi
More informationADVANCED TOPICS FOR CONGESTION CONTROL
ADVANCED TOPICS FOR CONGESTION CONTROL Congestion Control The Internet only functions because TCP s congestion control does an effective job of matching traffic demand to available capacity. TCP s Window
More informationCongestion / Flow Control in TCP
Congestion and Flow Control in 1 Flow Control and Congestion Control Flow control Sender avoids overflow of receiver buffer Congestion control All senders avoid overflow of intermediate network buffers
More informationStability Analysis of a Window-based Flow Control Mechanism for TCP Connections with Different Propagation Delays
Stability Analysis of a Window-based Flow Control Mechanism for TCP Connections with Different Propagation Delays Keiichi Takagaki Hiroyuki Ohsaki Masayuki Murata Graduate School of Engineering Science,
More informationAn Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management
An Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management Srisankar Kunniyur kunniyur@ee.upenn.edu R. Srikant rsrikant@uiuc.edu December 16, 22 Abstract Virtual Queue-based marking schemes
More informationPerformance Consequences of Partial RED Deployment
Performance Consequences of Partial RED Deployment Brian Bowers and Nathan C. Burnett CS740 - Advanced Networks University of Wisconsin - Madison ABSTRACT The Internet is slowly adopting routers utilizing
More informationVariable Step Fluid Simulation for Communication Network
Variable Step Fluid Simulation for Communication Network Hongjoong Kim 1 and Junsoo Lee 2 1 Korea University, Seoul, Korea, hongjoong@korea.ac.kr 2 Sookmyung Women s University, Seoul, Korea, jslee@sookmyung.ac.kr
More informationOscillations and Buffer Overflows in Video Streaming under Non- Negligible Queuing Delay
Oscillations and Buffer Overflows in Video Streaming under Non- Negligible Queuing Delay Presented by Seong-Ryong Kang Yueping Zhang and Dmitri Loguinov Department of Computer Science Texas A&M University
More informationStateless Proportional Bandwidth Allocation
Stateless Proportional Bandwidth Allocation Prasanna K. Jagannathan *a, Arjan Durresi *a, Raj Jain **b a Computer and Information Science Department, The Ohio State University b Nayna Networks, Inc. ABSTRACT
More informationCHOKe - A simple approach for providing Quality of Service through stateless approximation of fair queueing. Technical Report No.
CHOKe - A simple approach for providing Quality of Service through stateless approximation of fair queueing Rong Pan Balaji Prabhakar Technical Report No.: CSL-TR-99-779 March 1999 CHOKe - A simple approach
More informationQOS Section 6. Weighted Random Early Detection (WRED)
QOS Section 6 Weighted Random Early Detection (WRED) The previous section addressed queuing, which is a congestionmanagement QoS mechanism. However, this section focuses on congestion avoidance. Specifically,
More informationInternet Congestion Control for Future High Bandwidth-Delay Product Environments
Internet Congestion Control for Future High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs MIT-LCS ICSI Tellabs dk@mit.edu mjh@icsi.berkeley.edu crhors@mit.edu Abstract Theory
More informationImproving the Ramping Up Behavior of TCP Slow Start
Improving the Ramping Up Behavior of TCP Slow Start Rung-Shiang Cheng, Hui-Tang Lin, Wen-Shyang Hwang, Ce-Kuen Shieh Department of Electrical Engineering, National Cheng Kung University, Taiwan chengrs@hpds.ee.ncku.edu.tw
More informationRouter participation in Congestion Control. Techniques Random Early Detection Explicit Congestion Notification
Router participation in Congestion Control 1 Techniques Random Early Detection Explicit Congestion Notification 68 2 Early congestion notifications Early notifications inform end-systems that the network
More informationResearch Letter A Simple Mechanism for Throttling High-Bandwidth Flows
Hindawi Publishing Corporation Research Letters in Communications Volume 28, Article ID 74878, 5 pages doi:11155/28/74878 Research Letter A Simple Mechanism for Throttling High-Bandwidth Flows Chia-Wei
More informationTCP Congestion Control : Computer Networking. Introduction to TCP. Key Things You Should Know Already. Congestion Control RED
TCP Congestion Control 15-744: Computer Networking L-4 TCP Congestion Control RED Assigned Reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [TFRC] Equation-Based Congestion Control
More informationNetwork Simulator Project Guidelines Introduction
Network Simulator Project Guidelines Introduction Project TAs: Ruijia Sun (rsun@caltech.edu), Zilong Chen (zcchen@caltech.edu) During the CS143 course, you will learn about the mechanics of communication
More information15-744: Computer Networking TCP
15-744: Computer Networking TCP Congestion Control Congestion Control Assigned Reading [Jacobson and Karels] Congestion Avoidance and Control [TFRC] Equation-Based Congestion Control for Unicast Applications
More informationInvestigating the Use of Synchronized Clocks in TCP Congestion Control
Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle Dissertation Defense May 14, 2003 Advisor: Kevin Jeffay Research Question Can the use of exact timing information improve
More informationOn the Burstiness of the TCP Congestion-Control Mechanism in a Distributed Computing System
Proceedings of the 2th International Conference on Distributed Computing Systems (ICDCS 2). On the Burstiness of the TCP Congestion-Control Mechanism in a Distributed Computing System Peerapol Tinnakornsrisuphap,
More informationCongestion Control In the Network
Congestion Control In the Network Brighten Godfrey cs598pbg September 9 2010 Slides courtesy Ion Stoica with adaptation by Brighten Today Fair queueing XCP Announcements Problem: no isolation between flows
More informationOscillation of RED with 2way TCP bulk data traffic
First Author: Oscillation of RED with way TCP bulk data traffic Thomas Ziegler, Salzburg Polytechnic University; Thomas.Ziegler@fh-sbg.ac.at Second Author: Bernhard Hechenleitner, Salzburg Polytechnic
More informationThe Variation in RTT of Smooth TCP
The Variation in RTT of Smooth TCP Elvis Vieira and Michael Bauer University of Western Ontario {elvis,bauer}@csd.uwo.ca Abstract Due to the way of Standard TCP is defined, it inherently provokes variation
More informationThe Fluid Flow Approximation of the TCP Vegas and Reno Congestion Control Mechanism
The Fluid Flow Approximation of the TCP Vegas and Reno Congestion Control Mechanism Adam Domański 2, Joanna Domańska 1, Michele Pagano 3, and Tadeusz Czachórski 1(B) 1 Institute of Theoretical and Applied
More informationAn Enhanced Slow-Start Mechanism for TCP Vegas
An Enhanced Slow-Start Mechanism for TCP Vegas Cheng-Yuan Ho a, Yi-Cheng Chan b, and Yaw-Chung Chen a a Department of Computer Science and Information Engineering National Chiao Tung University b Department
More informationPERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK
I.J.E.M.S., VOL.2 (3) 211: 163-171 ISSN 2229-6X PERFORMANCE ANALYSIS OF AF IN CONSIDERING LINK UTILISATION BY SIMULATION Jai Kumar and U.C. Jaiswal Department of Computer Science and Engineering, Madan
More informationReliable Transport II: TCP and Congestion Control
Reliable Transport II: TCP and Congestion Control Stefano Vissicchio UCL Computer Science COMP0023 Recap: Last Lecture Transport Concepts Layering context Transport goals Transport mechanisms and design
More informationTraffic Management using Multilevel Explicit Congestion Notification
Traffic Management using Multilevel Explicit Congestion Notification Arjan Durresi, Mukundan Sridharan, Chunlei Liu, Mukul Goyal Department of Computer and Information Science The Ohio State University
More information