Research Article
Efficient Coded-Block Delivery and Caching in Information-Centric Networking
| | Input: Interest ; interface | | (1) | if CS matches then | | (2) | Respond to Interest according to Algorithm 2; | | (3) | else | | (4) | if PIT-IN of interface matches then | | (5) | Update PIT-IN; | | (6) | else | | (7) | Establish a new PIT-IN entry; | | (8) | end if | | (9) | Calculate the incremental Interest ; | | (10) | ifthen | | (11) | Separate the incremental Interest into several sub-Interests according to Algorithm 1; | | (12) | for each sub-Interest which needs to be sent over interface do | | (13) | if PIT-OUT of matches then | | (14) | Update PIT-OUT; | | (15) | Calculate the incremental Interest ; | | (16) | ifthen | | (17) | return; | | (18) | end if | | (19) | else | | (20) | Establish a new PIT-OUT entry; | | (21) | end if | | (22) | Send Interest (or ) from interface ; | | (23) | end for | | (24) | end if | | (25) | end if |
|
