Seamless Mobility in Information Centric Networking

Existing State of the art work for Mobility Support in Information Centric Networking

1. Seamless Mobility in ICN Mahfuzur Rahman bosunia CC Lab.

2. Contents Introduction Mobility Support in ICN Approaches Reactive Proactive Selective Neighbor Caching 5/29/2024 2

3. Introduction End-to-end (E2E) Internet Architecture Endpoint centric Accused as the root of all evil (NAT, CDN, MIP) Publish/Subscribe (Pub/Sub) Internet Architecture Information Centric Networking (ICN) Information decoupled from location The Pub/Sub Internetwork Architecture The Pub/Sub architecture of PSIRP/PURSUIT Supports multicast, anonymity and asynchrony Seamlessly supports mobile nodes (MNs) 5/29/2024 3

4. ICN Over Mobile IP Handover in mobile IP Data sent during disconnection are lost Mobile IP extensions reduce handover delay Micro mobility keeps handovers local Context transfer allows fast reconnections Handover in mobile ICN ICN mechanisms simplify things No need for rendezvous in time Data can be cached during disconnection Allows multicast assisted mobility Target multiple Access Points (APs) Data can be provided by anyone 5/29/2024 4

5. ICN: Pub/Sub Internet Architecture Three main entities Publisher : advertises availability of information items Issues publication messages ends information items upon request Information items may have many publishers Subscriber: expresses interest on information items Issues subscription messages Receives information items from some publisher Event notification service Brings publishers and subscribers together 5/29/2024 5

6. ICN: Pub/Sub Internet Architecture Information identifiers: Statistically unique pair Rendezvous ID (RID): application derived Scope ID (SID): access control and policies Example: Scope_A / Scope_B /…/ Scope_Z /RID Rendezvous Network (RENE) Provides the event notification service Consists of Rendezvous Nodes (RN) Each information item handled by an RN The Rendezvous Point (RVP) of the item RENE matches publishers and subscribers Instructs publishers to start forwarding data 5/29/2024 6

7. ICN: Pub/Sub Internet Architecture Forwarding ID (FID): sent by RVP to the publisher Source routing path to subscribers (multicast) Each link has a statistically unique Link ID Within its AS or network area A path is encoded as a Bloom filter of Link IDs Each node tests its Link IDs against the FID Native multicast without extra cost Publishers do not know subscribers (anonymity) FIDs do not betray location FIDs can be frequently changed/invalidated Pub/Sub decoupled in time (asynchrony) 5/29/2024 7

8. ICN: Pub/Sub Internet Architecture Bob RV Point Router Alice < Bob_SId, Bob_RId, metadata > <Bob_SId, Bob_RId, metadata> <Bob_SId, Bob_RId> <Bob_SId, Bob_RId> AP2 AP1 5/29/2024 8

9. Seamless Mobility: Caching in ICN Caches are just alternative publishers The RVP may point at cached data copies Transparent caching The cache stores in transit data The RVP is notified about the cached data Non-transparent caching The cache intercepts subscription requests Information explicitly delivered in two stages One FID from the publisher to the cache Another FID from the cache to the MN 5/29/2024 9

10. Seamless Mobility Two generic approaches: reactive and proactive Assume that each MN is served by a broker Reactive approach On disconnection the old broker starts caching data On reconnection data are available from there Proactive approach Old broker selects candidate neighbor brokers On disconnection candidates cache data for the MN On reconnection the new broker already has the data 5/29/2024 10

11. Seamless Mobility: Reactive Approach Bob RV Point Smart Cache Router Alice < Bob_SId, Bob_RId, metadata > <Bob_SId, Bob_RId, metadata> <Bob_SId, Bob_RId> <Bob_SId, Bob_RId> AP2 AP1 Broker 5/29/2024 11

12. Seamless Mobility: Reactive Approach Bob RV Point Smart Cache Router Alice’s previous position Alice’s new position Fid (SC, Alice@AP2) 5/29/2024 12

13. Seamless Mobility: Proactive Approach A broker serves each MN Could be the AP or a nearby cache The broker selects candidate neighbor brokers Need an algorithm to select the best candidates MN disconnection The old broker notifies the selected neighbors The selected neighbor brokers start caching data MN reconnection The new broker becomes known on reconnection Data are already available at the new broker 5/29/2024 13

14. Summary How to select the candidate neighbors? Each neighbor incurs some caching costs i j m k l MN Current broker Candidate brokers 5/29/2024 14