TY - GEN
T1 - BalanceDN
T2 - 9th IEEE World Forum on Internet of Things, WF-IoT 2023
AU - Gunti, Murali
AU - Rojas-Cessa, Roberto
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - In Named Data Networking (NDN), data is identified by unique names instead of IP addresses, and routers use the names of the content to forward Interest packets towards the producers of the requested content. However, the current content search mechanism in NDN is complex and slow. This mechanism not only creates congestion but also hinders practical deployment due to its slowness and cumbersome nature. To address this issue, we propose a methodology, called BalanceDN, that distributes content through the network such that sought content can be found quickly. BalanceDN uses a distributed allocation of resolvers as those used by the domain name system but differs in how content is distributed. Our approach avoids flooding the network with pending interest requests and also eliminates the need for blind search when the location of content is unknown. We tested our approach on a simulation platform for NDN called ndnSIM. The results show that the proposed routing scheme utilizes far fewer network resources compared to the NDN network when retrieving content. The proposed scheme accomplishes this performance gain by leveraging a load-balanced hashing mechanism to distribute and locate the name of the content on the distributed nameserver lookup service nodes.
AB - In Named Data Networking (NDN), data is identified by unique names instead of IP addresses, and routers use the names of the content to forward Interest packets towards the producers of the requested content. However, the current content search mechanism in NDN is complex and slow. This mechanism not only creates congestion but also hinders practical deployment due to its slowness and cumbersome nature. To address this issue, we propose a methodology, called BalanceDN, that distributes content through the network such that sought content can be found quickly. BalanceDN uses a distributed allocation of resolvers as those used by the domain name system but differs in how content is distributed. Our approach avoids flooding the network with pending interest requests and also eliminates the need for blind search when the location of content is unknown. We tested our approach on a simulation platform for NDN called ndnSIM. The results show that the proposed routing scheme utilizes far fewer network resources compared to the NDN network when retrieving content. The proposed scheme accomplishes this performance gain by leveraging a load-balanced hashing mechanism to distribute and locate the name of the content on the distributed nameserver lookup service nodes.
KW - Content Search
KW - Efficient Content Placement
KW - Information Centric Networking
KW - Interest Packet
KW - Named Data Networking
KW - Search Routing
UR - http://www.scopus.com/inward/record.url?scp=85195428787&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85195428787&partnerID=8YFLogxK
U2 - 10.1109/WF-IoT58464.2023.10539433
DO - 10.1109/WF-IoT58464.2023.10539433
M3 - Conference contribution
AN - SCOPUS:85195428787
T3 - 2023 IEEE World Forum on Internet of Things: The Blue Planet: A Marriage of Sea and Space, WF-IoT 2023
BT - 2023 IEEE World Forum on Internet of Things
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 12 October 2023 through 27 October 2023
ER -