Citations: The Behavior of Certain Stochastic Processes Arising in Window Protocols

15 citations found. Retrieving documents...

S. Savari and E.Telatar, "The behavior of certain stochastic processes arising in window protocols," in Global Telecommunications Conference (GLOBECOM'99), 1999, vol. 1B, pp. 791--795.

Home/Search Document Not in Database Summary Related Articles Check

This paper is cited in the following contexts:

A Stochastic Model of TCP and Fair Video Transmission - Bohacek (2003) (2 citations) (Correct)

....with various distributions; deterministic, Poisson, i.i.d and Markovian. A specific example of the model in [12] is developed in [9] where drop events are modeled by a Poisson process and, hence, the time between drop events are exponentially distributed and independent of the sending rate. In [23] and [1] this approach is generalized and drops events are modeled as a Poisson process where the intensity depends on TCP s congestion window size. In [24] a dynamic model of loss is developed. The model presented here is also dynamic. The difference between the two is that our model recognizes ....

....where the intensity depends on TCP s congestion window size. In [24] a dynamic model of loss is developed. The model presented here is also dynamic. The difference between the two is that our model recognizes a strong dependence on the round trip time. Our loss model is along the lines of [23] and [1] in that packet loss is modeled as a Poisson process. However, we allow the loss rate to be a function of round trip time and the sending rate. As a result of the loss rate depending on roundtrip time, the model is able to remain accurate for a large set of operating conditions; light ....

[Article contains additional citation context not shown here]

S. Savari and E. Telatar, "The behavior of certain stochastic processes arising in window protocols," in IEEE Globecom, Dec. 1999.

Stochastic Modeling of a Single TCP/IP Session over a.. - Abou-Zeid, Azizoglu, Roy (Correct)

....links may be modelled as leading to random packet loss depending on the fade rates relative to data rate on the channel. While random packet loss on the Internet has been reported in [8] it was not taken into consideration in the congestion control mechanism in TCP IP. Previous research [2, 3, 4, 5] has shown that random packet loss (which is not due to congestion) may severely decrease the throughput of TCP because TCP interprets random packet loss to be due to congestion and hence lowers the input data rate into the network, and consequently the throughput. In [2, 3] a discrete time ....

....to be lost with probability q independent of all other packets. This model induces a geometric distribution on the number of packets successfully transmitted between consecutive packet losses, that may or may not be appropriate for specific lossy networks. A different loss model was employed in [5] which assumed that packet loss is characterized by an inhomogeneous Poisson process. The steady state distribution of the window size was obtained in [5] under the assumption of infinite buffer size. In contrast, in this paper we assume a continuous time packet loss model governed by a general ....

[Article contains additional citation context not shown here]

S. Savari, and E. Telatar, "The behavior of certain stochastic processes arising in window protocols," preprint, July 1998.

Analytic Understanding of RED Gateways with Multiple Competing .. - Abouzeid, Roy (7 citations) (Correct)

....fixed drop proba Forced packet losses are those due to either buffer overflow or due to packet drop with probability one. This assumption has also been adopted in almost all previous TCP related research efforts, whether with RED or with Tail Drop gateways (e.g. 13] 14] 16] 17] 20] [24]) with (up to our knowledge) the exception of [11] bility, it is well known that the probability that a dropped packet belongs to a flow is exactly equal to the ratio of the corresponding arrival rate to the net (total) arrival rates of all processes (e.g. see [25] pp.41) Equation 2 is a ....

S. Savari and E. Telatar, "The behavior of certain stochastic processes arising in window protocols," 1999, pp. 791--5.

Stochastic Modeling of TCP/IP over Random Loss Channels - Abouzeid, Azizoglu, Roy (1999) (1 citation) (Correct)

