Core-Stateless Forwarding With QoS Revisited: Decoupling Delay and Bandwidth Requirements

Laki, Sándor; Nádas, Szilveszter; Gombos, Gergő; Fejes, Ferenc; Hudoba, Péter; Turányi, Zoltán; Kiss, Zoltán; Keszei, Csaba

doi:10.1109/tnet.2020.3041235

Cited by 6 publications

(4 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It aims at providing a practical, distributed approximate solution for the network utility maximization problem [17]. Different AQM algorithms [3], [5]- [7], [18] have also been proposed as extensions for the PPV concept.…”

Section: Related Workmentioning

confidence: 99%

“…When the buffer is congested, these nodes always drop (or mark with ECN CE) one or more packets with the smallest PV, instead of dropping the last packet or uniformly at random. It has been shown in many papers [3], [5]- [7] that this dropping strategy can efficiently be implemented using simple FIFO queues (see Sec. II).…”

Section: Per Packet Valuementioning

confidence: 99%

“…The TVF V (•) defines the PV distribution of a flow for any sending rate R. Specifically, the throughput contribution of packets with PV at least V (x) in the flow should be x (for any x : 0 ≤ x ≤ R). A practical packet marker [7] of flow a continuously measures the flow's sending rate R, chooses a rate x from range [0, R] uniformly at random at packet arrival and assigns PV p = V a (x) to the given packet.…”

Section: A Policy Encodingmentioning

confidence: 99%

“…In this paper, we focus on a recent core-stateless proposal called Per Packet Value (PPV) [4]. Though it has been shown in the past years [3]- [7] that the key concepts of PPV can provide a flexible and congestion control-independent solution for resource sharing and active queue management problems, these studies have only focused on the analysis of a single bottleneck scenario. The main aim of this paper is to examine the network-wide behavior of the PPV framework with both theoretical and simulation tools in arbitrary network topology.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology

et al. 2022

Self Cite

View full text Add to dashboard Cite

Resource sharing is of utmost importance in networking environments where substantial overprovisioning is economically infeasible. Different centralized solutions have recently been proposed for Wide Area Networks (WANs), Access Aggregation Networks and other closed networking domains, relying on different ideas from exploiting the capabilities of Software Defined Networking for dynamically allocating bandwidth among flows or other traffic aggregates, to moving bottlenecks from the network to a single location (e.g., a gateway node). In contrast to centralized solutions, core-stateless resource sharing proposals have also emerged, solving the resource allocation problem in a distributed way. In this paper, we focus on the network-wide behavior of a recent core-stateless resource sharing proposal called Per Packet Value (PPV). In PPV, each traffic aggregate is represented by a distribution of values carried by the packets. The distribution is used to express the resource sharing policy. We provide a theoretical analysis of PPV and show that it solves the generalized max-min fair allocation problem in arbitrary topology. PPV has provable convergence in case of both scalable and non-scalable congestion control behaviors. To validate the theoretical results under various network conditions, thorough simulations have been carried out in networks with real-world topology. The method assumes congestion controlled sources since non-responsive UDP flows can generate dead packets taking bandwidth away from well-behaving flows. To remedy the problem of dead packets, we propose a lightweight core-stateless policer method that can autonomously rule the resource usage of unfriendly flows, reducing the effect of dead packets in the system.INDEX TERMS Resource sharing, max-min fairness, utility function, core-stateless forwarding.

show abstract