Core-Stateless Fair Queueing Algorithm

• Edge node

  • estimate rate, of each flow and insert it as a label in packet’s header

• All nodes

  • estimate fair rate based on link state
  • forward each packet with probability P (where is given by packet’s label)
  • update packet label to

flow 1

flow 2

flow m

flow rate estimator

fair rate estimator+

packet processing

flow 1

flow 2

flow m

Edge Node

Core Node

FIFO

FIFO

Previous slide

Next slide

Back to first slide

View graphic version