
Decoupling Delay and Resource Sharing Targets with Efficient Core-Stateless AQM
Core-Stateless resource sharing control identifies flow aggregates in the edge and marks packets based on the relevant policies. Within the core of the network, no flow identification or policy knowledge is needed to realize the desired resource sharing. As packet marking needs trust and the behavior of core-routers is independent of the number of flow aggregates, it is a natural choice for high-speed closed domain networks. In this demo paper, the Per Packet Value (PPV) core-stateless resource sharing framework is extended with an efficient AQM algorithm that decouples delay and resource sharing targets (separating the importance of a packet and its delay requirement).
Eredeti fellelhetőség: mtmt.hu

