Research Article
Efficient Coded-Block Delivery and Caching in Information-Centric Networking
| | Input: data packet ; interface | | (1) | if PIT-OUT of interface matches then | | (2) | ifthen | | (3) | Cache data into CS; | | (4) | else | | (5) | Cache data into CACHE; | | (6) | end if | | (7) | for each interface in the of the matched PIT-OUT do | | (8) | Find the matched PIT-IN entry, i.e. , where ; | | (9) | if the matched PIT-IN entry of interface is satisfied then | | (10) | Respond to the PIT-IN entry , according to Algorithm 2; | | (11) | Delete the PIT-IN entry; | | (12) | else | | (13) | if the block carried by data is an original block and then | | (14) | Send data over interface ; | | (15) | Update to , where , ; | | (16) | end if | | (17) | end if | | (18) | end for | | (19) | if the matched PIT-OUT of interface is satisfied then | | (20) | Delete the PIT-OUT entry; | | (21) | end if | | (22) | else | | (23) | Discard data ; | | (24) | end if |
|
