Design

Design is similar to [1]

Network is described using queues and flows with two key operations:

  • queue_scan

  • flow_reduce

Principle

Let hq and hf be the states of queues and flows. We assume

  • hf=queue_scan(hq[],hf) where scan runs over all the ques along path used by the flow

  • hq=queue_update(flow_reduce(hf),hq) where reduction is over all flows using the particular queue-this combines multiple flows

Ref