Content-Aware Delivery of Scalable Video in Network Coding Enabled Named Data Networks

Network coding (NC) and erasure coding (EC) share a common principle of encoding incoming data packets at network intermediate nodes so that destination nodes can reconstruct the original data packets using a sufficient number of encoded data packets collected at the destinations. While NC in general reduces the number of packets sent through the network, EC introduces redundancy into the packet streams to recover from lost packets. Many research papers in NC assume loss-free packet transmission, and to address this issue, end-to-end packet loss recovery through EC has been proposed. In this paper, we investigate hop-by-hop packet loss recovery through EC so as to avoid the accumulation of lost packets throughout the network using flow oriented EC. Specifically, we explore combined NC and EC at intermediate nodes in the networks to allow for improved packet loss recovery compared to end-to-end EC. Different implementations trading the packet processing complexity at the intermediate and destination nodes are considered. This paper first examines the effects of data loss in NC and then the improvements achievable with the proposed method are presented.

To provide seamless mobility support for the User in NDN (Named Data Networking) based cloud storage service, we propose a proxy based mobility support approach, called PMNDN. In this approach, we first introduce an ID that is structurally similar to the content name, to maintain the routing scalability of NDN architecture, and improve the addressing efficiency of INTEREST packet for NDN-based cloud storage service. Then, we deploy a new functional entity named Proxy, which is responsible for maintaining the reach-ability state of the User. We also extend the basic functionalities of the NDN Access Routers, such as tracking the mobility status of the User and initiating the handoff related signaling to the Proxy. With that, the User avoids participation in mobility signaling exchange. Finally, we construct an elastic 3-layer network analysis model, and compare the handoff performance of the mobility support approaches with that in NDN architecture and IPv6 architecture via analytical and simulation investigation. Our results indicate that not only PMNDN has lower handoff cost, it also has shorter handoff latency and less packet losses during the handoff process.

Named Data Networking (NDN) is one of the strong competitors of the next generation network architecture, meeting the needs of today’s users for the network. One problem with NDN is that the content requester does not know if there is any content in the network when it sends out the interest package, and it does not know where the target is. This problem is currently solved by the domain name resolution service, but the existing solution does not apply to the NDN architecture. Because the content in the NDN is identified by a human-readable name, the NDN architecture does not require an additional name resolution system. In this paper, we propose a blockchain-based Content Name Search Mechanism (BCNSM) by binding the content producer and the human-readable content name as the unique identifier of the content, and then using the blockchain as a trusted organization to store content information, and dynamically stores the information through the smart contract, thereby mapping the content name and the storage location to each other. BCNSM provides users with content name search services and name to the content provider resolution services. Then the model was built for the BCNSM using the colored petri net, and the model process is verified by the model simulation to meet the expectations, and the state space analysis proves that the BCNSM has no deadlock. Finally, a prototype of the smart contract was implemented in Ethereum’s testnet, and the storage and Gas overhead of content name registration and content cache address update were tested.

In this paper, we study the source mobility problem that exists in the current named data networking (NDN) architecture and propose a proxy-based mobility support approach named PMNDN to overcome the problem. PMNDN proposes using a proxy to efficiently manage source mobility. Besides, functionalities of the NDN access routers are extended to track the mobility status of a source and signal Proxy about a handoff event. With this design, a mobile source does not need to participate in handoff signaling which reduces the consumption of limited wireless bandwidth. PMNDN also features an ID that is structurally similar to the content name so that routing scalability of NDN architecture is maintained and addressing efficiency of Interest packets is improved. We illustrate the performance advantages of our proposed solution by comparing the handoff performance of the mobility support approaches with that in NDN architecture and current Internet architecture via analytical and simulation investigation. We show that PMNDN offers lower handoff cost, shorter handoff latency, and less packet losses during the handoff process.

