TY - GEN
T1 - SNAMP
T2 - IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2015
AU - Afanasyev, Alexander
AU - Yi, Cheng
AU - Wang, Lan
AU - Zhang, Beichuan
AU - Zhang, Lixia
N1 - Publisher Copyright:
© 2015 IEEE.
PY - 2015/8/4
Y1 - 2015/8/4
N2 - Named Data Networking (NDN) is a proposed information-centric design for the future Internet architecture, where application names are directly used to route requests for data. This key component of the architecture raises concerns about scalability of the forwarding system in NDN network, i.e., how to keep the routing table sizes under control given unbounded nature of application data namespaces. In this paper we apply a well-known concept of Map-and-Encap to provide a simple and secure namespace mapping solution to the scalability problem. More specifically, whenever necessary, application data names can be mapped to a set of globally routable names that are used to retrieve the data. By including such sets in data requests, we are informing (more precisely, hinting) the forwarding system of the whereabouts of the requested data, and such hints can be used when routers do not know from where to retrieve the data using application data names alone. This solution enables NDN forwarding to scale with the Internet's well-understood routing protocols and operational practice, while keeping all the benefits of the new NDN architecture.
AB - Named Data Networking (NDN) is a proposed information-centric design for the future Internet architecture, where application names are directly used to route requests for data. This key component of the architecture raises concerns about scalability of the forwarding system in NDN network, i.e., how to keep the routing table sizes under control given unbounded nature of application data namespaces. In this paper we apply a well-known concept of Map-and-Encap to provide a simple and secure namespace mapping solution to the scalability problem. More specifically, whenever necessary, application data names can be mapped to a set of globally routable names that are used to retrieve the data. By including such sets in data requests, we are informing (more precisely, hinting) the forwarding system of the whereabouts of the requested data, and such hints can be used when routers do not know from where to retrieve the data using application data names alone. This solution enables NDN forwarding to scale with the Internet's well-understood routing protocols and operational practice, while keeping all the benefits of the new NDN architecture.
UR - http://www.scopus.com/inward/record.url?scp=84943262953&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84943262953&partnerID=8YFLogxK
U2 - 10.1109/INFCOMW.2015.7179398
DO - 10.1109/INFCOMW.2015.7179398
M3 - Conference contribution
AN - SCOPUS:84943262953
T3 - Proceedings - IEEE INFOCOM
SP - 281
EP - 286
BT - 2015 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2015
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 26 April 2015 through 1 May 2015
ER -