Round Robin Scheduling for Fair Flow Control in Data Communication Networks

Hahne, E.L.; Gallager, Robert G.

doi:10.21236/ada166728

Cited by 102 publications

(67 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We compare our proposed OSIA scheduling scheme against three different methods in our experiments: (i) traditional RoundRobin scheduling scheme (Hahne and Gallager, 1986); (ii) CWNDaware scheduling scheme (Saadawi and Lee, 2004); (iii) flow-level scheduling scheme. Clearly, the Round Robin approach suffers from the excessive packet reordering and is not recommended in practice.…”

Section: Simulation Modelmentioning

confidence: 99%

OSIA: Out-of-order Scheduling for In-order Arriving in concurrent multi-path transfer

Wang

Liao

2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

One major problem of concurrent multi-path transfer (CMT) scheme in multi-homed mobile networks is that the utilization of different paths with diverse delays may cause packet reordering among packets of the same flow. In the case of TCP-like, the reordering exacerbates the problem by bringing more timeouts and unnecessary retransmissions, which eventually degrades the throughput of connections considerably. To address this issue, we first propose an Out-of-order Scheduling for In-order Arriving (OSIA), which exploits the sending time discrepancy to preserve the in-order packet arrival. Then, we formulate the optimal traffic scheduling as a constrained optimization problem and derive its closedform solution by our proposed progressive water-filling solution. We also present an implementation to enforce the optimal scheduling scheme using cascaded leaky buckets with multiple faucets, which provides simple guidelines on maximizing the utilization of aggregate bandwidth while decreasing the probability of triggering 3 dupACKs. Compared with previous work, the proposed scheme has lower computation complexity and can also provide the possibility for dynamic network adaptability and finer-grain load balancing. Simulation results show that our scheme significantly alleviates reordering and enhances transmission performance.

show abstract

Section: Simulation Modelmentioning

confidence: 99%

OSIA: Out-of-order Scheduling for In-order Arriving in concurrent multi-path transfer

Wang

Liao

2012

Journal of Network and Computer Applications

View full text Add to dashboard Cite

show abstract

“…To our knowledge, the proposals of Gallager [11] and Katevenis [16] were the first to apply max-min fairness to share bandwidth among sessions in a packet switched network. They achieved fairness by allocating, at each router link, one queue per session, and using a round robin scheduler.…”

Section: A Related Workmentioning

confidence: 99%

B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm

Mozo

Lopez-Presa

Anta

2011

2011 IEEE 10th International Symposium on Network Computing and Applications

View full text Add to dashboard Cite

Abstract-The problem of fairly distributing the capacity of a network among a set of sessions has been widely studied. In this problem, each session connects via a single path a source and a destination, and its goal is to maximize its assigned transmission rate (i.e., its throughput). Since the links of the network have limited bandwidths, some criterion has to be defined to fairly distribute their capacity among the sessions. A popular criterion is max-min fairness that, in short, guarantees that each session i gets a rate λi such that no session s can increase λs without causing another session s to end up with a rate λ s < λs. Many max-min fair algorithms have been proposed, both centralized and distributed. However, to our knowledge, all proposed distributed algorithms require control data being continuously transmitted to recompute the max-min fair rates when needed (because none of them has mechanisms to detect convergence to the max-min fair rates).In this paper we propose B-Neck, a distributed max-min fair algorithm that is also quiescent. This means that, in absence of changes (i.e., session arrivals or departures), once the maxmin rates have been computed, B-Neck stops generating network traffic. Quiescence is a key design concept of B-Neck, because B-Neck routers are capable of detecting and notifying changes in the convergence conditions of max-min fair rates. As far as we know, B-Neck is the first distributed max-min fair algorithm that does not require a continuous injection of control traffic to compute the rates. The correctness of B-Neck is formally proved, and extensive simulations are conducted. In them, it is shown that B-Neck converges relatively fast and behaves nicely in presence of sessions arriving and departing.

show abstract

“…The drawback of PQ algorithms is that packets with lower priority can suffer from unfair service treatment. Round Robin (RR) algorithms (Nagle, 1985) and its extensively used versions Weighted Round Robin (WRR) (Hahne, 1986) and Deficit Round Robin (DRR) (Shreedhar & Varghese, 1995) process packets in turn with equal share. RR scheduling techniques cannot achieve very good accuracy and fairness when sharing the output bandwidth.…”

Section: Scheduling and Queueingmentioning

confidence: 99%