A Search Approach Based on Query Similarity in Content-Centric Networks

Based on the Content-Centric Network (CCN) architecture, a data content can be stored at routing nodes along the transmission path on which the data content transmitted from the content source repository back to the requester. Therefore, while the routing nodes receive the same content requests again, the routing nodes that have stored the queried contents can answer the requests directly by responding with the requested contents from their own storage area. Thereby it eliminates the cost of sending the content requests to the content source repositories again, and thus improves the overall network transmission efficiency. In the CCN network, a routing node refers to the Forwarding Information Base (FIB) of its own forwarding engine - the FIB function is similar to the routing table used in the traditional IP network, for determining where to send out the request packets. This study proposes a Search Approach based on Query Similarity (SAQS), which analyses the information of the temporary data stored in the routing node itself, calculates the weight of the temporarily stored contents for coming query requests, and selects the node that is most likely to store temporarily the queried contents. Finally, through simulation, the proposed SAQS is compared with other query forwarding methods. Validating by different simulation cases, our proposed SAQS exhibits better content search hit rate, while the number of hops and delay time can still remain in satisfactory results.