CCN economics: Can ISPs profit by introducing CCN?

Content-centric networks (CCNs) are becoming the next generation of Internet communication technology for presenting a contents-based communication method from within the existing Internet paradigm to efficiently utilize the vast amount of information on the Internet. Accordingly, CCNs concentrate on the communication purpose, which defines everything on the Internet under the concept of “content” and uses all that information, unlike existing Internet communications technology, which concentrates on the communication procedure to and from the address of the host. A CCN communicates with “Interest packets” and “Data packets,” where an Interest packet is used by a customer to request contents, and the Data packet is used to respond to the customer with the content from the publisher. In the routing procedure for a CCN, the Interest packet is transmitted to neighbor routers in order to obtain the data. In this routing method, finding the data is preceded by sending the Interest packet. Thus, CCNs have the characteristic of unidirectional transmission when tracing the path of the Interest packet. Due to this characteristic, a CCN has low load-balancing with increases in data traffic. And a CCN has increasing packet delay times because it cannot distribute the traffic when returning Data packets. To resolve these problems, we propose a cluster-based path-relocation routing protocol to support load-balancing in content-centric networks.

SummaryThe Vehicular Ad‐hoc Network (VANET) is one of the emerging research areas in recent days, in which accomplishing the robustness and security are the demanding tasks. To obtain these objectives, various offloading‐based techniques are developed in the traditional works. Still, it remains with the limitations of high mobility, no assurance for data acceptance, and limited applicability for multiple data exchange units. Thus, this paper aims to develop a Data Centric Dispatcher Selection (DCDS) algorithm based on data offloading for a secure information exchange in VANET. It aims to enable the cellular‐based VANET connection by using the application layer protocol without taking the Pending Interest (PI)‐based information. Also, the Content Centric Network (CCN) concept is utilized to exchange the data between for upcoming internet. In this environment, the position of own vehicle and neighboring vehicle are known to each vehicle by using the Global Positioning System (GPS) and security messages. Moreover, the communication does not depend on the device's name, but it depends on the content name in CCN. Because of the availability of multiple interfaces in CCN, there is no content loss in the network. During simulation, various performance measures are used to evaluate the performance of the proposed technique, which includes throughput, packet loss rate, average end‐to‐end delay, total Satisfied Interest Packet (SIP), Forwarded Interest Packet (FIP), and average Interest Satisfactory Delay (ISD). Also, the superiority of this paper is proved by comparing it with some existing techniques such as Internet Protocol Television Quality of Service (IPTV‐QoS), Michael Oche (MO), and RobUst Forwarder Selection (RUFs).

<p class="JESTECAbstract">Content Centric Networking (CCN) is a modern architecture that got wide attention in the current researches as a substitutional for the current IP-based architecture. Many studies have been investigated on this novel architecture but only little of them focused on Pending Interest Table (PIT) which is very important component in every CCN router. PIT has fundamental role in packet processing in both upstream process (Interest packets) and downstream process (Data packets). PIT must be fast enough in order to not become an obstruction in the packet processing and also it must be big enough to save a lot of incoming information. In this paper, we suggest a new PIT design and implementation named CF-PIT for CCN router. Our PIT design depends on modifying and utilizing an approximate data structure called Cuckoo filter (CF). Cuckoo filter has ideal characteristics like: high insertion/query/deletion performance, acceptable storage demands and false positive probability which make it with our modification convenient for PIT implementation. The experimental results showed that our CF-PIT design has high performance in different side of views which make it very suitable to be implemented on CCN routers.</p>

