A packet priority-aware active queue management

Quality of Service (QoS), fairness, and resource sharing control in networks have not been fully addressed. Existing resource-sharing strategies depend on maintaining flow states within the network and executing different policies based on these states, which lack of scalability. These strategies require adjustments when traffic patterns shift and are tailored to specific network scenarios. In this paper, we presents PV-AIFO (Packet Value-Admission-In First-Out) Active Queue Management (AQM). PV-AIFO combines the packet scheduling and drop strategies of AIFO with a resource sharing mechanism based on the Per Packet Value (PPV) concept. This method utilizes the AIFO algorithm to maintain a sliding window that tracks packets and dynamically calculates their relative priorities. These priorities combined with the state of queue congestion determine packet admission control. Simulation experiments demonstrate PV-AIFO integrates the strengths of both PPV and AIFO concepts, maintaining target queue delays while implementing policy based resource sharing. The motivation behind this algorithm is simplicity and ease of deployment in networks, as the original PPV methodscheduler requires costly and hardware unsupported packet drops from the middle of the queue.