The drop from front strategy in TCP and in TCP over ATM

Lakshman, T. V.; Neidhardt, Arnold L.; Ott, Teunis J.

doi:10.1109/infcom.1996.493070

Cited by 76 publications

(46 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider the congestion alleviation period T a : E[T a ] = T for Droptail, but E[T a ] = D for Dropfront, since the propagation of loss does not need to wait at the queueing delay. This advantage of Dropfront has been qualitatively stated in [16], but not quantitatively studied before.…”

Section: The Reason That Dropfront Queue Reduces E[m ]mentioning

confidence: 89%

“…For those realistic cases, M is no longer a constant, and global synchronization is avoided. Furthermore, if "drop from front" option (Dropfront) [16] is selected, M is not a constant either. All these analysis are validated by extensive ns-2 simulations in Section VI.…”

Section: Synchronization Of Packet Loss Patternmentioning

confidence: 99%

“…Furthermore, if "drop from front" option (Dropfront) [16] is selected, M is not a constant either. All these results are demonstrated in Figure 4.…”

Section: Synchronization Of Packet Loss Patternmentioning

confidence: 99%

See 2 more Smart Citations

Congestion location detection: Methodology, algorithm, and performance

Shao

Chiang

Jourdain

et al. 2009

2009 17th International Workshop on Quality of Service

View full text Add to dashboard Cite

Abstract-Can an end-host running multiple TCP sessions detect not just the occurrence, but also the location of congestion? This paper answers this question through new analytic results on the two underlying technical difficulties: synchronization effects of loss and delay in TCP and distributed hypothesis testing using only local loss and delay data, as well as practical algorithm development and extensive simulations. It presents a Congestion Location Detection algorithm that effectively allows an end host to distributedly detect whether congestion happens in the local access link or in more remote links. This further enables the practical usage of low-priority congestion control protocols.

show abstract

Section: The Reason That Dropfront Queue Reduces E[m ]mentioning

confidence: 89%

Section: Synchronization Of Packet Loss Patternmentioning

confidence: 99%

See 1 more Smart Citation

Congestion location detection: Methodology, algorithm, and performance

Shao

Chiang

Jourdain

et al. 2009

2009 17th International Workshop on Quality of Service

View full text Add to dashboard Cite

show abstract

“…Lakshman et al [12] carried out a simulation of TCP/IP over Asynchronous Transfer Mode (ATM) to study the throughput of RED, and found that an exponential drop function is better than the linear drop function of RED. However, an exponential drop function may require more computing power, and may not be easily implemented in hardware except in certain limiting conditions.…”

Section: Throughput Of Redmentioning

confidence: 99%

A framework to determine the optimal weight parameter of RED in next‐generation Internet routers

Zheng¹,

Atiquzzaman²

2008

Int J Communication

View full text Add to dashboard Cite

SUMMARYActive buffer management can improve the performance of Transmission Control Protocol/Internet Protocol-based networks. Random early detection (RED), an active queue management scheme, has been proposed by the Internet Engineering Task Force for next-generation Internet routers. RED uses a number of parameters, such as buffer thresholds, a packet drop probability and a weight parameter. RED suffers from low throughput and large delay/jitter and induces instability in networks. Previous attempts to improve the performance of RED were based on modifying the thresholds and drop probabilities. In this paper, we show that an optimal value of the weight parameter can improve the performance of RED, and then develop a framework to determine the optimal value of the weight parameter. We show that the optimal weight parameter obtained from our framework improves the performance of RED.

show abstract

“…Should there be enough buer space for the incoming HR service packet after discarding LA service packet(s), we discard LA service packets from the head of linked list L LA along linked list L LA until there is just enough free buer space to allow the incoming HR service packet to enter the buer. The reason why we discard LA packets from the head (instead of from the tail) of linked list L LA is that this will make TCP acknowledgment to be conveyed to the TCP source earlier than is the case under taildiscarding, which translates into quicker reaction to congestion and considerable performance improvement [16].…”

Section: Spred Node Mechanismmentioning

confidence: 99%

A differentiated services architecture for multimedia streaming in next generation Internet

Hou¹,

Wu²,

Li³

et al. 2000

Computer Networks

View full text Add to dashboard Cite

This paper presents a Dierentiated Services (Diserv or DS) architecture for multimedia streaming applications. Speci®cally, we de®ne two types of services in the context of Assured Forwarding (AF) per hop behavior (PHB) that are dierentiated in terms of reliability of packet delivery: the High Reliable (HR) service and the Less Assured (LA) service. We propose a novel node mechanism called Selective Pushout with Random Early Detection (SPRED) that is capable of simultaneously achieving the following four objectives: (1) a core router does not maintain any state information for each¯ow (i.e., core-stateless); (2) the packet sequence within each¯ow is not re-ordered at a node; (3) packets from HR service are delivered more reliably than packets from LA service at a node during congestion; and (4) packets from TCP trac are dropped randomly to avoid global synchronization during congestion. We show that SPRED is a generalized buer management algorithm of both tail-dropping and Random Early Detection (RED), and combines the best features of pushout (PO), RED and RED with In/Out (RIO) mechanisms. Simulation results demonstrate that under the same link speed and network topology, network nodes employing our Diserv architecture have substantial performance improvement over the current Best Eort (BE) Internet architecture for multimedia streaming applications. Ó

show abstract

The drop from front strategy in TCP and in TCP over ATM

Cited by 76 publications

References 10 publications

Congestion location detection: Methodology, algorithm, and performance

Congestion location detection: Methodology, algorithm, and performance

A framework to determine the optimal weight parameter of RED in next‐generation Internet routers

A differentiated services architecture for multimedia streaming in next generation Internet

Contact Info

Product

Resources

About