With the development of the mobile Internet in recent years, the amount of data in Internet has increased substantially, resulting in more and more serious delivery delay and data cost surge, which has brought great pressure to traditional host-centered networks. As a result, a new network architecture, Content-Centric Networking (CCN), has emerged. Compared with traditional networks, CCN has larger network capacity and lower delivery delay, which can better improve quality of service. Contents are cached in the routers in a CCN. Thus, when a user’s interest packet is passed to routers, the router that caches the content can directly respond to the request. Efficient caching strategies in CCN can not only reduce link load and storage redundancy, but also reduce delivery delay caused by the surge of data. This chapter studies caching strategies in the CCN. In order to efficiently and reasonably place contents in routers and reduce the transmission delay, it firstly proposes a caching scheme based on on-path caching and off-path caching. Secondly, in order to further reduce the energy consumption, this thesis proposes a caching scheme to minimize energy consumption. In the caching scheme based on the on-path caching and off-path caching, we firstly analyze the factors such as the popularity of contents and the history of user’s requests. Secondly, we strengthen the collaboration and the sharing of caching information between routers. Finally, an optimization problem aiming at minimizing the delivery delay is established, and an approximate algorithm is designed to obtain the approximate solution to the problem. The simulation results show that this scheme can effectively reduce delivery delay. In the caching scheme for minimizing energy consumption, we firstly set up a network content transmission model and a storage model. Secondly, through the comprehensive analysis of the content size and popularity of contents, we design the cache scheme to minimize energy consumption cost in CCN. Then, we transform the caching problem to an energy cost minimization problem, which is subject to certain constraints. Finally, an improved genetic algorithm is used to solve the problem. Simulation results show that the caching scheme to minimize energy consumption can effectively reduce the energy consumption, and it is superior to other caching schemes.KeywordsContent-centric networkingCollaborative cachingEnergy consumption minimizationPopularity

Recently, Content-Centric Networking (CCN) has been extensively studied by networking researchers as one of the promising network architectures for realizing information-centric networks. CCN adopts a fundamentally different communication paradigm from that of the conventional Internet Protocol (IP). Therefore, advanced transport protocols developed for IP cannot be directly used in CCN. In this paper, we propose a packet loss detection mechanism called Interest ACKnowledgement (ACK). Interest ACKs provides information on the history of successful Interest packet receptions at a repository (i.e., content provider), this information is conveyed to the corresponding entity (i.e., content consumer) via the header of Data packets. Interest ACKs enable the entity to quickly and accurately detect Interest and Data packet losses in the network. We conduct simulations to investigate the effectiveness of Interest ACKs in a rather simple network topology. Our results show that Interest ACKs are effective for improving the adaptability, stability, and fairness of CCN with window-based flow control and that packet losses at the repository can be reduced by 10%–20%.

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.

CCN (Content-Centric Networking) enables users to retrieve content using the content's name. Researchers face critical challenges in terms of mobility. Since the routing information is part of the content name, when the provider moves, it is necessary to update all the routers' routing information. However, this requires significant costs. In this paper, we propose PNPCCN (Proactive Neighbor Pushing CCN), considering the popularity and rarity of mobility support, for providers in CCN environments. Via simulation studies, we demonstrate that our solutions are effective in terms of shorter numbers of retransmitted Interest packets, and average download times and higher delivery ratios during mobility.

SVDR: A scalable virtual domain-based routing scheme for CCN

Most network applications nowadays are related to the distribution of contents from a source to a number of users. Several developments such as CDN and P2P networking have been used to provide access to contents at the network edges. However, they have no ability to leverage caching at the network level and still rely on a host-based communication model. Recently, Content Centric Networking (CCN) has been emerged as a new networking paradigm. In CCN, the communication focuses on the named content instead of the IP address. This paper provides a framework for enabling video streaming over CCN. We performed experiments using CCNx on the PlanetLab to explore the effects of an overlay delivery path and a chunk size to the streaming quality. Furthermore, we study the deployment of MPEG-DASH to achieve adaptive bit-rate streaming over CCN, which reveals additional challenge.

To resolve inefficient content delivery mechanism in conventional internet-based networks, Content-Centric Networks (CCN) has been proposed for wired and wireless networks. One of issues in wireless CCN-based networks is overhead to achieve reliability on content delivery because CCN uses end-to-end two-way handshake with Interest/content packets. In this paper, a novel protocol to reduce overhead and achieve reliability is proposed. The protocol allows Interest packet to request multiple data packets and multiple data packets to be sent in a row without a Interest packets. The protocol is evaluated through the simulations and the performance improvement is proved.

