Scalable domain-based routing scheme for ICN

Moving the focus from nodes to information objects raises scalability issues, therefore name-based routing and name resolution should be designed to scale accordingly. There are two types of naming scheme: hierarchical and flat namespace. To guarantee clean separation of identifier (name) from locat...

Full description

Saved in:
Bibliographic Details
Main Authors: Joo-Chul Lee, Wan-Seon Lim, Hee-Young Jung
Format: Conference Proceeding
Language:English
Subjects:
domain
ICN
Id/locator separation
Logic gates
Network topology
Routing
Routing protocols
Scalability
scalable-routing
Servers
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Moving the focus from nodes to information objects raises scalability issues, therefore name-based routing and name resolution should be designed to scale accordingly. There are two types of naming scheme: hierarchical and flat namespace. To guarantee clean separation of identifier (name) from locator and scalability in routing, we chose flat name and designed domain-based routing. A significant requisite to be considered when flat name is chosen is an efficient name-resolution system (NRS). Bloomfilter-based NRS [9] is our proposal for this issue. Once a name is resolved into locator(s), discovery and delivery steps are carried out based on the routing scheme of locator. For scalability in routing of locator, network is projected into hierarchically-organized domain structure. A domain is a group of nodes or other domains. This composition could be physical or logical. Each domain has its own identifier, and the concatenation of domain IDs from top level domain to a certain domain which a node belongs to is a "locator" for that node. Each domain has one or more domain gateways. All traffic from/to the domain should pass through any of domain gateways. Routing information based on this type of locators is exchanged among domain gateways by using modified link-state routing protocol which can suppress LSA explosion. Thanks to this hierarchical domain structure, locators are highly aggregatable (which means scalable routing), and any node in heterogeneous network can communicate each other.
ISSN:2162-1233
DOI:10.1109/ICTC.2014.6983284