A new traffic model for core-stateless scheduling
Core-stateless scheduling algorithms can provide a similar level of guaranteed services as the stateful approach, while they do not need per-flow management. They hence possess both the properties of quality-of-service (QoS) provisioning and high scalability. In this paper, by showing the current existing traffic models are not applicable to core-stateless networks, a new and efficient traffic model for characterizing traffic in a core-stateless network is proposed, and its properties are presented.