Multipath congestion control in content-centric networks

Today’s Internet is no longer fit for the user traffic patterns that it is serving. To remedy this cognitive mismatch between the service platform and the traffic it serves, several future Internet architectures such as Content-Centric Networking (CCN) have been proposed recently with the aim of re-engineering the Internet towards supporting content-oriented communication. With the mechanisms to transform the Internet from being host-centric to becoming content-centric well spelt-out in the CCN standard, the problem of how to manage congestion and control traffic flows in CCN is still left open. Existing congestion control mechanisms for the current Internet have been shown to be ill-suited for CCN making the case for a clean-slate design of congestion control and traffic management mechanisms for CCN. In this thesis, we identify the fact that congestion in CCN can take place not only in the transmission buffer but also in the pending interest table (PIT), a data structure that keeps track of all requests received from downstream nodes and forwarded to upstream nodes. Keeping this in mind, we make three contributions in this thesis: First, we characterize the PIT occupancy distribution using a 2-dimensional continuous-time Markov chain model to study the impact of PIT entry timeout and interest retransmission on the interest blocking probability. Second, given the dependence of the PIT occupancy on the PIT entry timeout and interest retransmission, we investigate the performance of two types of routers in lossy networks: no-rtx routers that do not retransmit pending interests upon timeout, and rtx routers that do retransmit pending interests periodically. Based on this, we further introduce a novel adaptive method to estimate the PIT entry timer that relies on the data chunk response delays to replace the currently used fixed-value method introduced in CCN. Finally, identifying that content requesters should be responsible for retransmitting timeout requests and that estimates of the retransmission timeout should reflect the network load conditions, we propose a novel congestion control mechanism for CCN that takes into account both the PIT and the transmit buffer. Using the PIT occupancy as a good estimator for the data flight size to arrive to the node in the near future, we design a congestion avoidance mechanism that adjusts the request rate based on anticipated congestion.

Resource Pooling concept has been proposed as fair sharing of total network resources among all users sharing a network so that a whole network is treated as a single pooled resource. MPTCP (Multipath TCP) has been proposed as one of the most promising congestion controls which realize the Resource Pooling in the situation that each user can utilize multiple paths. In CCN (Content-Centric Networking), several multipath/multisource congestion control methods have been proposed. A fundamental difference between CCN congestion control and MPTCP where single source is assumed, is multisource and the Resource Pooling in multipath/multisource situation is quite a new research issue. In this paper, we discuss congestion control for CCN from the viewpoint of the Resource Pooling and show that our previously proposed congestion control satisfies the Resource Pooling concept. Our simulation results also show that our proposed congestion control achieves macroscopic fairness among users, which means the Resource Pooling concept is satisfied.

Content Centric Networking (CCN) is an emerging next-generation network infrastructure around content dissemination and retrieval, shifting from physical locations to named data. The built-in caching capacity of CCN, termed as in-network caching, promises to enable fast and effective content distribution at a global scale. Because of the in-network caching, the caching strategy of content location potentially affects how to make content searching decisions, while content searching in return decides in which routers content are stored. The relationship between content caching location and content searching has not been fully exploited in CCN or further used for the whole network performance improvement. This paper exploits the content caching location and content searching mechanism of CCN, and proposes a Popularity-driven content Caching Location and Searching scheme (P-CLS) in CCN. P-CLS leverages content access popularity to realize diverse content distribution and reduce content caching redundancy, which also overcomes the oscillation and frequent replacement phenomenon in the existing content caching and searching (CLS) scheme. Extensive simulations via hierarchical and arbitrary caching topologies show that the proposed scheme outperforms the existing caching algorithms.

Content-Centric Networking (CCN) naturally supports multi-path communication, as it allows the simultaneous use of multiple interfaces (e.g. LTE and WiFi). When multiple sources and multiple clients are considered, the optimal set of distribution trees should be determined in order to optimally use all the available interfaces. This is not a trivial task, as it is a computationally intense procedure that should be done centrally. The need for central coordination can be removed by employing network coding, which also offers improved resiliency to errors and large throughput gains. In this paper, we propose NetCodCCN, a protocol for integrating network coding in CCN. In comparison to previous works proposing to enable network coding in CCN, NetCodCCN permit Interest aggregation and Interest pipelining, which reduce the data retrieval times. The experimental evaluation shows that the proposed protocol leads to significant improvements in terms of content retrieval delay compared to the original CCN. Our results demonstrate that the use of network coding adds robustness to losses and permits to exploit more efficiently the available network resources. The performance gains are verified for content retrieval in various network scenarios.

