A New TCP-Friendly Rate Control Algorithm for Scalable Video Streams.
|
|
- Caitlin Nash
- 5 years ago
- Views:
Transcription
1 See discussions, stats, and author profiles for this publication at: A New TCP-Friendly Rate Control Algorithm for Scalable Video Streams. CONFERENCE PAPER in LECTURE NOTES IN COMPUTER SCIENCE JANUARY 2005 Impact Factor: 0.51 DOI: / _107 Source: DBLP CITATIONS 3 READS 44 4 AUTHORS: Jinyao Yan Communication University of China 30 PUBLICATIONS 106 CITATIONS Martin May Technicolor 94 PUBLICATIONS 2,585 CITATIONS SEE PROFILE SEE PROFILE Kostas Katrinis IBM 57 PUBLICATIONS 290 CITATIONS Bernhard Plattner ETH Zurich 260 PUBLICATIONS 4,371 CITATIONS SEE PROFILE SEE PROFILE Available from: Bernhard Plattner Retrieved on: 08 April 2016
2 A new TCP-friendly Rate Control Algorithm for Scalable Video Streams Jinyao Yan 1,2, Martin May 1, Kostas Katrinis 1, Bernhard Plattner 1 1 Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology,ETH Zurich, Switzerland 2 Communication University of China, Beijing, China jinyao, maym, katrinis, plattner@tik.ee.ethz.ch Abstract. This paper presents a new TCP-friendly rate control algorithm (i.e., MTFRC) for streaming media applications in the Internet. This algorithm integrates two new techniques: (i) the use of an application-utility function into the rate control algorithm; and (ii) a two-time-scale approach of rate averages (long-term and short-term) to satisfy TCP and application/media-friendliness. We use simulations and video quality measurement to evaluate the algorithm and compare the results with the commonly used TCP-Friendly Rate Control (TFRC) methods. We define five criteria to evaluate the two approaches, namely TCP fairness, responsiveness, aggressiveness, video quality, and the smoothness of the resulting bit rate. Simulation studies confirm that MTFRC, due to the two long and short-term averages, performs better in the different environments than TFRC and improves the overall video quality. 1 Introduction Today s dominant transport protocol, TCP, reacts to packet loss by controlling the number of outstanding unacknowledged data segments allowed in the network. In steady state, TCP uses an additive increase multiplicative decrease mechanism (AIMD) to detect additional available bandwidth and to react to congestion. TCP congestion control is suitable and efficient for bulk data transfers. However, it is not well suited for the growing number of audio/video streaming applications. Indeed, without congestion control, non-tcp traffic could cause starvation or even congestion collapse for TCP traffic if both types of traffic were competing for resources at a congested FIFO queue [1]. As a result, new TCP-compatible congestion control mechanisms [2] [3] were proposed for audio/video streaming applications in order to handle competing dominant TCP-flows in a fair manner and limit the variation of throughput accorded to the application (smoothed throughput). These mechanisms have two important characteristics in common: (i) slow responsiveness to smooth the throughput; and (ii) TCP-friendliness. TCP-friendliness is defined as a flow that, in steady-state, uses no more bandwidth than a conforming TCP flow running under comparable conditions [1].
3 TCP-Friendly Rate Control (TFRC) [2] is an equation-based congestion control mechanism that uses the TCP throughput function presented in [4]. Previous work [5] [6] shows that TFRC offers better performance than other responsive congestion control protocols, in terms of a) the smoothness of the sending rate, b) the responsiveness, and c) the aggressiveness with regard to the network resource utilization. But, there is a fundamental shortcoming of the existing rate based congestion control protocols: they are optimizing the consumption of network resources only and do not take the resulting application quality into account. Even though TFRC can smooth the rate variability for video streaming, it does not minimize the distortion of the streamed video or, in others words, does not maximize the video quality. To minimize the video stream distortion (or maximize the video quality), we introduced in our previous work [7] the video quality function of scalable video streams as the utility function into the utility-based network model. We derived the optimal throughput response function to maximize the overall video quality for scalable video streams (see Appendix). Based on this throughput function, we design a new rate control algorithm called MTFRC (Media- and TCP-friendly Rate Control Algorithm). Given a system with scalable video streaming sources, receivers and links, the difficulty is to allocate a rate value to each source that it is both TCP- and media-friendly. A media-friendly rate control algorithm is defined in a way that it optimizes the overall video quality for the video streams in the network. The main contribution of this paper is development of the TCP-friendly MT- FRC algorithm, which performs better with scalable video streams than TFRC. It optimizes the overall video quality, while maintaining TCP friendliness in long term. We use MPEG-4 Fine-Granularity Scalable (FGS) coding [8] as an example of scalable video coding technology. FGS video streams can be dynamically adapted to the varying condition of the network by truncating them to any desired bit rate determined by underlying rate control protocols like TFRC. FGS coding allows for using a continuous rate-distortion function at the receiver or relay, instead of the step-like function yielded by layered encoding techniques. The paper is organized as follows. In section 2, we review the related work; Section 3 analyzes and describes the new TCP-friendly rate control algorithm for scalable video streams. Then, we analyze the results of our simulations in section 4 and conclude the paper in section 5. 2 Related Work Rate control for video streaming has a two-fold mission, performing rate adaptation for streaming applications and performing rate-based congestion control. Several bit rate control methods have been developed for multimedia streaming, and recently also for FGS video streaming [9] [10] [11] [12]. In [11], the author derives an optimal policy for maximizing bandwidth efficiency and minimizing bit rate variability (instead of video quality) using a prefetch buffer. In [10], the authors develop an optimal adaptation scheme and an online heuristic to mini-
4 mize the quality variability by accommodating the mismatch caused both by the available bandwidth variability and the encoded video variability. In [12], sets of rate-distortion (R-D) points are extracted during the encoding process and linear interpolation is employed to estimate the actual R-D curve of the enhancement layer signal. The extracted R-D information is then used to determine the bit allocation per frame for constant quality. Rate control in the above-mentioned publications is understood as rate adaptation in application without exceeding the maximum rate communicated by underlying layers like TFRC or TCP. On the other hand, research activities have focused on end-to-end rate based congestion control algorithms such as TFRC, over which most scalable video nowadays is streamed. In [3] [2] [5], rate control algorithms are designed to be TCP-friendly however, without consideration for application or media-friendliness. A utility-based network model for resource allocation has been explored in the field of unicast rate control algorithms in [13]. In this model, a price is associated with each individual network link (congestion control information). The link iteratively updates its price based on the aggregate rate of flows traversing it. The receiver in turn collects the prices of all links on its unicast/multicast path and calculates the overall network price. Then, it adjusts the streaming rate so that its net benefit, the receiver utility minus the network cost, is maximized. It is shown that this iterative algorithm converges to the optimal point, where the aggregate utility of all receivers is maximized. We studied this price model and used it to solve our formulated problem in our previous work [7] (see also appendix). FSRC, the rate-based congestion control algorithm introduced in [7] optimizes both, the quality of streaming application and the consumption of network resources. We model the relation between the video quality of FGS video and its sending bit rate. Then, we introduce the resulting video quality of as the utility function to the utility-based network model. Specifically, maximizing the utility equals to maximizing the video quality in the network. Unlike TFRC, FSRC s rate control algorithm is not related to network congestion measures only to meet network friendliness, but also related to the application benefit, such as the video quality, to meet the media-friendliness criteria. In our previous work, we have shown that the video quality based on FSRC rate control algorithm is superior to the quality obtained with other rate control protocols like TFRC. However, the proposed FSRC algorithm was not TCP-friendly during periods of severe congestion. In this paper, we will improve FSRC to be a TCP-friendly rate control algorithm: improved TCP-friendly MTFRC. The idea is that we calculate the long-term rate according to the long-term congestion information to meet the TCP-friendliness, and the sending rate reacts to the short-term congestion concerning the rate-distortion function of FGS video like MTFRC.
5 3 Media- and TCP-Friendly Rate Control Algorithm In this section, we describe the basics of our MTFRC algorithm and how we address the problem of long-term TCP-friendliness. First, we explain the throughput response function, i.e., the algorithm used to determine the sending rate. 3.1 Deriving the throughput function The throughput response function of our MTFRC algorithm is derived from the price model described in [13]. For our model, we used the rate-quality function from the FGS video stream as utility function as described in [7]. The source rate x s is determined by p (the end-to-end packet loss rate) and the parameters of the rate-distortion function. Hence, we define the throughput response function of our MTFRC algorithm as follows: log x(p) =( 2 ( p a ln 2 ) c a a + b2 4a 2 b 2a )2 (1) The throughput of TCP depends mainly on the parameters round-trip time t RT T, retransmission timeout value t RT O, segment size s, andpacket loss rate p. Using these parameters, an estimate of TCP s throughput function Eq. (2) was derived in [4]. To behave TCP-friendly, the TFRC protocol adjusts its sending rate based on the TCP throughput equation shown in Eq. (2). A major advantage of TFRC is that it has a relatively stable sending rate while still providing sufficient responsiveness to competing traffic. x(p) = 2p R 3 + t RT O(3 s 3p 8 ) p(1 + 32p2 ) (2) 3.2 Discussion on TCP-friendliness in MTFRC The MTFRC algorithm is network friendly and fair to each source under the condition that every streaming source in the network uses the same throughput response function Eq. (1). But, MTFRC and TCP act with different response functions when they co-exist in the network. Figure 1 plots an example bit rate response function of MTFRC and TCP or TFRC (note that TCP and TFRC use the same response function (2) in steady state). Figure 1 shows that when MTFRC and TCP flows co-exist in the network, MTFRC is not as aggressive as TFRC during periods of small congestion. However, during periods of severe congestion, MTFRC reduces the bit rate slower than TFRC; thus MTFRC is not TCP-friendly during this period. To overcome this shortcoming of our algorithm, we describe next how the mechanism can be adopted to achieve both goals: TCP- and media-friendliness.
6 Fig. 1. Comparison of the rate response function for TFRC and MTFRC 3.3 Transform MTFRC into a TCP-friendly Rate Control Algorithm When two traffic flows compete for resources at the same network bottleneck, both flows will only obtain a fair share of the bandwidth if both flows apply similar long-term response functions. In order to meet TCP-friendliness with our MTFRC algorithm, we modify the algorithm as follows: 1. The sender (or receiver) estimates two congestion control parameters (packet loss rates): the long-term packet loss rate p L, and the short-term packet loss rate p S. 2. The server calculates its long-term sending rate using the long-term packet loss rate p L according to the TFRC response function to meet the TCPfriendliness. However, the server reacts to the short-term congestion information p S according to our new MTFRC response function (1) to meet the media-friendliness and to achieve optimized overall video quality. Let the rate response function of MTFRC Eq. (1) be denoted by X MTFRC (p); and let the rate response function of TFRC Eq. (2) be denoted by X TFRC (p). Then, the rate response function of our improved TCP-friendly MTFRC is: X MTFRC (p S )=X TFRC (p L )+X MTFRC(p L ) (p S p L ) (3) Alternatively, one can adjust the parameters a, b, orc in Eq. (1) to achieve X MTFRC (p L )=X TFRC (p L ). Then, sending rate X MTFRC(pS) can be determined using the same values for a, b, orc. 4 Simulations and Analysis 4.1 Description of Simulation Setup For our studies, we use the ns2 network simulator [14]. The scenario implemented throughout our simulations is illustrated in Figure 2. Physical links are marked
7 with propagation delay and bandwidth. To evaluate our algorithm, we designed a network topology with two bottleneck links, each of a capacity of 2 Mbps. All other links have a capacity of 10 Mbps, introducing 10ms delay. Three FGS video streaming servers (node 3, 5 and 7) as well as three FGS video streaming clients (node 4, 6 and 8) are plotted as connections 1,2 and 3 as shown in figure 2. The FGS video servers dynamically adapt the sending rate by truncating it to any desired bit rate determined by the underlying rate control protocol (MTFRC or TFRC). Connection 4, between node 9 and node 10, will be used to verify TCP-friendliness as well as to inject heavy cross traffic into the network (sending CBR traffic) in order to decrease the available bandwidth (discussed in section 4.2). Fig. 2. Network Topology of the simulation environment 4.2 Results and Analysis In this section, we present the results obtained from simulations we conducted to evaluate our MTFRC algorithm, compared to TFRC. For evaluation, we identified the following five criteria: 1) Fairness: variations over the sending rates of competing flows; 2) Responsiveness: reaction time of the protocol to decrease the sending rate if severe network congestion occurs; 3) Aggressiveness: acceleration of protocol sending rate after congestion (increase of the available bandwidth); 4) Smoothness: rate variations over time for a particular flow in a stationary or dynamic environment; and 5) Overall FGS video quality. Fairness, responsiveness and aggressiveness stand for the friendliness of the algorithm with regard to the network. The last 2 properties (smoothness and video quality) stand for the friendliness of the algorithm with regard to the application quality. Paper [2] suggests a window size of N=8 as a default value for loss history size in TFRC, i.e. TFRC(8). While in order to achieve smoother rates, authors in [5] and [15] suggest to set the history size to N=128, i.e. TFRC(128). In this paper, we will compare the characteristics of our proposed MTFRC algorithm to the properties of TFRC(8) and TFRC(128). For MTFRC as used in the simulation study, we use a long-term history size of N L =256 and a short-term history size of N s =8, i.e. MTFRC (256, 8). The method used to calculate the loss event rate
8 in MTFRC is the same as the Weighted Average Loss Interval (WALI) method applied in TFRC. TCP fairness Conn. 1 and 4 encounter comparable conditions, since both of them go through the same 2 bottlenecks and both have the same round trip time. To examine TCP-friendliness, we run one single TCP connection on conn. 1 and one single video stream on conn. 4 using TFRC (in Figure 3(a))or MTFRC (in Figure 3(b)). The throughput obtained with TFRC and MTFRC is plotted in Figure 3(a) and 3(b). (a) (b) Fig. 3. TCP fairness of TFRC (a) and MTFRC (b) with noise (Connection 1 with TCP, Connection 4 with TFRC(8) and MTFRC(256,8) ) We add background traffic (5 Pareto ON/OFF flows, each with a mean sending rate of 100kbps) to the network traffic running over the two bottlenecks. Figure 3(a) and Figure 3(b) indicate that both, TFRC and MTFRC, are TCPfriendly, since the long-term throughput of TFRC and MTFRC is roughly equal to that of the TCP connections. The average bandwidth-share ratio of TFRC to TCP (from the 0th to the 100th second) is 0.82 (see Figure 3(a)) and 0.83 with MTFRC (see Figure 3(b)). The intra protocol fairness of MTFRC will be examined in the following subsection and is in illustrated in Figure 4(b). Responsiveness, Aggressiveness and Smoothness The next 3 figures (Fig. 4(a), Fig. 4(b), and Fig. 4(c)) plot the bit rate evolution of the two protocols in the event of severe network congestion and sudden increase of bandwidth. We use a CBR source (sending rate: 1Mbps) on conn. 4 to decrease the bandwidth at the 60th second (severe network congestion) and to increase the available bandwidth at the 120th second. From the sending rate traces of the plotted connections in Figures 4(a), 4(b), 4(c), we follow that: (i) The sending rate obtained with MTFRC is smoother than
9 (a) (b) (c) Fig. 4. Bit rate traces of connection 1, 2 and 3 with TFRC(8) (a), MTFRC(256,9) (b), and TFRC(128)(c) the one obtained with TFRC(8) and similar to that obtained with TFRC(128); (ii) the aggressiveness of MTFRC is better than TFRC(128) and close to TFRC(8); (iii) the responsiveness with MTFRC is better than with TFRC(128), but less responsive than TFRC(8). More generally, we conclude that the intra protocol fairness of MTFRC is similar to that of TFRC in steady state (before 60th second). But after 60th second, the short-term response function takes effect and MTFRC reallocates the bit rate differently to TFRC. The MTFRC algorithm penalizes conn. 1 with higher packet loss and assigns higher bit rates to the two short conn. 2 and 3, which suffer less packet losses (as shown in figure 4(b)). Comparing with TFRC, the MTFRC algorithm re-allocates the bit rates between the streaming connections after steep increase or decrease of bandwidth with the goal to improve the total video quality of all streaming connections. The bit rate of conn. 2 is roughly similar to the bit rate of conn. 3 since both encounter comparable packet loss rates on similar network topologies.
10 Smoothness The goal of TFRC and other responsive congestion control algorithms is to smooth the sending rates. The variability metric of the sending rate is used to analyze how often and to what extent a protocol changes its sending rate. The smaller the variability of a flow, the better is its media-friendliness and the more resilient it is to network traffic noise. The average rate variability is defined as the average, relative change of the sending rate in two consecutive round-trip times. In this simulation, the average rate variability of TFRC(8), TFRC(128) and MTFRC(256, 8) are respectively 0.041, and Hence, the sending rate obtained with MTFRC is smoother than that obtained with TFRC(8) and roughly equal to that obtained with TFRC(128). Responsiveness The following figure plots the dropped-bit rate of each protocol at router 0 when the network congestion is suddenly increased at the 60th second of the simulation. We define the stabilization time as the time, between the start of the severe network congestion and the moment, when the network loss rate converges to the typical steady-state value for such level of congestion. Fig. 5. Responsiveness of MTFRC and TFRC to a sudden decrease of the available bandwidth We compare the stabilization time measured with the TFRC algorithm to that measured with MTFRC algorithms. Longer stabilization times indicate suboptimal congestion control algorithms, due to their longer periods of congestion in case of a sudden decrease in the available bandwidth [5] (i.e., algorithms are less responsive). In this simulation study, stabilization time of TFRC(8), TFRC(128) and MTFRC(256, 8) are respectively 3 seconds, 16 seconds and 9 seconds. Hence, the responsiveness of MTFRC is better than TFRC(128), but slower responsive than TFRC(8). We also observe that MTFRC has less oscillation of packet loss than TFRC(8) and TFRC(128) in steady state.
11 Aggressiveness The next figure shows the utilization of bandwidth after the sudden increase of available bandwidth at the 120th second. We define the recovery time as the time, between the moment when the new bandwidth is available, and the time until the newly available bandwidth is occupied. We compare the Fig. 6. Aggressiveness of MTFRC and TFRC to a sudden increase of the available bandwidth recovery time of TFRC with that of MTFRC algorithms. Longer recovery time indicate congestion control algorithms that suffers longer than necessary periods of bandwidth under-utilization after a sudden increase in available bandwidth (i.e., algorithms are less aggressive). We measured recovery time for TFRC(8), TFRC(128) and MTFRC(256, 8) with respectively 5 seconds, 19.5 seconds and 13.5 seconds. We conclude that in terms of aggressiveness MTFRC performs between TFRC(128) and TFRC(8). Overall FGS video quality We apply the obtained sending rate traces of the simulated network connections to FGS video scaling and compare the resulting video quality (luminance component) obtained with the MTFRC algorithm with that achieved by TFRC (depicted in the following table 1) for different streaming examples. 4.3 Summary of evaluation results In table 2, we summarize the results of our evaluation. Overall, our improved TCP-friendly rate control algorithm (MTFRC) offers the best tradeoff between network- and media-friendliness.
12 Measurement Results from Video Sequence Highway Connection 1 Connection 2 Connection 3 PSNR over MTFRC PSNR over TFRC Total quality gain Increase of PSNR over MTFRC=0.71 Measurement Results from Video Sequence Akiyo PSNR over MTFRC PSNR over TFRC Total quality gain Increase of PSNR over MTFRC= 0.67 Measurement Results from a long Video Sequence Highway PSNR and its variance with MTFRC σ = σ = σ = PSNR and its variance with TFRC σ = σ = σ = Total quality gain Increase of PSNR over MTFRC=1.7 Table 1. Rate traces from different video stream examples. (PSNR: Peak Signal-to- Noise Ratio) MTFRC(256,8) TFRC(8) TFRC(128) Fairness to TCP all algorithms are TCP-friendly Smoothness of bit rate Smoother than Smooth bit rate Smoother TFRC(8), roughly than TFRC(8) same as TFRC (128) similar to MTFRC Responsiveness Middle Fast Slow Aggressiveness Faster than Faster than Slower than TFRC (128), slower TFRC (128) TFRC(8) and MTFRC than TFRC(8) and MTFRC Video quality Better video quality Similar quality Similar quality (8) than TFRC (8) to TFRC (128) to TFRC and TFRC(128) worse than MTFRC worse than MTFRC Table 2. Summary of the simulation results 5 Conclusion and future work In this paper, we studied a new, optimized, TCP-friendly rate control algorithm for scalable video streams. We modified our previous work, which improved the global video quality of scalable streaming sources, to be conforming to the TCPfriendly rate control protocol. The resulting algorithm introduces two interesting new features to rate control: (i) the integration of an application-utility function into the rate control algorithm; and (ii) a two-time-scale approach of rate averages (long-term and short-term) to satisfy TCP and application/mediafriendliness. Using simulations, we showed that our algorithm is TCP-friendly and achieves an improved network-friendly behavior (evaluated in terms of responsiveness, aggressiveness and fairness). We also measured the media-friendliness of our
13 algorithm in terms of sending rate smoothness and video quality. Results confirm that our protocol outperforms standard TFRC algorithms while being more flexible due to the use of two rate averages. We will continue to evaluate our algorithm in more generalized simulation scenarios, and implement the algorithm in existing streaming applications. Finally, we will conduct additional experiments to explore the performance of our proposed algorithm on the Internet and on PlanetLab. References 1. Sally Floyd and Kevin Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Transactions on Networking, vol. 7, Sally Floyd, Mark Handley, Jitendra Padhye, and Jorg Widmer, Equation-based congestion control for unicast applications, in Proceedings of SIGCOMM, Stockholm, Sweden, August 2000, pp Deepak Bansal and Hari Balakrishnan, Binomial congestion control algorithms, in INFOCOM, 2001, pp J. Padhye, J. Kurose, D. Towsley, and R. Koodli, A model based TCP-friendly rate control protocol, UMass-CMPSCI Technical Report TR 98-04, D. Bansal, H. Balakrishnan, S. Floyd, and S. Shenker, Dynamic behavior of slowly-responsive congestion control algorithms, Proceedings of ACM SIGCOMM, Yang Richard Yang, Min Sik Kim, and Simon S. Lam, Transient behaviors of TCP-friendly congestion control protocols, in INFOCOM, 2001, pp Jinyao Yan, K. Katrinis, M. May, and B. Plattner, Optimizing rate control for multiple fine-granular scalable video streams, Proceedings of ICNP 2004, W. Li, Overview of fine granularity scalability in mpeg-4 video standard, in Transactions on Circuits and Systems for Video Technology, Philippe De Cuetos, Unified framework for optimal video streaming,. 10. T. Kim and M. Ammar, Optimal quality adaptation for mpeg-4 fine-grained scalable video, in Proceedings of IEEE INFOCOM, Philippe de Cuetos and Keith W Ross, Adaptive rate control for streaming stored fine-grained scalable video, in Proceedings of NOSSDAV 02, May Xi Min Zhang, Anthony Vetro, Yun-Qing Shi, and Huifang Sun, Constant-quality constrained-rate allocation for fgs video coded bitstreams., in VCIP, 2002, pp Steven H. Low and David E. Lapsley, Optimization flow control I: basic algorithm and convergence, IEEE/ACM Transactions on Networking, vol. 7, no. 6, pp , ns-2 network simulator, Zhiheng Wang, Sujata Banerjee, and Sugih Jamin, Media-friendliness of a slowlyresponsive congestion control protocol, in Proceedings of NOSSDAV. 2004, pp , ACM Press. 16. Seong ryong Kang, Yueping Zhang, Min Dai, and Dmitri Loguinov, Multi-layer active queue management and congestion control for scalable video streaming, in Proceedings of ICDCS , pp , IEEE Computer Society.
14 A Appendix A.1 Network model We use the model proposed in [13], where the network consists of a set L of unidirectional links of capacities c l, l L. The network is shared by a set S of sources. U s (x s ) is the utility of source s when s transmits at rate x s.let I s =[m s,m s ] denote the range of rate x s for a source s. We assume that U s is strictly increasing and concave, and twice continuously differentiable on s.for each link l let S(l) ={s S l L(s)} be the set of sources that use link l. Our objective is to choose source rates x s so as to maximize the overall utility in the network: subject to max m x M s S(l) U s (x s ) (4) s x s c l l L (5) A.2 Model for the FGS video In [16], the authors propose the mixture-laplacian statistical model of FGS video data and derived the rate-distortion function for FGS video as follow: D(R) =2 ar+b R+c (6) A.3 Throughput response function of the MTFRC algorithm Solving the dual problem of Eq. (4) we get: x s (p) =[U s 1 (p)] Ms m s (7) p being the aggregate Lagrangian multiplier (congestion control information). We set U s (x s )= D s (x s ) in Eq. (7). The responses function of MTFRC: x s (p) =[( log 2 p aln2 a c a + b2 4a 2 b 2a )2 ] Ms m s (8) The source sending rate x s is determined by aggregate congestion control information p and the parameters of the rate-distortion function of FGS video streams. We make an assumption that loss probabilities p l are small so that the end-to-end probabilities p e for all sources and for all t is: p e (t) =1 l (1 p l ) l p l = p (9) Practically, we use end-to-end probabilities p e as p to update the rate.
An Evaluation of Adaptive Multimedia Communication from a QoS Perspective
U Linz Telekooperation - 1 An Evaluation of Adaptive Multimedia Communication from a QoS Perspective Michael Welzl Johannes Kepler University Linz / Austria Max Mühlhäuser TU Darmstadt Germany U Linz Telekooperation
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 informationStreaming Video and TCP-Friendly Congestion Control
Streaming Video and TCP-Friendly Congestion Control Sugih Jamin Department of EECS University of Michigan jamin@eecs.umich.edu Joint work with: Zhiheng Wang (UofM), Sujata Banerjee (HP Labs) Video Application
More informationSally Floyd, Mark Handley, and Jitendra Padhye. Sept. 4-6, 2000
A Comparison of Equation-Based and AIMD Congestion Control Sally Floyd, Mark Handley, and Jitendra Padhye Sept. 4-6, 2 Workshop on the Modeling of Congestion Control Algorithms Paris 1 Why look at non-tcp
More informationMaVIS: Media-aware Video Streaming Mechanism
MaVIS: Media-aware Video Streaming Mechanism Sunhun Lee and Kwangsue Chung School of Electronics Engineering, Kwangwoon University, Korea sunlee@adamskwackr and kchung@kwackr Abstract Existing streaming
More informationThe Minimal Buffering Requirements of Congestion Controlled Interactive Multimedia Applications
The Minimal Buffering Requirements of Congestion Controlled Interactive Multimedia Applications Kang Li 1, Charles Krasic 1, Jonathan Walpole 1, Molly H.Shor 2, and Calton Pu 3 1 Oregon Graduate Institute,
More informationCongestion Control. COSC 6590 Week 2 Presentation By Arjun Chopra, Kashif Ali and Mark Obsniuk
Congestion Control COSC 6590 Week 2 Presentation By Arjun Chopra, Kashif Ali and Mark Obsniuk Topics Congestion control TCP and the internet AIMD congestion control Equation Based congestion control Comparison
More informationIncrease-Decrease Congestion Control for Real-time Streaming: Scalability
Increase-Decrease Congestion Control for Real-time Streaming: Scalability Dmitri Loguinov City University of New York Hayder Radha Michigan State University 1 Motivation Current Internet video streaming
More informationRED 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 informationA SURVEY ON VIDEO STREAMING OVER MULTIMEDIA NETWORKS USING TCP
A SURVEY ON VIDEO STREAMING OVER MULTIMEDIA NETWORKS USING TCP U.RAHAMATHUNNISA 1, DR.R.SARAVANAN 2, 1 Assistant Professor, SITE, VIT university, Vellore. 2 Sr. Professor, SITE, VIT university, Vellore
More informationMedia-Aware Rate Control
Media-Aware Rate Control Zhiheng Wang zhihengw@eecs.umich.edu University of Michigan Ann Arbor, MI 4819 Sujata Banerjee sujata@hpl.hp.com Hewlett-Packard Laboratories Palo Alto, CA 9434 Sugih Jamin jamin@eecs.umich.edu
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 informationAIO-TFRC: A Light-weight Rate Control Scheme for Streaming over Wireless
AIO-TFRC: A Light-weight Rate Control Scheme for Streaming over Wireless Minghua Chen and Avideh Zakhor Department of Electrical Engineering and Computer Sciences University of California at Berkeley,
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 informationVideo Streaming in Wireless Environments
Video Streaming in Wireless Environments Manoj Kumar C Advisor Prof. Sridhar Iyer Kanwal Rekhi School of Information Technology Indian Institute of Technology, Bombay Mumbai 1 Motivation Refers to real-time
More informationAN IMPROVED STEP IN MULTICAST CONGESTION CONTROL OF COMPUTER NETWORKS
AN IMPROVED STEP IN MULTICAST CONGESTION CONTROL OF COMPUTER NETWORKS Shaikh Shariful Habib Assistant Professor, Computer Science & Engineering department International Islamic University Chittagong Bangladesh
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks George Porter Thanks: Amin Vahdat, Dina Katabi and Alex C. Snoeren Lecture 14 Overview" TCP congestion control review Dukkipati
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 Yueping Zhang and Dmitri Loguinov Department of Computer Science Texas A&M University, College Station, TX 77843
More informationThe Interrelation of TCP Responsiveness and Smoothness in Heterogeneous Networks
The Interrelation of TCP Responsiveness and Smoothness in Heterogeneous Networks C. Zhang and V. Tsaoussidis College of Computer Science, Northeastern University Boston, MA 02115, USA {czhang, vassilis}@ccs.neu.edu
More informationTCP-friendly SIMD Congestion Control and Its Convergence Behavior Λ
TCP-friendly SIMD Congestion Control and Its Convergence Behavior Λ Shudong Jin Liang Guo Ibrahim Matta Azer Bestavros Computer Science Department Boston University Boston, MA, USA fjins,guol,matta,bestg@cs.bu.edu
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 informationA Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in Peng Wang David L. Mills Department of Electrical & Computer Engineering University of Delaware Newark, DE 976 pwangee@udel.edu; mills@eecis.udel.edu
More informationEquation-Based Congestion Control for Unicast Applications: the Extended Version
I 1947 Center St. Suite 6 Berkeley, California 9474-1198 (1) 666-29 FAX (1) 666-2983 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Equation-Based Congestion Control for Unicast Applications: the Extended Version
More informationEquation-Based Congestion Control for Unicast Applications
Equation-Based Congestion Control for Unicast Applications Sally Floyd, Mark Handley AT&T Center for Internet Research at ICSI (ACIRI) Jörg Widmer International Computer Science Institute (ICSI) February
More informationOn TCP-friendly Video Transfer
On -friendly Video Transfer Naoki Wakamiya, Masayuki Murata, Hideo Miyahara Graduate School of Engineering Science, Osaka University - Machikaneyama, Toyonaka, Osaka -, JAPAN wakamiya@ics.es.osaka-u.ac.jp
More informationIN a shared network such as the Internet, end systems should
IN PROCEEDINGS OF IEEE INFOCOM 2, APRIL 2. Transient Behaviors of -friendly Congestion Control Protocols Yang Richard Yang, Min Sik Kim, Simon S. Lam Department of Computer Sciences The University of Texas
More informationGeneral AIMD Congestion Control Λ
General AIMD Congestion Control Λ E-mail: Yang Richard Yang, Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, TX 787-88 fyangyang,lamg@cs.utexas.edu Abstract Instead
More informationTwo Problems of TCP AIMD Congestion Control
Two Problems of TCP AIMD Congestion Control Yang Richard Yang, Min Sik Kim, Xincheng Zhang, Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, TX 7872 88 yangyang,minskim,zxc,lam@cs.utexas.edu
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 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 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 informationTuning RED for Web Traffic
Tuning RED for Web Traffic Mikkel Christiansen, Kevin Jeffay, David Ott, Donelson Smith UNC, Chapel Hill SIGCOMM 2000, Stockholm subsequently IEEE/ACM Transactions on Networking Vol. 9, No. 3 (June 2001)
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 informationTFRC and RTT Thresholds Interdependence in a Selective Retransmission Scheme
TFRC and RTT s Interdependence in a Selective Retransmission Scheme Árpád Huszák, Sándor Imre Budapest University of Technology and Economics, Department of Telecommunications Budapest, Hungary Email:
More informationImpact of Short-lived TCP Flows on TCP Link Utilization over 10Gbps High-speed Networks
Impact of Short-lived TCP Flows on TCP Link Utilization over Gbps High-speed Networks Lin Xue, Chui-hui Chiu, and Seung-Jong Park Department of Computer Science, Center for Computation & Technology, Louisiana
More informationPerformance Evaluation of End-to-End TCP-friendly Video Transfer in the Internet
Performance Evaluation of End-to-End TCP-friendly Video Transfer in the Internet Suhaidi Hassan and Mourad Kara ATM-Multimedia Research Group School of Computing, University of Leeds Leeds LS2 9JT, United
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 informationTCP-friendly video transfer
-friendly video transfer Naoki Wakamiya, Masayuki Murata, Hideo Miyahara Graduate School of Engineering Science, Osaka University -3 Machikaneyama, Toyonaka, Osaka -3, JAPAN ABSTRACT When both and UDP
More informationEquation-Based Congestion Control for Unicast Applications
University of Massachusetts Amherst ScholarWorks@UMass Amherst Computer Science Department Faculty Publication Series Computer Science 2 Equation-Based Congestion Control for Unicast Applications Jitendra
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 informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Amin Vahdat, Dina Katabi Lecture 14 Overview" TCP congestion control review XCP Overview 2 Congestion Control
More informationAPPLICABILITY OF TCP-FRIENDLY PROTOCOLS FOR REAL-TIME MULTIMEDIA TRANSMISSION***
POZNAN UNIVERSITY OF TE CHNOLOGY ACADEMIC JOURNALS No 54 Electrical Engineering 2007 Agnieszka CHODOREK* Robert R. CHODOREK** APPLICABILITY OF TCP-FRIENDLY PROTOCOLS FOR REAL-TIME MULTIMEDIA TRANSMISSION***
More informationTransient Behaviors of TCP-friendly Congestion Control Protocols
Transient Behaviors of -friendly Congestion Control Protocols Yang Richard Yang, Min Sik Kim, Simon S. Lam Department of Computer Sciences The University of Texas at Austin Austin, TX 7872 88 fyangyang,minskim,lamg@cs.utexas.edu
More informationPerformance Analysis of TCP Variants
102 Performance Analysis of TCP Variants Abhishek Sawarkar Northeastern University, MA 02115 Himanshu Saraswat PES MCOE,Pune-411005 Abstract The widely used TCP protocol was developed to provide reliable
More informationSynopsis on. Thesis submitted to Dravidian University for the award of the degree of
Synopsis on AN EFFICIENT EXPLICIT CONGESTION REDUCTION IN HIGH TRAFFIC HIGH SPEED NETWORKS THROUGH AUTOMATED RATE CONTROLLING Thesis submitted to Dravidian University for the award of the degree of DOCTOR
More informationLecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren
Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren Lecture 21 Overview" How fast should a sending host transmit data? Not to fast, not to slow, just right Should not be faster than
More informationChapter II. Protocols for High Speed Networks. 2.1 Need for alternative Protocols
Chapter II Protocols for High Speed Networks 2.1 Need for alternative Protocols As the conventional TCP suffers from poor performance on high bandwidth delay product links [47] meant for supporting transmission
More informationPerformance Enhancement Of TCP For Wireless Network
P a g e 32 Vol. 10 Issue 12 (Ver. 1.0) October 2010 Global Journal of Computer Science and Technology Performance Enhancement Of TCP For Wireless Network 1 Pranab Kumar Dhar, 2 Mohammad Ibrahim Khan, 3
More informationThe Present and Future of Congestion Control. Mark Handley
The Present and Future of Congestion Control Mark Handley Outline Purpose of congestion control The Present: TCP s congestion control algorithm (AIMD) TCP-friendly congestion control for multimedia Datagram
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 informationExplicit Rate Control for MANET
International Journal of Networked and Distributed Computing, Vol. 1, No. 1 (January 2013), 37-45 Explicit Rate Control for MANET Nazia Zaman Department of Computer Science and Engineering, University
More informationPerformance Comparison of TFRC and TCP
ENSC 833-3: NETWORK PROTOCOLS AND PERFORMANCE CMPT 885-3: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS FINAL PROJECT Performance Comparison of TFRC and TCP Spring 2002 Yi Zheng and Jian Wen {zyi,jwena}@cs.sfu.ca
More information6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long
6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long Please read Chapter 19 of the 6.02 book for background, especially on acknowledgments (ACKs), timers,
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 informationComputer Networking
15-441 Computer Networking Lecture 17 TCP Performance & Future Eric Anderson Fall 2013 www.cs.cmu.edu/~prs/15-441-f13 Outline TCP modeling TCP details 2 TCP Performance Can TCP saturate a link? Congestion
More informationCSCE 463/612 Networks and Distributed Processing Spring 2017
CSCE 463/612 Networks and Distributed Processing Spring 2017 Transport Layer VI Dmitri Loguinov Texas A&M University March 28, 2017 Original slides copyright 1996-2004 J.F Kurose and K.W. Ross 1 Chapter
More informationDistributed Congestion Control of Scalable Video Streams
80 JOURNAL OF COMMUNICATIONS, VOL. 7, NO. 3, MARCH 202 Distributed Congestion Control of Scalable Video Streams Jean-Paul Wagner and Pascal Frossard Ecole Polytechnique Fédérale de Lausanne (EPFL) Signal
More informationOn TCP friendliness of VOIP traffic
On TCP friendliness of VOIP traffic By Rashmi Parthasarathy WSU ID # 10975537 A report submitted in partial fulfillment of the requirements of CptS 555 Electrical Engineering and Computer Science Department
More informationPromoting the Use of End-to-End Congestion Control in the Internet
Promoting the Use of End-to-End Congestion Control in the Internet IEEE/ACM Transactions on ing, May 3 1999 Sally Floyd, Kevin Fall Presenter: Yixin Hua 1 About Winner of the Communications Society William
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 informationPromoting the Use of End-to-End Congestion Control in the Internet
Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE/ACM Transactions on Networking May 1999 ACN: TCP Friendly 1 Outline The problem of Unresponsive Flows
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 informationComparison of different congestion control mechanisms: TFRC and TCP(a, b) ENSC835 and CMPT885 project team 15 Jian(Jason) Wen and Yi Zheng
Comparison of different congestion control mechanisms: TFRC and TCP(a, b) ENSC835 and CMPT885 project team 15 Jian(Jason) Wen and Yi Zheng Motivation Congestion control in packet networks has been proven
More informationCore-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet
Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica CMU Scott Shenker Xerox PARC Hui Zhang CMU Congestion Control in Today s Internet Rely
More informationTCP Probe: A TCP with built-in Path Capacity Estimation 1
TCP Probe: A TCP with built-in Path Capacity Estimation Anders Persson, Cesar A. C. Marcondes 2, Ling-Jyh Chen, Li Lao, M. Y. Sanadidi, and Mario Gerla Computer Science Department University of California,
More informationUnit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
More informationInvestigation of Multi-path Transmission Protocols for Congestion Control
Investigation of Multi-path Transmission Protocols for Congestion Control Firat Tekiner & Santosh Kumar Battar Department of Computing, Engineering and Physical Sciences, University of Central Lancashire,
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 Control in a High Speed Radio Environment
Congestion Control in a High Speed Radio Environment Sara Landström, Lars-Åke Larzon,, Ulf Bodin {saral, lln, uffe}@csee.ltu.se Division of Computer Science and Networking Department of Computer Science
More informationUtility-Based Rate Control in the Internet for Elastic Traffic
272 IEEE TRANSACTIONS ON NETWORKING, VOL. 10, NO. 2, APRIL 2002 Utility-Based Rate Control in the Internet for Elastic Traffic Richard J. La and Venkat Anantharam, Fellow, IEEE Abstract In a communication
More informationAccess Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Department of Computer Science, University of California at Los Angeles Los Angeles, CA 90095,
More informationCS4700/CS5700 Fundamentals of Computer Networks
CS4700/CS5700 Fundamentals of Computer Networks Lecture 15: Congestion Control Slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang Alan Mislove amislove at ccs.neu.edu
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 informationA High-Order Model for Congestion Control Using Exponential Increase
A High-Order Model for Congestion Control Using Exponential Increase D-H. HOANG Department of Computer Science and Automation Technical University of Ilmenau 98684-D Ilmenau GERMANY Abstract: Due to the
More informationSTUDIES ON THE PERFORMANCE IMPROVEMENT OF WINDOW ADJUSTMENT PROCEDURE IN HIGH BANDWIDTH DELAY PRODUCT NETWORK
STUDIES ON THE PERFORMANCE IMPROVEMENT OF WINDOW ADJUSTMENT PROCEDURE IN HIGH BANDWIDTH DELAY PRODUCT NETWORK Ms.T.Sheela* and Dr.J.Raja** *Research Scholar, Satyabama University, Chennai, sheela_saiit@yahoo.com
More informationEstimating Arrival Rates from the RED Packet Drop History
Estimating Arrival Rates from the RED Packet Drop History Sally Floyd, Kevin Fall, and Kinh Tieu Network Research Group Lawrence Berkeley National Laboratory, Berkeley CA ffloyd,kfallg@eelblgov ** DRAFT
More informationCircuit Breakers for Multimedia Congestion Control
Circuit Breakers for Multimedia Congestion Control Varun Singh Aalto University Stephen McQuistin, Martin Ellis, and Colin Perkins University of Glasgow Context Video conferencing seeing increasing deployment
More informationMulticast Transport Protocol Analysis: Self-Similar Sources *
Multicast Transport Protocol Analysis: Self-Similar Sources * Mine Çağlar 1 Öznur Özkasap 2 1 Koç University, Department of Mathematics, Istanbul, Turkey 2 Koç University, Department of Computer Engineering,
More informationOn Receiver-Driven Layered Multicast Transmission
CSD-TR-4, UCLA On Receiver-Driven Layered Multicast Transmission Jun Wei, Lixia Zhang Computer Sciences Department, UCLA 443 Boelter Hall, Los Angeles, CA 995 E-mail: jun@cs.ucla.edu, lixia@cs.ucla.edu
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 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 informationRate Based Pacing with Various TCP Variants
International OPEN ACCESS Journal ISSN: 2249-6645 Of Modern Engineering Research (IJMER) Rate Based Pacing with Various TCP Variants Mr. Sreekanth Bandi 1, Mr.K.M.Rayudu 2 1 Asst.Professor, Dept of CSE,
More informationComparison of Shaping and Buffering for Video Transmission
Comparison of Shaping and Buffering for Video Transmission György Dán and Viktória Fodor Royal Institute of Technology, Department of Microelectronics and Information Technology P.O.Box Electrum 229, SE-16440
More informationInteractions of Intelligent Route Control with TCP Congestion Control
Interactions of Intelligent Route Control with TCP Congestion Control Ruomei Gao 1, Dana Blair 2, Constantine Dovrolis 1, Monique Morrow 2, and Ellen Zegura 1 1 College of Computing, Georgia Institute
More informationScaleable Round Trip Time Estimation for Layered Multicast Protocol
Scaleable Round Trip Time Estimation for Layered Multicast Protocol Osman Ghazali and Suhaidi Hassan Department of Computer Sciences, Faculty of Information Technology Universiti Utara Malaysia, 06010
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 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 informationCS 268: Lecture 7 (Beyond TCP Congestion Control)
Outline CS 68: Lecture 7 (Beyond TCP Congestion Control) TCP-Friendly Rate Control (TFRC) explicit Control Protocol Ion Stoica Computer Science Division Department of Electrical Engineering and Computer
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 End Hosts. CSE 561 Lecture 7, Spring David Wetherall. How fast should the sender transmit data?
Congestion Control End Hosts CSE 51 Lecture 7, Spring. David Wetherall Today s question How fast should the sender transmit data? Not tooslow Not toofast Just right Should not be faster than the receiver
More informationAdaptive Multi-level Streaming Service using Fuzzy Similarity in Wireless Mobile Networks
한국산학기술학회논문지 Vol. 11, No. 9 pp. 3502-3509, 2010 Adaptive Multi-level Streaming Service using Fuzzy Similarity in Wireless Mobile Networks Chong Deuk Lee 1* 1 Div. of Electronic Engineering, Chonbuk National
More informationEnhanced Forward Explicit Congestion Notification (E-FECN) Scheme for Datacenter Ethernet Networks
Enhanced Forward Explicit Congestion Notification (E-FECN) Scheme for Datacenter Ethernet Networks Chakchai So-In, Raj Jain, and Jinjing Jiang Department of Computer Science and Engineering Washington
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 informationExperimental Study of TCP Congestion Control Algorithms
www..org 161 Experimental Study of TCP Congestion Control Algorithms Kulvinder Singh Asst. Professor, Department of Computer Science & Engineering, Vaish College of Engineering, Rohtak, Haryana, India
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 informationA transport-layer approach for achieving predictable throughput for Internet applications
Seventh International Conference on Networking A transport-layer approach for achieving predictable throughput for Internet applications Go Hasegawa, Kana Yamanegi and Masayuki Murata Graduate School of
More informationReal-time Streaming over Wireless Links: A Comparative Study
Real-time Streaming over Wireless Links: A Comparative Study Guang Yang, Ling-Jyh Chen, Tony Sun, Mario Gerla and M. Y. Sanadidi Computer Science Department University of California, Los Angeles Los Angeles,
More informationSRC: Stable Rate Control for Streaming Media
SRC: Stable Rate Control for Streaming Media Cheng Huang Lihao Xu Department of Computer Science and Engineering Washington University in St. Louis, MO, 6313 {cheng, lihao}@cse.wustl.edu Abstract Rate
More informationFairness Evaluation Experiments for Multicast Congestion Control Protocols
Fairness Evaluation Experiments for Multicast Congestion Control Protocols Karim Seada, Ahmed Helmy Electrical Engineering-Systems Department University of Southern California, Los Angeles, CA 989 {seada,helmy}@usc.edu
More informationECE 333: Introduction to Communication Networks Fall 2001
ECE 333: Introduction to Communication Networks Fall 2001 Lecture 28: Transport Layer III Congestion control (TCP) 1 In the last lecture we introduced the topics of flow control and congestion control.
More information