Named-Data Networking (NDN) is the most promising architecture in the future Internet. NDN ensure high availability of contents and security of the data packet. However, it may disturb the stability and security in NDN routing such as Interest Flooding Attack (IFA). There are many existing detection and mitigation technique about IFA which labelled a non-collusive type of routing threats where it causes the PIT resources to exhausted and legitimate request could not perform in communication. Unfortunately, all the existing counter-measure mechanism could not defend the Collusive Interest Flooding Attack (CIFA). The attacks initiated with a satisfying interest and malicious data producer will reply to the corresponding request before the expiry of existing PIT entries in NDN router along the path. CIFA is classified as low rate intermittent attack which is very difficult in distinguish with legitimate requests. Thus, CIFA is more vulnerable and threatens than previous NCIFA. Moreover, there is no benchmark datasets or any public datasets to perform further experiments on detecting CIFA. Thus, there is a need to produce reliable datasets for future investigation in detection or mitigation relevant attacks in NDN.

Software Defined Networking (SDN) and Named-Data Networking (NDN) are two new paradigms that aim at changing the way we design and architect computer networks. The NDN architecture was first proposed to solve the problems of current Internet Protocol (IP) communication. However, there is an important disadvantages in the existing NDN, which are the very large size of the NDN forwarding table and the huge overhead cost of the forwarding process. This may result in not only a slow delivery of data, but also in a lot of network traffics. For this reason, this architecture cannot be appropriately used in a large-scale network.To solve this problem, we proposed a novel forwarding Strategy for Named Data Networking based on SDN and bloom Filter (NDN-SF) in order to improve the efficiency of content delivery and enhance the consumption of network resources. Our experimental results showed that latency and bandwidth consumption are reasonably low in our method NDN-SF. They also demonstrated that the developed scheme is more efficient than the existing forwarding strategies in NDN.

Named Data Networking (NDN) proposes a contentcentric rather than a host-centric approach to data retrieval. Data packets with unique and immutable names are retrieved from a content store (CS) using Interest packets. The current NDN architecture relies on forwarding strategies that are dependent upon on-path caching and is therefore inefficient. This approach reduces data transfer efficiency by ignoring the cached content available on the adjacent off-path routers in the network. In this paper, we propose a novel distributed multipath (D-MP) forwarding strategy and enhancements to the NDN Interest forwarding pipeline. Furthermore, we develop a centralized SDNenabled control for the multipath forwarding strategy (S-MP) that distributes Interests efficiently by using the global knowledge of the NDN network states. We perform extensive evaluations of our proposed methods on an at-scale WAN testbed spanning six geographically separated sites. Our solutions outperform the existing NDN forwarding strategies by a significant margin. We show that the D-MP strategy results in performance gains ranging between 10.4x to 12.5x over the default NDN implementation without in-network caching, and gains of 12.2x to 18.4x with in-network caching. In addition, for the S-MP case, we demonstrate a performance improvement of 10.6x to 12.6x, and 12.9x to 18.5x, for with- and without in-network caching respectively.

Network coding allows intermediate nodes to encode data packets to improve network throughput and robustness. However, it increases the propagation speed of polluted data packets if a malicious node injects fake data packets into the network, which degrades the bandwidth efficiency greatly and leads to incorrect decoding at sinks. In this paper, insights on new mathematical relations in linear network coding are presented and a key predistribution-based tag encoding scheme KEPTE is proposed, which enables all intermediate nodes and sinks to detect the correctness of the received data packets. Furthermore, the security of KEPTE with regard to pollution attack and tag pollution attack is quantitatively analyzed. The performance of KEPTE is competitive in terms of: low computational complexity; the ability that all intermediate nodes and sinks detect pollution attack; the ability that all intermediate nodes and sinks detect tag pollution attack; and high fault-tolerance ability. To the best of our knowledge, the existing key predistribution-based schemes aiming at pollution detection can only achieve at most three points as described above. Finally, discussions on the application of KEPTE to practical network coding are also presented.

