## 3 Identity-Differentiated Content Acquisition Strategy
### Processing Sequence of Request Interest Message in Intermediate Nodes  
After the edge node receives the content request, it will send an interest message that follows the format of name field \(ContentName\) and command parameter field with \(REQENNUM\) to the content provider to request the number of encoded groups for specific content, as shown in Figure 2. It can also query the number of segmentation blocks K and encoded blocks \(N(K\leq N)\) for a particular encoded group through an interest message with the format of name field \(<ContentName/GenerationID>\) and parameter field of \(REQSUICENUM\). The content provider and the intermediate nodes encountered along the way that can satisfy these two interest message requests in their content stores will respond to them. After the edge node, \(Node_{e}\), obtains this information, it can fill in the content required by the interest message in Table 2 and issue a request \(INT_{req}\) for the content. After the intermediate node, \(Node_{m}\), receives the interest \(INT_{req}\) requesting the encoded block of a particular encoded group \(G_{i}\), it first checks its CS. It obtains an exact match with the content name within the interest message. If it is found that there are already \(M_{i}\) content encoded blocks with the same content distribution number stored in the CS, and \(M_{i}\geq K_{i}\), it indicates that these \(M_{i}\) encoded blocks can meet \(Node_{e}\)'s request for content grouping \(G_{i}\). IDEANE can ensure that only linearly independent encoded vectors and their corresponding blocks are cached in the CS. Due to the fact that IDEANE does not re-encode and decode encoded groups at intermediate nodes in order to avoid impacting the security characteristics of multi-identifier networks, it is still necessary for \(Node_{e}\) to calculate the maximum linearly independent encoded vector group for these encoded groups and pull the corresponding encoded blocks one by one. \(Node_{m}\) retrieves any encoded block in response to \(INT_{req}\). \(Node_{e}\) can request the remaining linearly independent encoded blocks sufficient to satisfy its decoding from \(Node_{m}\). If \(M_{i}<K_{i}\), the system examines whether the identity information of \(Node_{e}\) exists in the Bloom filter \(BF_{m}\) of the CS entry. If it does not exist, it will directly respond to \(INT_{req}\) with the encoded block and encoded vector in the table entry, update \(ReqNo\) as part of the data message, and leave the identity information of \(Node_{e}\) in \(BF_{m}\). If the identity information of \(Node_{e}\) already exists, it indicates that the \(Node_{m}\) has responded to the encoded block segment of the \(Node_{e}\). Then, the interest message \(INT_{req}\) can be used to continue applying for other linearly independent, new encoded blocks belonging to the encoded group. \begin{table}
\begin{tabular}{c c c} \hline \hline
**Content Name** & **Face** & **Identity and Provider** \\  & & **Information** \\ \hline  & 1 & 0 cc175b\%0f1b6a831c399e269772661, 65 \\  & & 6 cc175b\%0f1b6a831c399e269772661, 41 \\ \cline{2-3} /pku.edu.cn/web/promo.mp4/1/1 & 2 & 92 eb5 ffee6 ae2 fcc3 ad71c77531578f, 18 \\ \cline{2-3}  & & 0 cc175b\%0f1b6a831c399e269772661, 32 \\ \hline /pku.edu.cn/web/promo.mp4/1/2 &... \\ \hline \hline \end{tabular}
\end{table} 
Table 5: Pending interest table with identity hash. Next, the PIT is checked with an exact match to determine whether a PIT entry requests the same content group. If it does not exist, the system creates the corresponding table entry in PIT, writes the content group name, adds the hash of the routing interface, and identities the information, together with the request sequence number ReqNo, and forwards this interest message through the FIB. If present, it checks the interface information in the PIT table entry to inspect whether INreq carries the same identity information. If found, it indicates that \(Node_{e}\) has previously issued a request for the encoded group through the same or other interfaces.