Energy-efficient quality of service aware forwarding scheme for Content-Centric Networking

Li, Chengming; Liu, Wenjing; Wang, Lei; Li, Mingchu; Okamura, Koji

doi:10.1016/j.jnca.2015.08.008

Cited by 28 publications

(15 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed ANFSD is simulated over Mini‐NDN, which extends the Mininet to support the emulation of NDN nodes by combining jNDN based on java, running on a personal computer with Intel (R) core (TM)2 Quad, 2.67 GHz CPU, 4G RAM over Windows 8. Traditional adaptive NDN forwarding (TANF) scheme, joint NDN forwarding scheme of domain division and ACO (JNDA), and our previous work ANFS are used as 3 comparison benchmarks. In addition, Deltacom network topology (as shown in Figure , a content requester and 5 content providers) with 97 nodes and 124 edges is selected to do the performance evaluation by sending 50, 100, 150, 200, 250, 300, 350, 400, and 1000 interest requests, where bandwidth (maximum transfer unit), delay, and error rate are set to be 128 Mbps, 20 ms, and 0.01, respectively.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…There have been a few research studies on ACO introducing some other technology strategies. For example, Li et al proposed a joint forwarding scheme of domain division and ACO usage. At first, the network topology was divided into multiple domains based on internet service provider (ISP), where an ISP could have many private domains.…”

Section: Related Workmentioning

confidence: 99%

“…In particular, the absolute subtrahend method was adopted to computer similarity relation. However, our previous work and the work of Li et al still had some limitations to be enhanced, such as increasing data transmission rate, balancing network load, and saving computation time, which are the focus of our attention in this paper.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

A smart ACO‐inspired named data networking forwarding scheme with clustering analysis

Wang

Huang

2018

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Different from the traditional IP network, named data networking (NDN) performs the stateful and adaptive forwarding, which faces some severe challenges such as efficient and self‐organized content retrieval. The current proposals are very difficult to address such challenges; therefore, this paper proposes a novel and smart NDN forwarding scheme by introducing both ant colony optimization and clustering analysis. At first, the discrete content concentration model is established with network load to address interest forwarding; in particular, we investigate the situation where the content retrieval is failed. Then, dot product method is used to compute similarity relation between 2 routers, which is considered as the clustering reference attribute. In addition, density‐based spatial clustering, ie, a clustering method, is exploited to detect core nodes that are used to cache the contents during the process of data forwarding. Finally, the proposed smart forwarding scheme is simulated over Mini‐NDN, and the simulation results show that it has better performance than the existent 3 schemes in terms of content retrieval rate, hop count, load balance degree, execution time, and throughput.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A smart ACO‐inspired named data networking forwarding scheme with clustering analysis

Wang

Huang

2018

Trans Emerging Tel Tech

View full text Add to dashboard Cite

show abstract

“…The proposed AIRDrop is an energy efficient unicast based routing protocol that minimize packet flooding overhead in ad‐hoc networks. It initially floods interest packer in the network.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Nodes in green color copies the payload in its cache and unicast to other nodes.This research investigated different routing protocols of CCN and concluded that some of them overcome delay through greedy path selection, 11-13 whereas other achieves energy efficiency. 1,14,[5][6][7][8][9][10][15][16][17][18][19][20][21][22] The authors of other works 9,10,18,19,23 discuss about the selection procedure of the communication channels in the cognitive area networks with high reliability. Some routing protocols provide both performance parameters but uses broadcasting on broken edges.…”

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

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

Energy‐delay‐aware caching strategy in green CCN using markov approximation

Dehghani

Movahhedinia

2019

Int J Communication

View full text Add to dashboard Cite

Summary One of the basic challenges in content‐centric networking (CCN) is how to optimize the overall energy consumption of content transmission and caching. Furthermore, designing an appropriate caching policy that considers both energy consumption and quality of service (QoS) is a major goal in green CCN. In this paper, the problem of minimizing the total CCN energy consumption while being aware of the end‐to‐end delay is formulated as an integer linear programming model. Since it is an Non‐deterministic Polynomial‐time (NP)‐hard problem, the Markov approximation method for an energy‐delay aware caching strategy (MAEDC) is proposed through a log‐sum‐exp function to find a near‐optimal solution in a distributed manner. The numerical results show that the MAEDC achieves near‐optimal energy consumption with better delay profile compared with the optimal solution. Moreover, due to the possibility of distributed and parallel processing, the proposed method is proper for the online situation where the delay is a crucial issue.

show abstract

Energy-efficient quality of service aware forwarding scheme for Content-Centric Networking

Cited by 28 publications

References 35 publications

A smart ACO‐inspired named data networking forwarding scheme with clustering analysis

A smart ACO‐inspired named data networking forwarding scheme with clustering analysis

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

Energy‐delay‐aware caching strategy in green CCN using markov approximation

Contact Info

Product

Resources

About