Cooperative routing protocol for Content-Centric Networking

Tarnoi, Saran; Suksomboon, Kalika; Kumwilaisak, Wuttipong; Ji, Yusheng

doi:10.1109/lcn.2013.6761314

Cited by 11 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cooperative optimal routing protocol for content centric network was proposed in the work of Tarnoi et al to calculate the compromising path in terms of shortest path and cache hit rate estimated through the request router and the provider router. Server load and network traffic are maintained to save bandwidth by placing the content in closest CS to minimize the content retrieval time . It provides the low cost connection to the provider router and requester router; different requester router and provider router have path to access the content and have shortest path length.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The cooperative optimal routing protocol for content centric network was proposed in the work of Tarnoi et al 34 to calculate the compromising path in terms of shortest path and cache hit rate estimated through the request router and the provider router. Server load and network traffic are maintained to save bandwidth by placing the content in closest CS to minimize the content retrieval time.…”

mentioning

confidence: 99%

See 1 more Smart Citation

CCN: A novel energy efficient greedy routing protocol for green computing

Siddiqa

Qureshi

Shah

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary We proposed a novel Energy Efficient Greedy Routing Protocol (EEGRP) in CCN for MANETs to achieve the gaps in the existing infrastructure of Green Cloud Computing. Initially, the consumer node broadcasts the interest packet; each relay node verifies if it is already satisfied, and then it drops the packet. Otherwise, the provider node selects shortest path to unicast data packet within minimum delay. Each relay node receives a data packet, stores its content in content store, and forwards it to next node according to path mention in the hop‐count field. If the data packet custodian node does not find path mention in the hop‐count field, then it searches the routing table entries to choose the second best path to unicast the data packet. EEGRP is implemented in three scenarios using ns2 and compare its performance with AIRDrop routing protocol on bases of three performance parameters like packet delivery ratio, delay, and energy consumption. EEGRP achieves high PDR with minimum delay and less energy consumption as compared to AIRDrop. Therefore, EEGRP is feasible to use on green computing and cloud technology. This can save energy issue to secure energy for Green Computing and Cloud before moving to full‐scale virtualization and Cloud services.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

mentioning

confidence: 99%

CCN: A novel energy efficient greedy routing protocol for green computing

Siddiqa

Qureshi

Shah

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…V is the normalized information value of the th q prefix group, and D represents the number of content chunks per prefix. Note that prefix group refers to the group of different data packets that have the associated prefixes [18,19]. According to the end-to-end delay for real-time communication [20],  is set to 250 millisecond to ensure that the requester will perceive content with acceptable quality on time.…”

Section: ) (T N Immentioning

confidence: 99%

“…-Cooperative routing protocol (CP) is the routing protocol that focuses on an FIB reconstruction and selectively aggregates the multiple interest packets into the same path [18]. -Optimal cooperative routing protocol (OCRP) is selectively multiple flows of interests into the same path and calculates the optimal path using binary linear optimization [19].…”

Section: Performance Evaluationmentioning

confidence: 99%

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

Sirichotedumrong¹,

Kumwilaisak²,

Tarnoi³

et al. 2017

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents an adaptive prioritized probabilistic caching algorithm (APP) for content centric networks (CCN). The objective of the new caching algorithm is to satisfy content requesters with both improving received data quality and maintaining overall network performance. APP allows CCN routers to cache data packets based on the caching probability which is prioritized and unequally handles incoming data packets according to data priorities. APP adjusts the caching probability based on cache events occurred at the CCN router, and the current caching probability is calculated from the previous caching probability. We evaluate APP performance via computer simulations and compare the performance of our caching algorithm with previous caching schemes. The performance evaluation metrics compose of the received data quality, cache-hit percentage, server load, and traffic load. The computer simulation results show that APP yields the better data quality to content requesters and nearly performs in-network caching as well as the previous probabilistic caching scheme.

show abstract

“…• Cooperative routing scheme (CP ) which is our previously proposed routing scheme [6]. CP has two major differences from OCRP.…”

Section: Performance Evaluationmentioning

confidence: 99%

Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking

Tarnoi

Kumwilaisak

2014

39th Annual IEEE Conference on Local Computer Networks

Self Cite

View full text Add to dashboard Cite

This paper presents an optimal cooperative routing protocol (OCRP) for Content Centric Networking (CCN) aiming to improve the in-network cache utilization. The objective of OCRP is to selectively aggregate the multiple flows of interest messages onto the same path. This improves the cache utilization while mitigating the cache contention in the Content Store (CS) of CCN routers on the routing path. The optimal routing path is obtained by binary linear optimization under threes constraints: flow conservation constraint, cache contention mitigating constraint, and path length constraint. Our simulation results of OCRP show the reduction in the server load and round-trip hop distance in comparison to those of the shortest path routing and our previously proposed cooperative routing schemes.

show abstract

Cooperative routing protocol for Content-Centric Networking

Cited by 11 publications

References 8 publications

CCN: A novel energy efficient greedy routing protocol for green computing

CCN: A novel energy efficient greedy routing protocol for green computing

Adaptive Prioritized Probabilistic Caching Algorithm for Content Centric Networks

Optimal cooperative routing protocol based on prefix popularity for Content Centric Networking

Contact Info

Product

Resources

About