....circumstances (e.g. networks with wireless links) packet losses occur randomly due to link effects than due to network congestion. While random packet loss on the Internet has been reported in [7] it was not taken into consideration in the design of TCP IP congestion control. Previous research [2 4] has shown that random packet loss (which is not due to congestion) may severely decrease the throughput of TCP because TCP interprets random packet loss to be due to congestion and hence lowers the input data rate into the network, and consequently the throughput. In [2, 3] a discrete time model ....

....used in which any given packet is lost with probability q independent Author for all correspondence Ph FAX : 206) 221 5261 543 3842; e mail: roy ee.washington.edu of all other packets implying a geometric distribution on the number of successful packets between consecutive loss events. In [4], packet loss is characterized by an inhomogeneous Poisson process and the steady state distribution of the window size obtained under the assumption of infinite buffer size. In this work, we assume a continuous time packet loss model governed by a general renewal process and incorporate (finite) ....

S. Savari, and E. Telatar, "The behavior of certain stochastic processes arising in window protocols," preprint, July 1998.

TCP/IP Modeling and Validation - Barakat (2001) (5 citations) (Correct)

....TCP congestion control should consider an infinite receiver window. Models that account for the limitation of TCP transmission rate will not be of much importance. Fluid Models vs. Discrete Models Some of the models for TCP assume that the window increases continuously between congestion events [7, 12, 18, 24]. The use of a continuous model for the window facilitates analysis since it permits the use of tools from the theory of continuous functions such as integration and differentiation. The continuous increase may hold for the congestion window at the source, but not for the volume of data in the ....

....a small time interval. Examples of this approach are papers which suppose that TCP packets are dropped within the network with a constant or variable probability [11] or those assuming that loss moments form a Poisson process with a variable intensity function of the window size of the connection [24]. The advantage of the indirect approach is that it decouples the model for the network from the control policy at the TCP source. It happens that on some Internet paths, the process of losses seen by a TCP connection is a function of the way it increases and decreases its window, and this process ....

S. Savari and E. Telatar, "The Behavior of Certain Stochastic Processes Arising in Window Protocols," IEEE GLOBECOM, Dec. 1999.

A Stochastic Model of TCP/IP with Stationary Random Losses - Altman, Avrachenkov, Barakat (2000) (43 citations) (Correct)

....on AEow control in High Speed Networks. y The work of this author was nanced by an RNRT (French National Research Network in Telecommunications) iConstellationsj project on satellite communications. A remarkable attention has been given to TCP modeling within the research community [1, 10, 17, 18, 21, 22, 23, 27, 29]. This is not surprising since 95 of today Internet traOEc is carried over TCP. Closed form expressions for the throughput have been obtained. These expressions have helped to understand the impact of dioeerent network and TCP parameters on the throughput of the connection and on the eOEciency of ....

....used in [18, 21] gives a deterministic time between congestion events. The assumptions made in [27] can also be shown to imply a deterministic time between congestion events. An exponentially distributed time with a constant intensity has been considered in [23] between congestion events. In [29], the intensity of the exponentially distributed time between congestion events is assumed to increase with the window size. Instead of working in real time, the authors in [22, 26] chose to work in a virtual time. This time is obtained by sampling the congestion window at the moments of ACK ....

S. Savari and E. Telatar, "The Behavior of Certain Stochastic Processes Arising in Window Protocols", IEEE GLOBECOM, Dec 1999.

Complementary Analysis and Numerical Results - For An Elementary (2006) (Correct)

No context found.

S. Savari and E.Telatar, "The behavior of certain stochastic processes arising in window protocols," in Global Telecommunications Conference (GLOBECOM'99), 1999, vol. 1B, pp. 791--795.

A model for TCP congestion control capturing the - Correlations In Times (2006) (Correct)

No context found.

S. Savari and E.Telatar, "The behavior of certain stochastic processes arising in window protocols," in Global Telecommunications Conference, 1999.

A Stochastic Model of TCP/IP with Stationary Random Losses - Altman, Avrachenkov, Barakat (2000) (43 citations) (Correct)