S. Floyd,V.Jacob.,###Q9,w early detection gateways for congestion avoidance,IEEE/ACM Transactions on Networking 1 (4) (1993) 397--413. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Simple and Scalable Fair Bandwidth Sharing Mechanism for.. - Filali, Dabbous (2002) (Correct)
....to be robust to coarse implementation of the inter multicast fairness function using the MAL scheme described in Section 2.2.2. It should also be noted that the source address and the destination group address are not only needed by the MFQ We use the same method as RED (Random Early Drop) [11] to estimate the mean queue size qlen. The formula for calculating the average queue length qlen is qlen = 1 Wq ) qlen Wq , 0 Wq 1. The weighted moving average formula, with weight Wq is used to filter out transient congestion. The value of Wq is set to 0.002 in all simulations. mechanism ....
S. Floyd, V. Jacobson, and V. Random, Early Detection gateways for Congestion Avoidance, IEEE/ACM TON, V.1 No.4, pp. 397-413, August 1993.
SBQ: A Simple Scheduler for Fair Bandwidth Sharing between.. - Filali, Dabbous (2002) (Correct)
....of multicast and unicast flows. While the former is provided by MFQ, the latter could be obtained through the use of a flow based unicast active queue management mechanism such as FRED [11] However, unicast flow based AQM are not available everywhere and most of current routers use a FIFO or RED [5] schemes which don t provide the number of unicast connections. That s why, we propose hereafter a simple method which we use to estimate the number of unicast connections in the unicast queue. SBQ counts active unicast connections as follows. It maintains a bit vector called v of fixed length. ....
S. Floyd, V. Jacobson, and V. Random, Early Detection gateways for Congestion Avoidance, IEEE/ACM TON, V.1 No.4, pp. 397-413, August 1993.
A New Bandwidth Sharing Scheme for Non-Responsive Multicast.. - Filali, Dabbous (2002) (Correct)
.... queue mean size is less than thrsh the packet will be accepted only if the number of packets belonging to the flow does not exceed its allowed number (its MAL or its MAL plus one more packet depending on the generated number u as explained above) We use the same method as RED (Random Early Drop) [3] to estimate the queue mean size qlen. The formula for calculating the average queue length qlen is qlen = 1 W q ) qlen W q , 0 W q 1. The weighted moving average formula, with weight W q is used to filter out transient congestion . If the mean queue size is between the maximum ....
S. Floyd, V. Jacobson, and V. Random, Early Detection gateways for Congestion Avoidance, IEEE/ACM TON, V.1 No.4, pp. 397413, August 1993.
SRAMT: A Hybrid Sender and Receiver-Based Adaptation Scheme.. - Bouras, Gkamas (2005) (Correct)
No context found.
S. Floyd,V.Jacob.,###Q9,w early detection gateways for congestion avoidance,IEEE/ACM Transactions on Networking 1 (4) (1993) 397--413.
Fair Bandwidth Sharing Between Unicast and Multicast Flows in .. - Filali, Dabbous (Correct)
No context found.
S. Floyd, V. Jacobson, and V. Random, Early Detection gateways for Congestion Avoidance, IEEE/ACM TON, V.1 No.4, pp. 397-413, August 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC