| 摘要 |
<p>The invention concerns a content router of Content Centric Network comprising a plurality of modules :
- a content store (CS) comprising:
o a packet store (PS) containing Data packets, where every Data packet is inserted in the location corresponding to the hash value of the Data packet name modulo the number of bins, i.e. number of elements that can be stored in the packet store (PS),
o an index table (IT) for keeping track of Data packets stored in said packet store (PS), where every index entry contains a part (H-bit) of the hash value of the Data packet name, and the index entry inserted in the location corresponding to the hash value of the Data packet name modulo the number of bins, i.e. the index table is addressed as the packet store (PS),
- a pending interest table (PIT) for keeping track of Interest packets that have been forwarded to another node, an entry of said pending interest table (PIT) corresponding to:
o a part (H-bit) of the hash value of the Interest packet name, and
o at least one interface source of the Interest packet, the location of every entry in the (PIT) being computed as the hash value of the Interest packet name modulo the number of elements the (PIT) can contain,
- a forwarding information base (FIB) comprising:
o a hash-table comprising the list of content prefixes known by the content router with the next hop information,
€¢ every hash-table entry contains a part (H-bit) of the hash value of the content prefixes plus next hop information,
€¢ every hash-table entry is inserted in the location corresponding to the hash value of the content prefix modulo the number of elements the table can store.
o Bloom Filters BF programmed with prefixes contained in the hash-table, said bloom filters are then queried in order to determine which prefix length of Interest packet name should be checked in said hash-table.</p> |
