Flooding Control in Named Data Networking

Dash, Shatarupa; Sahu, Bharat J. R.; Saxena, Navrati; Roy, Abhishek

doi:10.1080/02564602.2017.1281173

Cited by 9 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Solutions that intended to alleviate the limitations of flooding commonly proposed to reduce or control the Interest forwarding (flooding) phase. The scoped‐flooding proposals attempt to adapt the flooding ball or ring from the receivers' perspective and at the cost of additional computation overhead at intermediate nodes 31,35,37,57–59 . A cluster‐based forwarding 58 and a flooding‐based strategy considering the relationship among content chunks 59 are proposed to reduce Interest flooding.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Current NDN forwarding strategies can broadly be divided into two categories 4 : flooding-based strategies [27][28][29][30][31][32][33][34][35] and single-route-based strategies. 4,24,36 However, the main problems of the former one are enormous traffic load, wastage of precious network and nodes resources, and forwarding performance degradation.…”

Section: Problem Statementmentioning

confidence: 99%

See 1 more Smart Citation

A source‐driven probabilistic forwarding and caching strategy in NDN and SDN‐based NDN

Iqbal

Asaduzzaman

Hoque

2022

Int J Communication

View full text Add to dashboard Cite

Summary NDN forwarding strategies are mainly developed receiver‐driven, where Interest forwarding and Data (content) delivery are controlled from the consumers' viewpoint. The receiver‐driven strategies are greedy by nature and emphasize optimizing the Interest forwarding, which is far from the performance bottleneck as an Interest is of tiny size in compared with a content's size. Thus, optimizing the content delivery can improve the forwarding performance. Moreover, source‐driven optimization of content delivery can alleviate the greedy nature of its counterpart. In this work, a source‐driven forwarding strategy is proposed where the content sources respond to Interest requests in a distributed manner. The content requests hit all the sources, but the sources respond probabilistically such that the content retrieval overhead and latency are minimized. The strategy consents the nearer sources to set a high probability of reacting with the matching content. On the contrary, the distant sources answer with an Offer to save transmission overhead. Besides, a caching strategy is proposed, an integral part of the source‐driven scheme, that caches diverse contents considering the gap between successive copies and content availability while admitting new contents. Next, we extend the source‐driven probabilistic forwarding strategy to operate in SDN‐based NDN architecture. The SDN‐based solution controls the content delivery phase using the global knowledge of NDN cache states. Simulation study conducted using ndnSIM reveals that the proposed forwarding and caching strategy improves user satisfaction and network performance in terms of different performance metrics such as transmission overhead, latency, and cache hit.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%

A source‐driven probabilistic forwarding and caching strategy in NDN and SDN‐based NDN

Iqbal

Asaduzzaman

Hoque

2022

Int J Communication

View full text Add to dashboard Cite

show abstract

“…To reduce the communication overhead resulting from excessive duplications in the broadcast, some variants of flooding are proposed. As shown in [17], Dash et al proposed a hop-controlled flooding to restrict the number of hops when forwarding the received messages. It describes a novel hop-count update procedure using a history database called Info-Base.…”

Section: Related Workmentioning

confidence: 99%

Cooperative Bargain for the Autonomous Separation of Traffic Flows in Smart Reversible Lanes

et al. 2019

View full text Add to dashboard Cite

Spacer bars in the smart reversible lanes make periodically broadcast of messages to share their local observed traffic information with each other. This aims to help other spacer bars acquire the global traffic information and make consistent movement when separating the flows. However, radio interference and vehicles in the traffic may degrade the qualities of wireless communication links and cause frequent message losses in the broadcast. Existing solutions tend to use data forwarding to enhance the message dissemination, which may cause imbalanced load in the spacer bars. For instance, the nodes close to the sink have to forward more messages, whereas the ones far away from the sink have fewer messages for forwarding. The unbalanced distribution of network load has a high risk of blocking the wireless communication links and yield inconsistent movement in the reversible lanes. In this paper, we propose a Cooperative Bargain (CoB) scheme where each spacer bar carries some received messages to help other spacer bars recover their lost messages. Since the spacer bars can only acquire the local information, we formulate a cooperative bargain game to negotiate how to allocate the task of message recovery with a balanced network load until a consensus is achieved. CoB is evaluated with the real-world Wi-Fi communication traces in Isti/rural. Simulation results show that CoB can recover an average of 98.6% messages within 100 milliseconds in a 50-node network. CoB does not require the global network information but it can still achieve a comparable performance to other broadcast schemes.

show abstract

“…These growing problems will be difficult to solve in the future with an IP-based Internet architecture [3]. As we know, Internet use is increasing day by day, and current resources are insufficient to overcome the huge number of ever-increasing needs of the Internet users [16]. To achieve a better performance, the Internet needs to implement an optimal approach that can face these increasing difficulties [17].…”

Section: Cache In Named Data Networkingmentioning

confidence: 99%

A Periodic Caching Strategy Solution for the Smart City in Information-Centric Internet of Things

et al. 2018

View full text Add to dashboard Cite

Named Data Networking is an evolving network model of the Information-centric networking (ICN) paradigm which provides Named-based data contents. In-network caching is the responsible for dissemination of these contents in a scalable and cost-efficient way. Due to the rapid expansion of Internet of Things (IoT) traffic, ICN is envisioned to be an appropriate architecture to maintain the IoT networks. In fact, ICN offers unique naming, multicast communications and, most beneficially, in-network caching that minimizes the response latency and server load. IoT environment involves a study of ICN caching policies in terms of content placement strategies. This paper addressed the caching strategies with the aim to recognize which caching strategy is the most suitable for IoT networks. Simulation results show the impact of different IoT ICN-based caching strategies, out of these; periodic caching is the most appropriate strategy for IoT environments in terms of stretch that results in decreasing the retrieval latency and improves the cache-hit ratio.

show abstract

Flooding Control in Named Data Networking

Cited by 9 publications

References 10 publications

A source‐driven probabilistic forwarding and caching strategy in NDN and SDN‐based NDN

A source‐driven probabilistic forwarding and caching strategy in NDN and SDN‐based NDN

Cooperative Bargain for the Autonomous Separation of Traffic Flows in Smart Reversible Lanes

A Periodic Caching Strategy Solution for the Smart City in Information-Centric Internet of Things

Contact Info

Product

Resources

About