In recent years, Content‐Centric Networking (CCN) has been considered as a novel promising paradigm for the future Internet, shifting from provider‐driven end‐to‐end communication mode to interest‐driven content retrieval communication one, which greatly depends on routing technology. In spite of this, CCN routing always faces two significant issues, ie, scalability and large‐scale deployment, which restrict the increasing development of CCN but can be addressed by introducing the ideas of Software‐Defined Networking (SDN) and community (domain) division. However, the current routing proposals on the integrating with SDN, community division or their combination, still have some limitations to be improved. Therefore, in this paper, we propose a novel and intelligent CCN Routing mechanism based on SDN and Community Division (CRSCD). At first, a community division scheme based on eigenvetor centrality and label propagation is proposed to help content retrieval. Then, for each divided community, we deploy an SDN controller which consists of two tables, ie, content index and community topology to help manage the global network view. Finally, a comprehensive routing mechanism including intracommunity routing based on Ant Colony Optimization (ACO) and intercommunity routing based on interaction frequency is devised. The proposed CRSCD is implemented over Cogent topology, and the experimental results demonstrate that the introduction of SDN and community division can accelerate content retrieval greatly and has better performance than the previous work.

Content-Centric Network (CCN) is next generation internet communication technology to provide existing internet communication paradigm as content based communication for efficient use various information in the Internet. Therefore, unlike existing internet communication technology, which focus on host based communication process, all ofresource is defined as contents in CCN.Moreover it focuses on purpose of communication for using information.CCN communicate with between routers through broadcast flooding method in their network environments.This characteristic of CCN is not considering increasing network traffic about each of CCN routers.Therefore, when the requesters are rapidly increased to particular CCN router, network congestion may be occurred by broadcast traffic.Moreover, this characteristic of CCN has low turnaround time about user request due to reducing performance of network system.To resolve this problem, this paper proposes a traffic aware routing protocol for congestion avoidance in CCN.The proposed routing protocol considers rapidly increasing traffic in the situation and establishes another routing path to avoid increasing traffic problem in CCN.

The Content Centric Networking (CCN) architectural framework is designed with the central abstraction of content distribution rather than host-to-host connectivity. CCN has several advantages such as inherent router caching, lower content retrieval time and network load reduction. However, it also faces various challenges such as scalability, deployment and storage issues. In particular, the routing state information that needs to be maintained in the CCN routers leads to very high memory requirements that might not be met using current technologies. If the routing state information stored in the routers is reduced, it leads to flooding of interest packets increasing congestion in the network. The objective of this paper is to propose techniques that avoid congestion due to interest flooding in CCN while having low router memory requirements. We have proposed three different algorithms to address this problem and present their performance using discrete-event simulation models.

Content-centric networking (CCN) introduces a paradigm shift from a host centric to an information centric communication model for future Internet architectures. It supports the retrieval of a particular content regardless of the physical location of the content. Content caching and content delivery networks are the most popular approaches to deal with the inherent issues of content delivery on the Internet that are caused by its design. Moreover, intermittently connected mobile environments or disruptive networks present a significant challenge to CCN deployment. In this paper, we consider the possibility of using mobile users in improving the efficiency of content delivery. Mobile users are producing a significant fraction of the total Internet traffic, and modern mobile devices have enough storage to cache the downloaded content that may interest other mobile users for a short period too. We present an analytical model of the CCN framework that integrates a delay tolerant networking architecture into the native CCN, and we present large-scale simulation results. Caching on mobile devices can improve the content retrieval time by more than 50%, while the fraction of the requests that are delivered from other mobile devices can be more than 75% in many cases.

CCN (content-centric networking) provides a solution to solve the problem of content acquisition and distribution in the view of network architecture. The finiteness of network resource and unexpectedness of network traffic result in network congestion inevitably. The mainstream implementation of CCN still relies on IP routing, so the study of congestion control scheme in CCN now cannot reflect the value of the research which can only superimpose over the congestion control scheme of IP. POF (Protocol-Oblivious Forwarding) is an extension of the OpenFlow protocol, which can support forwarding packets in any format. We have realized a prototype of CCN using POF. Then a joint congestion control strategy is proposed in POF-CCN. The experimental results show that the strategy can effectively control congestion in POF-CCN.

SummaryRecently, content‐centric networking (CCN) has become one of the important technologies for enabling the future networks. Along with its recognized potentialities as a content retrieval and dissemination solution, CCN has been also recently considered as a promising architecture for the Internet of things (IoT), because of 2 main features such as named‐based routing and in‐network caching. However, IoT is characterized by challenging features: small storage capacity of resource‐constrained devices due to cost and limitation of energy and especially transient data that impose stringent requirements on the information freshness. As a consequence, the intrinsic caching mechanisms existing in CCN approach do not well suit IoT domains; hence, providing a specific caching policy at intermediate nodes is a very challenging task. This paper proposes an effective multiattribute in‐network caching decision algorithm that performs a caching strategy in CCN‐IoT network by considering a set of crucial attributes including the content store size, hop count, particularly key temporal properties like data freshness, and the node energy level. Simulation results proved that our proposed approach outperforms 2 cache management schemes (probabilistic least recently used and AlwaysCache–first in first out in terms of improving total hit rate, reducing data retrieval delay, and enhancing content reusability in IoT environment).

