PIE calculates the queuing delay by using Little’s Law. Another alternative approach to calculate queuing delay in PIE is to use CoDel-like timestamping approach. RFC 8033 recommends any one of the above-mentioned approaches to calculating queuing delay in PIE. Currently, all the implementations of PIE (except in FreeBSD) use Little’s Law for calculating queueing delay. In these projects, the main aim is to understand how FreeBSD using timestamping based approach to calculate queuing delay in PIE and implement the same in ns-3
- Understanding PIE AQM Algorithm
- Understanding PIE Implementation in ns-3
- Understanding PIE Implementation in FreeBSD
- How PIE Implementation in FreeBSD is different from ns-3
- Implementation of TimeStamp method of delay calculation in ns-3.
- Testing the Implementation against departure rate calculation method.
-
PIE: A Lightweight Control Scheme to Address the Bufferbloat Problem
-
FreeBSD code of PIE
├── ... ├── dn_aqm_pie.c ├── dn_aqm_pie.h ├── dn_sched_fq_pie.c └── ... -
ns-3 code of PIE
├── ... ├── pie-queue-disc.h ├── pie-queue-disc.cc └── ...