In this paper we are interested in improving the performance of constructive network coding schemes for video transmission over packet lossy networks. A novel unequal packet loss protection scheme R2NC based on low-triangular global coding matrix with ladder-shaped partition will be presented, which combines redundant and random network coding for robust H.264/SVC video transmission. Firstly, the error-correcting capabilities of redundant network coding make our scheme resilient to loss. Secondly, the implementation of random network coding at the intermediate nodes with multiple input links can reduce the cost of network bandwidth, thus reducing the end to end delay for video transmission. Thirdly, the low-triangular global coding matrix with ladder-shaped partition is maintained throughout R2NC process to provide unequal erasure protection for H.264/SVC priority layers. The redundant network coding avoids the retransmission of lost packets and improves error correcting capabilities of lost packets. Based only on the knowledge of the loss rates on the output links, the source node and intermediate nodes can make decisions for redundant network coding and random network coding (i.e., how much redundancy to add at this node). However, the redundancy caused by redundant network coding makes the network load increases, in order to improve network throughput, we perform random network coding at the intermediate nodes. Our approach is grounded on the overall distortion of reconstructed video minimization by optimizing the amount of redundancy assigned to each layer. Experimental results are shown to demonstrate the significant improvement of H.264/SVC video reconstruction quality with R2NC over packet lossy networks.

Blockchain is becoming more and more popular in various fields. Since the information transmission mode of the blockchain is data broadcasting, the traditional TCP/IP network cannot support the blockchain system well, but the Named-Data Networking (NDN) could be a good choice because of its multi-path forwarding and intra-network caching functions. In this article, we propose a new blockchain information transmission acceleration strategy (AITS) combining with graph theory and probability theory based on the NDN architecture. We select some more important nodes in the network as “secondary nodes”, and give them more bandwidth and cache space to assist the NDN network in data transmission. In order to select the correct node as the secondary node, we present a method to calculate the number of secondary nodes, and give the function to calculate the importance of each node. The simulation results show that in complex networks, the proposed method has superior performance in accelerating information transmission and reducing data overhead.

It has been shown in the literature that Network Coding (NC) can boost the performance of wireless networks. However, to really obtain the potential gain of NC, efficient Medium Access Control (MAC) protocols that operate with awareness of the NC functions are necessary. In this paper, we propose a novel NC-aware MAC protocol for IEEE 802.11 wireless networks that combines k-batch transmissions and multiple receiver-initiated reverse direction exchanges involving NC data to boost the overall network performance. The proposed protocol allows any node to transmit a burst of data packets in a single channel access invocation. Then, an intermediate node can transmit an NC data packet when receiving a valid data packet from a source node, without contending for channel access. Both analytical and simulation results presented in this paper show the high throughput and energy efficiency of the proposed protocol with gains ranging from 33% to 298% when compared to existing mechanisms based on the IEEE 802.11 Standard.∗

The problem of multiple multicast sessions with
\nintra-session network coding in time-varying networks is considered.
\nThe network-layer capacity region of input rates that can be
\nstably supported is established. Dynamic algorithms for multicast
\nrouting, network coding, power allocation, session scheduling, and
\nrate allocation across correlated sources, which achieve stability
\nfor rates within the capacity region, are presented. This work
\nbuilds on the back-pressure approach introduced by Tassiulas
\net al., extending it to network coding and correlated sources. In
\nthe proposed algorithms, decisions on routing, network coding,
\nand scheduling between different sessions at a node are made
\nlocally at each node based on virtual queues for different sinks.
\nFor correlated sources, the sinks locally determine and control
\ntransmission rates across the sources. The proposed approach
\nyields a completely distributed algorithm for wired networks.
\nIn the wireless case, power control among different transmitters
\nis centralized while routing, network coding, and scheduling
\nbetween different sessions at a given node are distributed.

