Design considerations for supporting TCP with per-flow queueing

Suter, B.; Lakshman, T. V.; Stiliadis, D.; Choudhury, A.K.

doi:10.1109/infcom.1998.659666

Cited by 97 publications

(54 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The aim of this article is to shed some light on these questions. There are several definitions of FQ that can lead to significantly different behaviors (see, e.g., [14,15]). By FQ scheduling, we mean a per-packet approximation of a fluid Generalized Processor Sharing (GPS) scheduling; an FQ policy is a per-flow FQ scheduling with Longest Queue Drop (LQD) buffer management.…”

Section: Cmentioning

confidence: 99%

“…If we want to deploy the FQ paradigm in today's Internet, there is a central question: How will the use of an FQ that is deployed in all network nodes affect the behavior and performance of TCP flows? Suter showed the benefits of an FQ policy for TCP flows [15]. While his results are very promising, they are based on simulations for a very simple topology.…”

Section: Behavior Of Tcp With the Fq Paradigmmentioning

confidence: 99%

“…Suter et al show the benefits of FQ scheduling with appropriate buffer management for TCP flows [15]. Their discussion about the influence of the buffer management on the efficiency of an FQ per-flow scheduling policy very much inspires our definition of the policy that must be used with the FQ paradigm.…”

Section: Prior Workmentioning

confidence: 99%

See 2 more Smart Citations

Revisiting the fair queuing paradigm for end-to-end congestion control

Legout

Biersack

2002

IEEE Network

View full text Add to dashboard Cite

ongestion control has been a central research topic since the early days of computer networks. Nagle first identified the problems of congestion in the Internet [1]. The fundamental turning point in Internet congestion control took place in the 1980s. Nagle proposed a strategy based on roundrobin scheduling [2], whereas Jacobson proposed a strategy based on slow start (SS) and congestion avoidance (CA) [3]. Each of these solutions has its drawbacks: Nagle's solution has high computational complexity and requires modifications to the routers; Jacobson's solution requires the collaboration of all end users. The modest performance of the routers and small size of the Internet community at that time led to the adoption of Jacobson's proposal. SS and CA were incorporated into TCP, and more than 10 years later the Internet still uses these mechanisms in a somewhat improved form [4].We define the notion of a paradigm for congestion control as a model to be used in designing congestion control protocols that have the same set of properties. Practically, when one designs a congestion control protocol with a paradigm, one has the guarantee that this protocol will have the same set of properties as all the other congestion control protocols designed with this paradigm. The benefits of the paradigm come from the set of properties it guarantees. However, the trade-off is that the paradigm imposes some constraints that must be respected. This notion of a paradigm is not obvious in the Internet. A TCP-friendly paradigm was implicitly defined and introduced only a few years ago, when new applications that cannot use TCP had already been developed.Since TCP relies heavily on the collaboration of all the end users (collaboration in the sense of the common mechanism used to achieve congestion control), the TCP-friendly paradigm was introduced (see [5,6]) to design congestion control protocols compatible with TCP.A TCP-friendly flow must adapt its throughput T according to the equation:where C is a constant, MTU is the packet size used, and RTT and loss are the round-trip time and loss rates experienced by that flow. To compute the throughput T, one needs to measure the loss rates and the RTT. The TCP-friendly equation models the TCP long-term behavior for low loss rate. Padhye et al. [7] introduced an improved TCP-friendly equation that is a good approximation of TCP long-term behavior, even for high loss rate.The throughput T for a TCP-friendly flow must decrease when its loss increases. However, this behavior does not suit the needs of many applications. For example, audio and video applications are loss-tolerant and the degree of loss tolerance Revisiting the Fair Queuing Paradigm for End-to-End Congestion ControlArnaud Legout and Ernst W. Biersack, Institut EURECOM Abstract Today, the dominant paradigm for congestion control in the Internet is based on the notion of TCP friendliness. To be TCP-friendly, a source must behave in such a way as to achieve a bandwidth that is similar to the bandwidth obtained by a TCP flow that wo...

show abstract

Section: Cmentioning

confidence: 99%

Section: Behavior Of Tcp With the Fq Paradigmmentioning

confidence: 99%

See 1 more Smart Citation

Revisiting the fair queuing paradigm for end-to-end congestion control

Legout

Biersack

2002

IEEE Network

View full text Add to dashboard Cite

show abstract

“…Note that while SACK-based loss recovery helps, throughput will still suffer in the face of non-congestion related packet loss. One effective solution to this problem is to deploy fair queueing and TCP-friendly buffer management in network routers [Sut98]. However, in the absence of help from the network, other researchers have investigated changes to the congestion avoidance policy at the TCP sender, as described in [Flo91,HK98].…”

Section: Possible Interaction and Relationships With Other Researchmentioning

confidence: 99%

Ongoing TCP Research Related to Satellites

Dawkins¹,

Glover²,

Griner³

et al. 2000

157

View full text Add to dashboard Cite

This document outlines possible TCP enhancements that may allow TCP to better utilize the available bandwidth provided by networks containing satellite links. The algorithms and mechanisms outlined have not been judged to be mature enough to be recommended by the IETF. The goal of this document is to educate researchers as to the current work and progress being done in TCP research related to satellite networks.

show abstract

“…However, without protection schemes at the routers, a greedy connection will still cause ALS connections to face losses and can receive a bandwidth share higher than its fair one. Lakshman et al [29] present an intelligent buffer management approach that supports the isolation of responsive from unresponsive flows in a simple way. In an environment with routers supporting such buffering mechanisms ALS would be most suitable for achieving high utilization, low losses and fair bandwidth distribution.…”

Section: Summary and Future Workmentioning

confidence: 99%

The adaptive load service (ALS): an ABR-like service for the Internet

Sisalem¹,

Schulzrinne

Proceedings ISCC 2000. Fifth IEEE Symposium on Computers and Communications

View full text Add to dashboard Cite

In this paper, we present a novel approach for realizing adaptive QoS control in the Internet called the adaptive load service (ALS). ALS was designed in a similar fashion to the available bit rate service (ABR) proposed for ATM. That is, the senders transmit control messages indicating their requirements, intermediate routers adjust the indicated values in accordance with their available resources and the receivers send the contents of the control messages back to the senders. The transmission behavior of the senders is then adjusted in accordance with the indicated values in the returned control messages. Unlike ABR, ALS is IP-based and was designed to scale for large multicast groups and accommodate the needs of heterogeneous receivers through the integration of sender-based and receiver-based adaptation mechanisms in addition to relying on the network feedback for adjusting the transmission behavior.Performance tests of ALS under different simulation topologies show its efficiency in terms of bandwidth utilization and loss reduction. The tests also show ALS to be fair towards competing TCP connections. Additionally, even though ALS uses a simple algorithm for determining the fair bandwidth share a connection should be using, ALS manages to fairly distribute available resources in accordance with the max-min fairness criterion.

show abstract

Design considerations for supporting TCP with per-flow queueing

Cited by 97 publications

References 22 publications

Revisiting the fair queuing paradigm for end-to-end congestion control

Revisiting the fair queuing paradigm for end-to-end congestion control

Ongoing TCP Research Related to Satellites

The adaptive load service (ALS): an ABR-like service for the Internet

Contact Info

Product

Resources

About