Rainbow fair queueing: theory and applications

@article{Cao2005RainbowFQ,
  title={Rainbow fair queueing: theory and applications},
  author={Zhiruo Cao and E. Zegura and Z. Wang},
  journal={Comput. Networks},
  year={2005},
  volume={47},
  pages={367-392}
}
  • Zhiruo Cao, E. Zegura, Z. Wang
  • Published 2005
  • Computer Science
  • Comput. Networks
  • Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of end-to-end congestion control mechanisms. Traditional mechanisms to achieve fair sharing (e.g., Weighted Fair Queueing, Flow Random Early Discard) require per-flow state to determine which packets to drop under congestion, and therefore are complex to implement at the interior of a high-speed network. This scalability limitation of traditional WFQ implementations… CONTINUE READING
    14 Citations
    Fair Resource Sharing for Stateless-Core Packet-Switched Networks With Prioritization
    • 5
    • PDF
    Per Packet Value: A Practical Concept for Network Resource Sharing
    • 13
    Towards core-stateless fairness on multiple timescales
    • 2
    Towards a Congestion Control-Independent Core-Stateless AQM
    • 7
    Stateless Resource Sharing in Networks with Multi-Layer Virtualization
    • 2
    Decoupling Delay and Resource Sharing Targets with Efficient Core-Stateless AQM
    • 1
    Classified Round Robin: A Simple Prioritized Arbitration to Equip Best Effort NoCs With Effective Hard QoS
    • 2

    References

    SHOWING 1-10 OF 28 REFERENCES
    Rainbow fair queueing: fair bandwidth sharing without per-flow state
    • Zhiruo Cao, Z. Wang, E. Zegura
    • Computer Science
    • Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
    • 2000
    • 143
    • PDF
    Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks
    • 535
    • Highly Influential
    • PDF
    Efficient Fair Queuing Using Deficit Round -
    • 526
    • PDF
    Hierarchical packet fair queueing algorithms
    • 366
    TCP-like congestion control for layered multicast data transfer
    • L. Vicisano, L. Rizzo, J. Crowcroft
    • Computer Science
    • Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
    • 1998
    • 624
    • PDF
    Analysis and simulation of a fair queueing algorithm
    • 2,258
    Dynamics of random early detection
    • 972
    • Highly Influential
    • PDF
    Random Early Detection Gateways for Congestion Avoidance
    • QUTdN QeO
    • 1993
    • 5,648
    • PDF
    Flow identification for supporting per-flow queueing
    • Zhiruo Cao, Z. Wang
    • Computer Science
    • Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440)
    • 2000
    • 13