Two intrinsic features of Named Data Networking(NDN), in-network caching and multipath communication, offer the potential for fast and reliable big data transmissions via multisource content delivery. Network coding has recently been utilized to achieve efficient multisource content delivery in NDN. On the other hand, request pipelining is essential for efficient multisource content delivery in network coding enabled NDN. However, it is a challenge to simultaneously support network coding and request pipelining in NDN in a cost-effective way. To address this problem, we propose NCP-NDN, a network coding and request pipelining enabled named data networking architecture. NCP-NDN supports reasonably efficient Interest aggregation when enabling request pipelining without undermining the privacy of content retrieval by extending each Interest with a session and generation oriented requester identifier. Besides, NCP-NDN provides consumers with linearly independent blocks while request pipelining is enabled by combining rank-based matching, one forwarding of each block for per requester and face, and recoding the matching cached blocks before replying an Interest. Our experimental studies illustrate that NCP-NDN improves the performance of content delivery and reduces the overhead of big data transmissions as compared to the existing schemes.

Named Data Networking (NDN) has a built-in caching capability that is enabled with the help of its Content Store. Caching in NDN has several benefits, such as reducing overhead on the producer side, avoiding a single point of failure, and reducing network load. The primary caching policy of the NDN architecture is to leave copies everywhere. However, this scheme induces significant cache redundancy. Existing advanced cache techniques either periodically share the entire list of cached content at a node or make a caching decision without knowing the cached content at other nodes in the network. We propose an intelligent cache policy that estimates cache distribution and topology through a collaborative network of NDN routers, guided by Interest and Data packets. Additionally, we develop an NDN simulator to facilitate the testing and evaluation of our machine learning caching strategy. This paper details the cache policy, the design and functionality of our NDN simulator, and the experiments comparing our approach to baseline caching strategies.

In many networks there is a necessity to transmit data packets flows, the intensity of which exceeds the throughput of one channel SpaceWire, GigaSpaceWire, SpaceFibre. This flow can be a packet flow from a single source to a single destination, for example, from a camera to a monitor. Also, a packet flow can include packets from different sources to different destinations that goes via two neighboring routers. An example is transmission of packets between two routers located on the boundaries of neighboring regions. The packets, belonging to one flow can have almost same length (transmission of uncompressed video), or quite different length (transmission of compressed video, transmission of packets with different content between two regions). The adaptive routing can be used for transmission of such packet flows. This mechanism includes in SpaceWire standard. A set of alternative output ports (a group of ports) can be determined in routing table for the logical (or regional address). Any output port from this group (if connection for this port is established and port is not occupied by other packet) may be used for transmission of packet with this address. Thus, the summary throughput of all ports belongs to the group can be used for transmission of data packets with this address. However, the possibility of parallel transmission of packets from this flow to different output ports belongs to the group is required for effective utilization of this summary throughput. If the length of packets may be different or if the quantity of input ports for considered flows is not equal to the quantity of output ports in the group, the router should include special mechanisms to ensure efficient parallel transmission of packets to all ports belongs to the group. Adaptive routing for intensive data flows transmission can be implemented not only in SpaceWire/GigaSpaceWire networks, but also in SpaceFibre networks. We consider the specific of its implementation taking into account the features of data link layer (virtual channels with a fairly large buffers, retry mechanism) In this paper we discuss possible implementations of these mechanisms for SpaceWire, GigaSpaceWire and SpaceFibre, estimate achievable bandwidth utilization of port's group, the overhead of the implementation of these mechanisms for packets flows with different characteristics. A side effect of adaptive routing is a possible mismatch of the order in which packets are sent to the network form the source and the order of their receipt by destination. We evaluate the packet's window size that required in the destination node for recovery order of packets and the associated delays. The ports of router belonging to the same group may be connected to one or several different routers (according to the standard). In the first case all packets from the flow will be transmitted via one chain of routers (via one path via network). In the second case, they will be transmitted through the network in different ways. The reordering of packets is possible in both cases. However, in the first case, the mechanisms, that prevent the packets reordering, can be implement in routers. But its implementation can lead to decrease of throughput utilization, to additional hardware costs and to increase of packet's transmission time. In the paper we estimate these overheads for data packets flows with different parameters.