The major objective of mobility management is to achieve efficient contents transfer for mobile nodes. Content Centric Networking (CCN), as a content-oriented architecture, is designed for efficient content delivery which can easily provide mobility management based on content caching. Caching schemes of CCN deeply influences the content acquisition efficiency and whole network performance. However, the existing cache policies are relatively stiff and lack of comprehensive consideration in terms of users and contents. As a result, the performance of caching cannot dynamically adapt to the change of users' demand for content items. In this paper, we propose a Classification-Based Wisdom Caching (CBWC) scheme for CCN, which can distinguish the regional correlation of user requests and reasonably organize cache content items according to the need of users in different regions. We evaluate the CBWC scheme and the results indicate that the proposed CBWC scheme can improve the hit rate of cache and optimize the users' quality of experience, which can be further improve the performance of mobility management.

Vehicle ad hoc network is the key technology for a future Internet of vehicles and intelligent transport system. However, involvement of vast number of vehicles in Internet of vehicles limits the performance of vehicle ad hoc network. To tackle this problem, a novel vehicle ad hoc network architecture with two different technologies such as software-defined networking and named-data networking is proposed in this article. In the proposed software-defined networking controlled vehicular named-data networking, IP addressing issue is resolved by named-data networking and global view of the network is attained by software-defined networking. Emergency data dissemination is initiated with packet classification. For packet classification, policy-based bifold classifier is proposed in roadside unit and supported by evolved interest packet. Subsequently, best disseminator selection is carried out by trustworthy weighted graph scheme based on novel weight value, which is computed by considering significant metrics. Content retrieval is accomplished by roadside unit and assisted by a controller. Location of content producer is obtained from a controller and optimal route is selected by roadside unit. Optimal route selection is performed by roadside unit for both content retrieval and vehicle-to-vehicle communication using novel region-based hybrid cuckoo search algorithm. Hybrid algorithm combines cuckoo search and particle swarm optimization algorithm to perform efficient route selection. Involvement of software-defined networking controller supports numerous users by providing a global view of the network, which includes network status and traffic information. Extensive simulation in NS-3 assures better interest satisfaction rate, interest satisfaction delay, forwarder interest packets, average hop count, and gain of scalability in software-defined networking controlled vehicular named-data networking than traditional vehicle ad hoc network.

Content-Centric Networking (CCN), a recent innovative architecture, has brought about a great number of challenges for researchers whose ambition is to design such network with highly advanced ability to respond quickly to increasing demands from users. This receiver-driven content paradigm creates a different perspective of network. In this paper, we propose a coupled multipath congestion control at receiver in CCN which helps to enhance its capability of balancing congestion and network efficiency while remaining fair share among single-path user. The simulation results have shown that it can ameliorate the existing multipath algorithm for CCN.

E-health is one of the domains which will need more and more IoT solutions in the future, as it requires short delays for life-dependency situations and safe local storage spaces for privacy matters. The emergency context demands efficient communication and computing capacities, and the cloud vision as well as traditional TCP/IP way of communication cannot really suit these requirements. New approaches are currently used : the fog computing paradigm, which describe the IoT environment in a more relevant way than the cloud vision, provides new performances as low latency, local storage opportunities, end-to-user services. E-health fogs have attracted a lot of attentions. To realize the efficient communication, E-Health systems also introduce Content-Centric Network (CCN) approach, whose characteristics include quick response, content distribution, IoT oriented technology. Nowadays, the existing E-health fog or CCN are seen as separate and autonomous networks, but many applications could require that those E-health fog computing systems exchange data, share processing results, or subscribe to each other information flux. In this paper we propose a solution for E-health systems to communicate by combining fog computing and CCN to provide communication efficiency and local storage opportunities. Finally we use simulation to evaluate the delay performances of our proposal.

The content-centric networking (CCN) paradigm proposed by PARC holds considerable promise as the architecture for the future Internet but remains incomplete. In this paper we argue that it is necessary to supplement CCN with mechanisms enabling controlled sharing of network bandwidth by concurrent flows. Traffic control is necessary to ensure low latency for conversational and streaming flows and to realize satisfactory bandwidth sharing between elastic flows. These objectives can be realized using "network neutral" traffic controls based on per-flow fair bandwidth sharing. The paper describes necessary CCN mechanisms and discusses the strategies to be implemented by end systems and routers. A simulation-based performance evaluation demonstrates the effectiveness of the proposed mechanisms and and the impact of possible strategies. We describe our experience in implementing some of the mechanisms using the CCNx prototype software.