Achieving Per-Flow Weighted Rate Fairness in a Core Stateless Network

Authors:
Raghupathy Sivakumar;Tae-Eun Kim;Narayanan Venkitaraman;Jia-Ru Li;Vaduvur Bharghavan
Affiliations:
-;-;-;-;-
Venue:
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Year:
2000

Citing 0
Cited 5

An incrementally deployable approach for achieving fair rate allocations

Computer Networks: The International Journal of Computer and Telecommunications Networking
The Incremental Deployability of Core-Stateless Fair Queuing

ICN '01 Proceedings of the First International Conference on Networking-Part 2
Providing absolute differentiated services for real-time applications in static-priority scheduling networks

IEEE/ACM Transactions on Networking (TON)
Algorithms and protocols for stateless constrained-based routing

Computer Communications
A network scheme for TCP elastic traffic with admission control using edge-to-edge per-aggregate measurements in class-based networks

Journal of High Speed Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Corelite is a Quality of Service architecture that provides weighted max-min fairness for rate among flows in a network without maintaining any per-flow state in the core routers. There are three key mechanisms that work in concert to achieve the service model of Corelite: (a) the introduction of markers in a packet flow by the edge routers to reflect the normalized rate of the flow, (b) weighted fair marker feedback at the core routers upon incipient congestion detection, and (c) linear increase/multiplicative decrease based rate adaptation of packet flows at the edge routers in response to marker feedback.