A method for managing packets (f) over interfaces (i, j, k) of a Content Centric Networking node (i), the method comprising the following steps - receiving over a first interface (j) of the node (i) at least a request for a data packet (f); - if the data packet (f) is stored by the node (i), forwarding the data packet (f) over the first interface (j) of the received request; otherwise - performing an exploration step, by ∘ selecting randomly a second interface (i) out of a set of interfaces of the node (i) towards a neighboring node (v); ∘ forwarding the request over the second interface (i); ∘ receiving in response over the second interface (i)-the data packet (f) with associated time delivery value towards a copy of the packet (f) estimated by the neighboring node (v); o selecting a third interface (k) out of a set of interfaces of the node (i) towards a neighboring node (v), the third interface (k) providing the shortest path in terms of delay towards a permanent copy of the data packet; o forwarding the request over the third interface (k); o receiving in response over the third interface (k) the data packet (f) with associated time delivery value towards a copy of the packet (f) estimated by the neighboring node (v); - identifying an interface providing the minimum data packet delivery time value based on exploration step results. - receiving over a first interface (j) of the node (i) at least a request for a data packet (f); - if the data packet (f) is stored by the node (i), forwarding the data packet (f) over the first interface (j) of the received request; otherwise - performing an exploration step, by ∘ selecting randomly a second interface (i) out of a set of interfaces of the node (i) towards a neighboring node (v); ∘ forwarding the request over the second interface (i); ∘ receiving in response over the second interface (i)-the data packet (f) with associated time delivery value towards a copy of the packet (f) estimated by the neighboring node (v); o selecting a third interface (k) out of a set of interfaces of the node (i) towards a neighboring node (v), the third interface (k) providing the shortest path in terms of delay towards a permanent copy of the data packet; o forwarding the request over the third interface (k); o receiving in response over the third interface (k) the data packet (f) with associated time delivery value towards a copy of the packet (f) estimated by the neighboring node (v); ∘ selecting randomly a second interface (i) out of a set of interfaces of the node (i) towards a neighboring node (v); ∘ forwarding the request over the second interface (i); ∘ receiving in response over the second interface (i)-the data packet (f) with associated time delivery value towards a copy of the packet (f) estimated by the neighboring node (v); o selecting a third interface (k) out of a set of interfaces of the node (i) towards a neighboring node (v), the third interface (k) providing the shortest path in terms of delay towards a permanent copy of the data packet; o forwarding the request over the third interface (k); o receiving in response over the third interface (k) the data packet (f) with associated time delivery value towards a copy of the packet (f) estimated by the neighboring node (v); - identifying an interface providing the minimum data packet delivery time value based on exploration step results.