Scalable name-based inter-domain routing for information-centric networks

Kim, Sangmun; Duan, Zhenhai; Sanchez, Fernando

doi:10.1109/pccc.2015.7410286

Cited by 4 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lastly, we compare our proposed work with “NIDR,” 14 the only work that addresses BGP in NDN. Table 2 includes a comparison between NIDR and our approach in terms of traffic and speaker's type, messages, naming, security, and efficiency.…”

Section: Experimental Setup and Resultsmentioning

confidence: 99%

“…The only work that addresses BGP inter‐domain routing protocol is proposed in Sangmun et al 14 The authors proposed a scalable name‐based inter‐domain routing (NIDR) that modifies some parts in BGP routing protocol based on NDN hierarchical naming. Their work is mainly based on two assumptions: (1) Routing is done based on Internet Service Provider (ISP) names instead of content names, and (2) each AS has a small subset of internet domain names.…”

Section: Related Workmentioning

confidence: 99%

“…However, BGP, the de facto inter-domain routing protocol, was not sufficiently addressed in the NDN context. For NDN, there are four routing protocols 13,[26][27][28] that are designed to perform intra-domain routing protocol and one routing protocol 14 that is designed to perform inter-domain routing protocol and addresses BGP in its proposed routing protocol.…”

Section: Related Workmentioning

confidence: 99%

“…Section 5 presents the validation and performance evaluation of the proposed extension. It also contains a comparison between our approach and NIDR, the only work that addresses BGP in NDN 14 . Section 6 concludes the paper.…”

Section: Introductionmentioning

confidence: 99%

“…It also contains a comparison between our approach and NIDR, the only work that addresses BGP in NDN. 14 Section 6 concludes the paper.…”

mentioning

confidence: 99%

See 4 more Smart Citations

N‐BGP: An efficient BGP routing protocol adaptation for named data networking

Aldaoud

Al‐Abri

Awadalla

et al. 2022

Int J Communication

View full text Add to dashboard Cite

Named data networking (NDN) is gaining momentum as a future Internet architecture. NDN is a type of information-centric networking (ICN) that attempts to change the current Internet architecture from host/location-centric to content-centric, where data retrieving is done by the names of the contents irrespective of the location of the data. A mechanism to advertise the namebased prefixes between different domains is necessary to accelerate the NDN deployment. In IP-based routing, border gateway protocol (BGP) is the de facto inter-domain routing protocol that plays a vital role in Internet communication by enabling different Internet domains to exchange routing information.In its current form, BGP can advertise and process IP-based prefixes, but it cannot advertise or process NDN name-based prefixes. Accordingly, BGP needs to be extended to support NDN technology. This paper proposes an NDN extension for BGP, referred to as N-BGP, that offers a solution to exchange name-based routes in the current BGP networks. This proposed extension modifies the traditional BGP speaker into a hybrid one. This hybrid speaker is qualified to understand, advertise, receive, process, and store both IP-based and name-based routes simultaneously and efficiently, without disturbing or breaking the current Internet operation; that is, it can coexist along with traditional speakers. We also validate and evaluate our proposed solution in a hybrid environment, and the results show that N-BGP has the capability to exchange and process both Name and IP-based routes efficiently.border gateway protocol (BGP), information-centric networking (ICN), inter-domain routing, named-data networking (NDN) | INTRODUCTIONBGP is, the inter-domain routing protocol, responsible for exchanging Internet routing information between autonomous systems (ASes), where each AS contains a set of routers under a single administration. 1 However, in its current form, it processes, advertises, and stores IP-based prefixes, but it is not capable of processing, advertising, and storing name-based routes for NDN networks. NDN is one of the prominent information-centric networking (ICN) architectures. Accordingly, to enable the routing of name-based traffic, there are two obvious approaches: develop and implement a new name-based inter-domain routing protocol or evolve the existing BGP protocol to support name-based

show abstract

Section: Experimental Setup and Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…It also contains a comparison between our approach and NIDR, the only work that addresses BGP in NDN. 14 Section 6 concludes the paper.…”

mentioning

confidence: 99%

See 3 more Smart Citations

N‐BGP: An efficient BGP routing protocol adaptation for named data networking

Aldaoud

Al‐Abri

Awadalla

et al. 2022

Int J Communication

View full text Add to dashboard Cite

show abstract

Modeling and verifying NLSR protocol of NDN for CPS using UPPAAL

Yuan

Zhu

Yin

2021

J Software Evolu Process

View full text Add to dashboard Cite

Named Data Networking (NDN) is a new promising architecture of informationcentric networking, which supports multicast of data and adopts the publish/ subscribe model in the network. The features of NDN, including name-based data and in-network caching, make it a promising Internet architecture for cyber-physical systems (CPSs). Named-Data Link State Routing (NLSR) protocol is the routing protocol for NDN, which is designed to disseminate link state advertisements (LSAs) to both build a network topology and distribute all the name prefixes to every node in the network. In this paper, we make the very first attempt to formally model and verify some fundamental properties of the NLSR protocol using model checker UPPAAL. We validate the NLSR protocol modeled into timed automata with simulator in UPPAAL. We verify our model with four fundamental properties (termination, reachability of Sync Interest, reachability of Sync Data, and digest synchronization).The first synchronization problem is found in a scenario with two nodes topology.We give the improved model that owns a valid result in digest synchronization verification. To capture more problems, we make the model to support the simulation of temporary network crash. The second synchronization problem is also exposed in two comparative scenarios. We also propose a mechanism implemented in our model, which has a valid result in digest synchronization verification. We hope that our study and preliminary results would help enhancing the adaptability and robustness of NLSR protocol.

show abstract