Per Packet Value: A Practical Concept for Network Resource Sharing

Nádas, Szilveszter; Turányi, Zoltán; Rácz, Sándor

doi:10.1109/glocom.2016.7842125

Cited by 12 publications

(10 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many existing research works (e.g. [30,37,42]) consider UDP traffic evaluating TCP traffic. This is because in a real network it is very unlikely that a network would serve only TCP traffic at a given time.…”

Section: Resultsmentioning

confidence: 99%

Evaluating TCP performance of routing protocols for traffic exchange in street-parked vehicles based fog computing infrastructure

et al. 2020

View full text Add to dashboard Cite

As most vehicles remain parked 95% of its time, this suggests that leveraging the use of On-board Units (OBUs) in parked vehicles would provide communication and computation services to other mobile and fixed nodes for delivery of services such as multimedia streaming, data storage and data processing. The nearby vehicles can form an infrastructure using IEEE 802.11p communication interface, facilitating communication, computation and storage services to the end users. We refer to this as a Vehicular Fog Computing (VFC) infrastructure. In this study, using NS-2 simulator, we investigate how six routing protocols consisting of two proactive routing protocols, Destination Sequence Destination Vector (DSDV) and Fisheye State Routing (FSR); two reactive routing protocols, Ad Hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR); and two geographic routing protocols, Distance Routing Effect Algorithm for Mobility (DREAM) and Location Aided Routing (LAR) perform when forwarding TCP traffic among the parked vehicles that form a VFC infrastructure in an urban street parking scenario. In order to reflect an urban street parking scenario, we consider a traffic mobility traces that are generated using SUMO in our simulation. To the best of our knowledge, this work is the first effort to understand how vehicle density, vehicle speed and parking duration can influence TCP in an urban street parking scenario when packet forwarding decision is made using proactive, reactive and geographic routing protocols. In our performance evaluation, positive results are observed on the influence of parking duration in parked vehicles as TCP performance in all routing protocols increases with longer parking duration. However, variable speed in parked vehicles and moving vehicles in an urban street parking scenario may not have significant influence on TCP performance, especially in case of reactive and proactive routing protocols. Further, our findings reveal that vehicle density in a VFC infrastructure can noticeably influence TCP performance. Towards the end of the paper, we delineate some important future research issues in order to improve routing performance in a street-parked vehicle based VFC infrastructure.

show abstract

Section: Resultsmentioning

confidence: 99%

Evaluating TCP performance of routing protocols for traffic exchange in street-parked vehicles based fog computing infrastructure

et al. 2020

View full text Add to dashboard Cite

show abstract

“…It introduces a bandwidth function to define flexible policies. BwE also shares the idea of the PPV framework [4] that routers cannot support the scale and complexity of enforcing per-flow policies. The difference between the two solutions is BwE uses a centralized control while PPV solves the throughput allocation in a fully distributed way.…”

Section: Related Workmentioning

confidence: 99%

“…This concept is extended by the Per Packet Value (PPV) method [4] that uses scalar values as packet markings instead of a few colors. PPV method uses a Throughput-Value Function to express operator policies and solves the resource sharing problem by maximizing the total transmitted packet value.…”

Section: Related Workmentioning

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.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

“…The same is pursued by the fair activity meter in ABC [6], but simulations have shown that fair activity metering degrades fairness for congestion-controlled traffic. PPV [11] adopts the ideas of RFQ and is discussed as a base mechanism for "Statistical Behaviors" which are new service level specifications that are currently discussed in Metro Ethernet Forum (MEF). They differentiate the impact of congestion among different flows within a single service class while avoiding per-aggregate states in core networks.…”

Section: Related Workmentioning

confidence: 99%

Implementation and Evaluation of Activity-Based Congestion Management Using P4 (P4-ABC)

et al. 2019

View full text Add to dashboard Cite

Activity-Based Congestion management (ABC) is a novel domain-based QoS mechanism providing more fairness among customers on bottleneck links. It avoids per-flow or per-customer states in the core network and is suitable for application in future 5G networks. However, ABC cannot be configured on standard devices. P4 is a novel programmable data plane specification which allows defining new headers and forwarding behavior. In this work, we implement an ABC prototype using P4 and point out challenges experienced during implementation. Experimental validation of ABC using the P4-based prototype reveals the desired fairness results.

show abstract

Per Packet Value: A Practical Concept for Network Resource Sharing

Cited by 12 publications

References 4 publications

Evaluating TCP performance of routing protocols for traffic exchange in street-parked vehicles based fog computing infrastructure

Evaluating TCP performance of routing protocols for traffic exchange in street-parked vehicles based fog computing infrastructure

Flow Fairness With Core-Stateless Resource Sharing in Arbitrary Topology

Implementation and Evaluation of Activity-Based Congestion Management Using P4 (P4-ABC)

Contact Info

Product

Resources

About