Content-based Networking Research Articles

Latency Control of ICN Enabled 5G Networks

5G definition falls broadly into order of achievable data rate and reduction in end-to-end latency. Thanks to emerging technologies many features are available in the 5G design to detect, control and avoid congestion in the backhaul networks. In fact, 5G results from the conjunction of several recent technological developments, chief among them the re-purposing of next generation of wireless networks for large-scale functional connectivity and carrying of massive heterogeneous contents. For instance, information centric networks, as a promising candidate for the wireless caching architecture, can cache the contents and prohibits traffic avalanche entering the backhaul via content-based networking. The main objective of this paper is to minimize latency in 5G backhaul networks. The contribution of this paper is a twofold: (a) a distributed algorithm at the back-haul switches is proposed to detect and handle the congestion temporarily and locally with considering the fairness, IP friendliness, latency and convergence time. (b) an SDN-based centralized algorithm is proposed to treat the congestion via dynamic route selection, load-balancing, the orchestration of heterogeneous RBS components.

Content sharing with mobility in an infrastructure-less environment

Current networking technologies are ill-suited for content sharing in emerging military and first-responder networks where fixed infrastructures and stable connectivity cannot be assumed. New paradigms, in particular content-based networking, is proving to be a viable solution for operation in mobile infrastructure-less environments where intermittent and disrupted connectivity is normal. This paper presents CASCADE, a content-centric networking architecture that facilitates generation and dissemination of content in challenging “edge” environments. CASCADE is implemented in Android and has been subjected to thorough performance evaluation using both ad hoc Wi-Fi technology as well as military tactical radios. This paper discusses architectural approaches and decisions, and offers insights and lessons learned over the course of the project.

HOMOMORPHIC ENCRYPTION ALGORITHM USED FOR SECURITY ENHANCEMENT IN WIRELESS SENSOR NETWORK CONTENT-BASED ROUTING

The wireless sensor networks and manage the wireless communication, whereas MASs allow distributed systems to be designed and implemented in an autonomous way by optimizing the development process. Using autonomous objects provides new mechanisms for efficient processor and memory usage while enabling low-power consumption in communication. We have presented a content-based networking protocol to solve some inherent problems in wireless sensor networks, especially in communication. Content-based protocols are mainly maximized the rate of suitable message delivery and minimize the energy consumption by using techniques to maintain shortest paths. The proposed protocol sends data using agent-based platform, and each sensor can make its decision individually. This mechanism prolongs life time of the network. After some nodes die, system can automatically construct new paths for data dissemination. In this work, proposed model for security in wsn using Homomorphic encryption. As an experimental work, the performance analysis and evaluations are conducted in terms of some main efficiency metrics, which are first node dies and half of the nodes alive. As an energy-aware system, the total remaining energy level also be calculated, and this metric can be used for estimating the lifetime of the system.

An algorithm to evaluate routing conditions in smartphones-based wireless networks

The increasing penetration of smartphones, i.e., smart devices with multiple sensing and communication interfaces, creates the possibility to build novel types of networks. Opportunistic networking and Content-Based networking strongly rely on the use of such devices. Smartphones tend to have an ON/OFF status that strongly depends on the user activity, mobility pattern and energy saving approach. Wireless adaptors are, after the terminal screen, the strongest source of power consumption. It is therefore common for a node to occasionally turn off the networking device to save energy. The impact on routing of the presence of nodes in the off-state must therefore be thoroughly evaluated.We propose an analytical model based on evolving graphs, which provides an exhaustive evaluation of routing conditions with the aim to determine the best recurring strategy and parameters when dealing with end-devices that show an ON–OFF behavior. Computational results are given, both on static and dynamic scenarios.

A Semantics Based Routing Scheme for Content-Based Networking

Each of tasks within the application depends on multiple datasets that may be distributed anywhere within the Content-Based Networking. This paper defines the problem of scheduling distributed data-intensive application on to Gird resource and presents a formal resource and application model for the problem.

Towards Extreme Scale Content-Based Networking for the Next Generation Internet

In this paper, we are concerned about content-based networking (CBN) at extreme scales, characterized by a large number of widely spread consumers, heterogeneous consumer requirements, huge volume of publications, and the scarcity of end-to-end bandwidth. We extend CBN with a generic service model that allows consumers to express their interests in future publications including cached content, but also to quantify the maximum amount of information they are willing to consume. We take advantage of this knowledge to pace the dissemination process and therefore, enhance the service efficiency. Early evaluation results show gains of up to 80% compared to a baseline CBN model.

Routing algorithms for content-based publish/subscribe systems

In content-based publish/subscribe systems, messages target a dynamic group of participants whose expressed interests match the contents of the messages. In this generalization of multicasting communication, also dubbed content-based networking, naming, binding and communication are intertwined in the same substrate. Optimal content-based routing uses dissemination trees dynamically pruned to only cover the matching subscribers. It is a complex problem that has motivated significant research efforts. This paper presents a compilation of the main algorithms for routing messages in distributed content-based publish-subscribe systems proposed and published in the last decade. Discussion is focused on the content-based routing problem in respect to optimality, complexity and applicability. Moreover, whenever it is appropriate, the algorithms covered are also matched to similar algorithms familiar to the networking community, setting this paper apart from other surveys on the broad topic of publish/subscribe systems.