Skip to main content
. 2024 Feb 8;10:e1854. doi: 10.7717/peerj-cs.1854

Algorithm 4. DATA packet processing.

1: Whenever the DATA packet arrived for the PIT Lookup
2: if (PIT hit) then
3:  calculate Freshness L(ck)[Tres] – – – – – Eq. (5)
4: end if
5: if (cn=pcn and L(ck)[Tres] is non-transient then
6:  cache DATA packet
7: else if (cn=pcn and L(ck)[Tres] is transient) then
8:  fetch the new updated copy of content ck from producer
9:  forward to intended interface
10: else if (cn!=pcn and L(ck)[Tres] is transient or non-transient) then
11:  forward the DATA packet to the next station
12: else
13:  drop the Data Packet
14: end if