network virtualization is believed to be a promising way for the next generation Internet to overcome network ossification. It allows multiple heterogeneous virtual networks (VNs) to be embedded onto the shared substr...
详细信息
network virtualization is believed to be a promising way for the next generation Internet to overcome network ossification. It allows multiple heterogeneous virtual networks (VNs) to be embedded onto the shared substrate network (SN) to offer more flexibility and better manageability. With the increasing deployments of VNs in a variety of networks, how to protect the VNs against the single substrate link failure has become a key challenge. In this paper, we propose a survivable VN link protection method based on network coding and protection circuit. First, we provide an integer linear programming formulation for the survivable VN link protection to maximize the long-term average revenue to cost ratio. Second, a novel protection circuit technology is introduced to augment the VN at the VN level to reduce the backup resource consumption and provide more flexible VN management. Then, an efficient heuristic virtual network embedding algorithm is developed, which makes full use of the limited resources and transforms the single substrate link protection into the single virtual link protection in multiple protection circuits. Finally, the data units from different links are encoded using network coding, which not only provides 1 + N protection to virtual links but also reduces the recovery delay. The evaluation results show that our method not only has the best acceptance ratio and long-term average revenue to cost ratio, but it also greatly enhances the achievable backup sharing and shortens the average network recovery delay.
The applications in the critical infrastructure systems pose simultaneous resilience and performance requirements to the underlying computer network. To meet such requirements, the networks that use the store-and-forw...
详细信息
ISBN:
(纸本)9781538660430
The applications in the critical infrastructure systems pose simultaneous resilience and performance requirements to the underlying computer network. To meet such requirements, the networks that use the store-and-forward paradigm poses stringent conditions on the redundancy in the network topology and results in problems that becoming computationally challenging to solve at scale. However, with the advent of programmable data-planes, it is now possible to use linear network coding (NC) at the intermediate network nodes to meet resilience requirements of the applications. To that end, we propose an architecture that realizes linear NC in programmable networks by decomposing the linear NC functions into the atomic coding primitives. We designed and implemented the primitives using the features offered by the P4 ecosystem. Using an empirical evaluation, we show that the theoretical gains promised by linear network coding can be realized with a per-packet processing cost.
We propose a novel network coding (NC) enabled named data networking (NDN) architecture for scalable video delivery. Our architecture utilizes NC in order to address the problem that arises in the original NDN archite...
详细信息
We propose a novel network coding (NC) enabled named data networking (NDN) architecture for scalable video delivery. Our architecture utilizes NC in order to address the problem that arises in the original NDN architecture, where optimal use of the bandwidth and caching resources necessitates the coordination of the Interest forwarding decisions. To optimize the performance of the proposed NC-based NDN architecture and render it appropriate for transmission of scalable video, we devise a novel rate allocation algorithm that decides on the optimal rates of Interests sent by clients and intermediate nodes. The flow of Data packets achieved by this algorithm maximizes the average quality of the video delivered to the client population. To support the handling of Interest and Data packets when intermediate nodes perform NC, we introduce the use of Bloom filters, which store efficiently additional information about the Interest and Data packets, and modify accordingly the standard NDN architecture. We also devise an optimized Interest forwarding strategy that implements the target rate allocation. The proposed architecture is evaluated for transmission of scalable video over PlanetLab topologies. The evaluation shows that the proposed scheme exploits optimally the available network resources.
network coding opportunistic routing (NCOR) offers a promising solution for efficient data transmission in delay tolerant networks. Due to the multi-copy strategy and network coding nature, NCOR inevitably brings abou...
详细信息
network coding opportunistic routing (NCOR) offers a promising solution for efficient data transmission in delay tolerant networks. Due to the multi-copy strategy and network coding nature, NCOR inevitably brings about a large number of heterogeneous copies, leading to over-consumption of limited network resources. To alleviate this situation, it is imperative to study how to reduce redundant copies in the network. In this paper, we propose a pre-decoding recovery mechanism (PDRM) that removes residual copies after the destination node obtains the original packet information. The PDRM consists of three operations: generating pre-decoding elements, maintaining immune-lists, and deleting redundant copies. In particular, the destination node generates a pre-decoding element, and then, sends it to other nodes in the network via an immune-list to help remove the residual copies. Here, the pre-decoding element is an acknowledgement indicating that the destination node has the necessary information to decode the corresponding original packet. As the core of the PDRM, the first operation enables the destination node to generate a pre-decoding element for each innovative packet without waiting for decoding the generation. Simulation results demonstrate that the PDRM achieves excellent results in improving network performance, and outperforms the existing recovery mechanism.
In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a radio system where a Secondary user may act as relay for messages sent by the Primary user, hence of...
详细信息
ISBN:
(纸本)9781538672723
In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a radio system where a Secondary user may act as relay for messages sent by the Primary user, hence offering performance improvement of Primary user transmissions, while at the same time obtaining more transmission opportunities for its own transmissions. Specifically, we examine the possibility of improving the overall system performance by employing network coding techniques. The objective is to achieve this while affecting Primary user transmissions only positively, namely: 1) avoid network coding operations at the Primary transmitter in order avoid increase of its complexity and storage requirements, 2) keep the order of packets received by the Primary receiver the same as in the non cooperative case and 3) induce packet service times that are stochastically smaller than packet service times induced in the non-cooperative case. A network coding algorithm that operates without knowledge of channel and packet arrival rate statistics, is investigated in terms of achieved throughput region. It is shown that the proposed algorithm enlarges Secondary user throughput as compared to the case where the Secondary transmitter acts as a simple relay, while leaving the Primary user stability region unaffected.
It is becoming more and more popular to share video among multiple users. However, sharing video in traditional cellular networks will incur high expense. Device-to-Device (D2D) communication is one of the key technol...
详细信息
It is becoming more and more popular to share video among multiple users. However, sharing video in traditional cellular networks will incur high expense. Device-to-Device (D2D) communication is one of the key technologies in the 5th generation(5G) networks, and it enables the devices to transmit data directly without the relay of base stations. This paper proposes a network-coding-based video distribution scheme for D2D communication environment. In the scheme, the network coding technology is applied in the H.264 video transmission, which can also provide additional protection to key information of the video. This scheme enables the receivers to decode the original video with a high probability, especially in the networks with interferences. Simulation results show that the quality of video is improved after using network coding.
Cloud storage systems are designed to provide reliable storage services and reduce the cost by utilizing the storage space efficiently. However, cloud storage systems suffer from loss of data whenever an unexpected fa...
详细信息
ISBN:
(纸本)9781538684924
Cloud storage systems are designed to provide reliable storage services and reduce the cost by utilizing the storage space efficiently. However, cloud storage systems suffer from loss of data whenever an unexpected failure occurs. This work focuses on providing network coding benefits in robust cloud storage system. We design a system model for multiple-cloud storage and multiple node failures. Further, the storage system pros ides authentication for users and minimizes the update operation. We have carried out our work considering trade-off between repair bandwidth and cloud storage capacity and comparing with RAID-6. The proposed approach provides protection (fault tolerance) against unexpected failure using erasure and regenerating codes.
We develop an analytical framework for queueing and delay analysis in the case of a number of distinct flows arriving at a network node, where asynchronous partial network coding is applied for an efficient packet tra...
详细信息
We develop an analytical framework for queueing and delay analysis in the case of a number of distinct flows arriving at a network node, where asynchronous partial network coding is applied for an efficient packet transmission. In order to perfectly model and analyze the practical communication networks, the arriving flows are assumed to be general Markovian arrival processes. As a key example, we apply the proposed model to the problem of coded caching in single bottleneck caching networks. In addition, we verify the accuracy of the proposed model through simulations and real trace-driven experiments.
The advantages of both transmission-power assignment and network-coding-based multicast in wireless sensor networks, in reducing the complexity (medium access control and routing), saving energy, and prolonging networ...
详细信息
The advantages of both transmission-power assignment and network-coding-based multicast in wireless sensor networks, in reducing the complexity (medium access control and routing), saving energy, and prolonging network lifetime, are well known. To improve the network efficiency, this paper proposes a Memetic ant colony algorithm that combines the transmission power assignment with the network-coding-based-multicast routing. The proposed algorithm stores the solution in a memory and maintains diversity among the population list to accelerate finding the solutions in the dynamic networks. In the proposed algorithm, energy consumption for receiving, the irregular shape of transmission domain, the discrete transmitting power levels of sensors, and dynamical changes in the network features are of concern. The results of the assessments run through simulations indicate that the proposed algorithm could obtain the optimal or near-optimal satisfactory transmission power levels and multicast routes. In addition, the runtime of proposed algorithm is reduced greatly compared to existing methods.
We consider a cognitive radio network where a primary and a secondary transmitter, respectively, communicate a message to their primary and secondary receivers over a packet-based wireless link, using a joint automati...
详细信息
We consider a cognitive radio network where a primary and a secondary transmitter, respectively, communicate a message to their primary and secondary receivers over a packet-based wireless link, using a joint automatic-repeat-request (ARQ) error control scheme. The secondary transmitter assists in the retransmission of the primary message, which improves the primary performance, and as a reward it is granted limited access to the transmission resources. Conventional ARQ, as well as two network-coding schemes are investigated for applications in the retransmission phase;namely the static network-coding scheme and the adaptive network-coding scheme. For each scheme we analyze the transmission process by investigating the distribution of the number of transmission attempts. We divide every frame into three transmission sessions and in each session we discover that the number of transmission attempts follows a certain negative binomial distribution, in which case can be further approximated by a normal distribution. Considering both the cases of an adaptive frame size and a truncated frame size, we derive analytical results on system performances and discuss the comparison of three schemes. Besides, the approximation method greatly reduces the complexity of transmission analysis, especially in the truncated frame-size case. Numerical results show that our analysis are valid and closely match the simulations.
暂无评论