Information centric network: Research challenges and opportunities

Vasilakos, Athanasios V.; Li, Zhe; Simon, Gwendal; You, Wei

doi:10.1016/j.jnca.2015.02.001

Cited by 209 publications

(78 citation statements)

References 35 publications

(43 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors further extracted the network traffic characteristic and unleashed the power of packet schedulers with fine-grained balancing method. Compared to CRC and other hash functions, highest random weight (HRW) hashing stands out due to the characteristics like theoreticallyproven good data locality, flow-level load balancing, minimal disruption and low overhead [10], [17]- [19]. Kuang et al [10] proposed E-AHRW, which was based on the adaptive HRW schemes.…”

Section: Related Workmentioning

confidence: 99%

Protocol-Aware Packet Scheduling Algorithm for Multi-Protocol Processing in Multi-Core MPL Architecture

Zhang

Wang

Sheng

et al. 2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYCache affinity has been proved to have great impact on the performance of packet processing applications on multi-core platforms. Flow-based packet scheduling can make the best of data cache affinity with flow associated data and context structures. However, little work on packet scheduling algorithms has been conducted when it comes to instruction cache (I-Cache) affinity in modified pipelining (MPL) architecture for multi-core systems. In this paper, we propose a protocol-aware packet scheduling (PAPS) algorithm aiming at maximizing I-Cache affinity at protocol dependent stages in MPL architecture for multi-protocol processing (MPP) scenario. The characteristics of applications in MPL are analyzed and a mapping model is introduced to illustrate the procedure of MPP. Besides, a stage processing time model for MPL is presented based on the analysis of multi-core cache hierarchy. PAPS is a kind of flowbased packet scheduling algorithm and it schedules flows in consideration of both application-level protocol of flows and load balancing. Experiments demonstrate that PAPS outperforms the Round Robin algorithm and the HRW-based (HRW) algorithm for MPP applications. In particular, PAPS can eliminate all I-Cache misses at protocol dependent stage and reduce the average CPU cycle consumption per packet by more than 10% in comparison with HRW.

show abstract

Section: Related Workmentioning

confidence: 99%

Protocol-Aware Packet Scheduling Algorithm for Multi-Protocol Processing in Multi-Core MPL Architecture

Zhang

Wang

Sheng

et al. 2017

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…ICN mainly has two naming structures: the hierarchical naming and the flat names [17] . The ICN names are human readable not like the IP address and are used for identifying and routing the requests.…”

Section: Namingmentioning

confidence: 99%

A novel architecture of CCN for better security and applicability

Sharma¹,

Kim²

2017

Journal of the Korea Society for Simulation

View full text Add to dashboard Cite

Information Centric Networking is changing the way how content is being transmitted. The shift from IP and host based networking towards content based networking scenario is growing day by day. Many researches have been done about different frameworks of ICN. Caching is an important part of ICN and many researchers have also proposed different ways for caching the data. With caching of data in intermediate devices like the network devices as well the user devices in some cases, the issue of content security as well as the role of the content producer becomes a major concern. A modified ICN architecture based on the current Content Centric Networking (CCN) model is presented in the paper. The architecture mainly focuses on involving the content producer in content delivery in the real time. The proposed architecture provides better security aspects for the CCN architecture. Apart from security the paper will also consider the issue of applicability of CCN architecture to replace the TCP/IP based architecture. The efficiency of the proposed architecture is compared with the previous CCN architecture based on the response time for a content delivery which shows very comparable level of efficiency. The paper than analyzes different beneficial aspects of the proposed architecture over the current architecture.

show abstract

“…Many algorithms are based on green technology assumptions for ad hoc networks [22,23]. Other works are based on multilayer clusters [24], routing quality games [25], spatial reusability [26], and other solutions can be found in [27][28][29][30][31][32][33][34][35][36][37][38][39][40][41][42][43][44], and complex surveys in works [45,46].…”

Section: State Of the Artmentioning

confidence: 99%

Mobility-based routing algorithm in delay tolerant networks

Kawecki

Schoeneich

2016

J Wireless Com Network

View full text Add to dashboard Cite

The paper presents a routing algorithm based on the use of the mobility of the nodes in the Delay and Disruptive Tolerant Networks (DTN). DTN are characterized by temporary or permanent lack of a continuous path between the source and the destination node. The communication is done by ferrying the message by intermediate nodes based on store-carry-forward paradigm. Our routing algorithm is based on the ability to use information about node mobility and their contacts. We assume that the greater mobility of node results in higher number of contacts with other nodes and higher probability in message delivery to the destination. The proposed algorithm was simulated using The One simulation tool. We compare the performance of our algorithm and other popular routing algorithms.

show abstract

Information centric network: Research challenges and opportunities

Cited by 209 publications

References 35 publications

Protocol-Aware Packet Scheduling Algorithm for Multi-Protocol Processing in Multi-Core MPL Architecture

Protocol-Aware Packet Scheduling Algorithm for Multi-Protocol Processing in Multi-Core MPL Architecture

A novel architecture of CCN for better security and applicability

Mobility-based routing algorithm in delay tolerant networks

Contact Info

Product

Resources

About