Content-centric networking (CCN) is an innovative network architecture that is being considered as a successor to the Internet. In recent years, CCN has received increasing attention from all over the world because its novel technologies (e.g., caching, multicast, aggregating requests) and communication based on names that act as addresses for content have the potential to resolve various problems facing the Internet. To implement these technologies, however, requires routers with performance far superior to that offered by today's Internet routers. Although many researchers have proposed various router components, such as caching and name lookup mechanisms, there are few router-level designs incorporating all the necessary components. The design and evaluation of a complete router is the primary contribution of this paper. We provide a concrete hardware design for a router model that uses three basic tables — forwarding information base (FIB), pending interest table (PIT), and content store (CS) — and incorporates two entities that we propose. One of these entities is the name lookup entity, which looks up a name address within a few cycles from content-addressable memory by use of a Bloom filter; the other is the interest count entity, which counts interest packets that require certain content and selects content worth caching. Our contributions are (1) presenting a proper algorithm for looking up and matching name addresses in CCN communication, (2) proposing a method to process CCN packets in a way that achieves high throughput and very low latency, and (3) demonstrating feasible performance and cost on the basis of a concrete hardware design using distributed content-addressable memory.

Content-Centric Networking (CCN) focuses on content acquisition rather than end-to-end communication by decoupling content resources from special hosts. CCN does not need maintain stable paths between nodes and is independent of IP addresses, which make CCN convenient and efficient for mobile ad hoc network (MANET). In this paper, we develop an analytical model of content acquisition for Content-Centric MANET (CCM) in two-dimensional case, which considers in-network caching and nodes mobility. Closed-form expressions for round trip time and throughput are derived as functions of miss probabilities. From the expressions, we can obtain the relationship among the round trip time, cache size and content popularity. Simulations show that our model can be used as a guide to design CCM and to evaluate its performance.

Content-Centric Networking (CCN) is a communication paradigm that emphasizes content distribution. Named-Data Networking (NDN) is an instantiation of CCN, a candidate Future Internet Architecture. NDN supports human-readable content naming and router-based content caching which lends itself to efficient, secure, and scalable content distribution. Because of NDN's fundamental requirement that each content object must be signed by its producer, fragmentation has been considered incompatible with NDN since it precludes authentication of individual content fragments by routers. The alternative is to perform hop-by-hop reassembly, which incurs prohibitive delays. In this paper, we show that secure and efficient content fragmentation is both possible and even advantageous in NDN and similar content-centric network architectures that involve signed content. We design a concrete technique that facilitates efficient and secure content fragmentation in NDN, discuss its security guarantees and assess performance. We also describe a prototype implementation and compare performance of cut-through with hop-by-hop fragmentation and reassembly.

Machine-to-Machine (M2M) communication is a distinct capability that enables communications with anything. With the expected connection among several tens of billions of addressable mobile devices and the exchange of a huge amount of content, the Internet and mobile communication are entering a new era that inevitably faces several challenges, especially from a content dissemination perspective. It has been exposed to many limitations such as high control overhead, frequent location updates, and network congestion. To resolve such limitations, this paper proposes an efficient hierarchical routing and content retrieval mechanism, which is called Hierarchical Routing (H-Routing) for the wireless network based on Content-Centric Networking (CCN). The H-Routing is composed of a novel content discovery approach and a common service platform for generic communications and the integration of heterogeneous devices. The proposed mechanism uses CCN and Chord-like lookup in a hierarchical M2M system in the wireless mobile environment. The H-Routing mechanism reduces unnecessary flooding of content request messages, control overhead, and the waste of resources. We also implemented the proposed mechanism in the simulation environment and analyze the performance in terms of throughput, Interest packet overhead, and Interest error ratio.

Named Data Networking (NDN), an emerging communication model in the content centric networks, has recently presented a solid framework for the future Internet. The NDN exploits content name instead of host name (IP address) and content caching. These features make NDN particularly efficient in networks with intermittent connectivity and dynamic topologies such as mobile ad hoc networks (MANETs). Due to the structure of NDN nodes, design of forwarding strategies has a vital impact on the network performance. In this paper, we propose a new forwarding strategy: redundancy elimination forwarding (REF). In REF, the NDN node structure and the operation of the data structures are modified. These modifications improve network performance in terms of throughput, overhead and resource requirements. REF strategy is simulated in different scenarios based on ndnSIM and the results demonstrate that it provides robust performance for various environments.