Summary form only given. Since network backbones carry huge amounts of traffic, the failure of a single link can result in the loss of service, and consequently revenue. This is why backbone networks are required to b...
详细信息
Summary form only given. Since network backbones carry huge amounts of traffic, the failure of a single link can result in the loss of service, and consequently revenue. This is why backbone networks are required to be self-healing, and to survive failures. The survivability functionality has traditionally been provided using either restoration or protection techniques, where protection is the faster, and hence the preferred mode of survivable operation. However, proactive protection requires reserving backup resources, which are typically close to two thirds of the resources. This presentation will discuss recent advances in providing the self-healing functionality in networks such that self-healing is both fast, and resource efficient, which is achieved by using the technique of network coding. In this case, one set of protection circuits provides protection for multiple connections, and multiple signals can be transmitted on the same protection circuit simultaneously. This is done by linearly combining those signals using the technique of network coding. The strategy enables the transparent and instantaneous recovery from link failures, similar to proactive protection, but at a reduced cost due to protection circuit sharing. We show how this technique can be implemented to protect against single link failures, and then it can be extended to protect against multiple failures. The advantage of this technique is twofold: failures do not have to be detected, and signals do not have to be rerouted, hence leading to less involvement of the control and management planes, which expedites the error recovery process; also, protection circuits are shared by multiple connections, since multiple signals are linearly combined and transmitted on the same circuit, hence leading to the implementation of protection at a reduced cost. This technique can be implemented in the data forwarding plane, e.g, at the IP or MPLS layers, and can be regarded as a method for implementing Fast
This paper considers the problem of delivering K different contents to D destinations from N sources in wireless networks. Traffic in opposite directions over two wireless hops can utilize the advantage of network cod...
详细信息
This paper considers the problem of delivering K different contents to D destinations from N sources in wireless networks. Traffic in opposite directions over two wireless hops can utilize the advantage of network coding (NC) in order to decrease the number of transmissions used. We call such coded hops as “NC-links”. On the other hand, the multicast (MC) links can transmit data to several nodes at the same time, also yielding the improvement of the transmissions efficiency. However, there exists a certain level of ambiguity regarding how to coordinate NC and MC to improve the file sharing performance in wireless P2P content distribution systems. Considering both NC and MC gains, we investigate the content traffic splitting using the theory of a potential game and show that there is competition among destinations in order to minimize the total system transmission cost. Subsequently, we identify the equilibrium solution to this game and develop a two-level distributed control algorithm that allows each destination to select the source and split the traffic so as to adjust the content traffic based on the potential function in a distributed way. Through theoretical analysis and simulation results, we show that the proposed scheme is stable and effective.
This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n packets from source to each receiver, a...
详细信息
ISBN:
(纸本)9781424478903
This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n packets from source to each receiver, and the adversary is allowed to eavesdrop on μ arbitrarily chosen links and also to inject up to t erroneous packets into the network. The goal of the system is to achieve zero-error communication that is information-theoretically secure from the adversary. Moreover, this goal must be attained in a universal fashion, i.e., regardless of the network topology or the underlying network code. An upper bound on the achievable rate under these requirements is shown to be n - μ - 2t packets per transmission. A scheme is proposed that can achieve this maximum rate, for any n and any field size q, provided the packet length m is at least n symbols. The scheme is based on rank-metric codes and admits low-complexity encoding and decoding. In addition, the scheme is shown to be optimal in the sense that the required packet length is the smallest possible among all universal schemes that achieve the maximum rate.
Wireless network coding suffers the error propagation issues that may severely degrade the diversity performance. In this work, we develop two power scaling schemes at the relay side and two detection schemes at the r...
详细信息
ISBN:
(纸本)9781467309202
Wireless network coding suffers the error propagation issues that may severely degrade the diversity performance. In this work, we develop two power scaling schemes at the relay side and two detection schemes at the receiver side, respectively, to mitigate error propagation in network-coded uplink channel and thus achieve full diversity. For the soft power scaling based link adaptive relaying, we develop a virtual channel model and demonstrate that the relay power should be such to balance the signal-to-noise ratios of the source-relay channel and relay-destination channel. As for the hard power scaling based ON-OFF relaying, we first design a decision rule based on total pairwise error probability, and then simplifies it to the threshold-based relaying strategy. At the receiver side, we show that the weighted minimum distance detection with the weight being determined by the relative link quality of source-relay channel and relay-destination channel can achieve full diversity once the global channel state information is available, otherwise the maximum likelihood detection that explicitly takes into account relay decoding error should be employed to achieve full diversity.
There has been extensive work that relies on network coding to increase the resiliency to errors and consequently improve the performance of wireless networks. However, due to the coding operations, these network codi...
详细信息
There has been extensive work that relies on network coding to increase the resiliency to errors and consequently improve the performance of wireless networks. However, due to the coding operations, these network coding techniques often introduce an additional delay that has a negative impact on TCP traffic. A recent approach, namely online coding, proposes a feedback mechanism for TCP that acknowledges the rate of receiving innovative linear combinations instead of the decoding rate. However, this approach requires modifying the TCP protocol, which raises a concern with the feasibility of implementing such a mechanism in practice. In this paper we propose a network coding scheme, based on the use of generations in conjunction with triangular coefficient matrices, which interacts well with TCP, even if the sender has knowledge only on the decoding rate. We compare our scheme with existing state-of-the-art, square matrix coding and online coding (with feedback on innovative rate and with feedback on decoding rate) and show through simulations that our scheme outperforms square matrix coding and online coding with feedback on decoding rate. Moreover, our scheme achieves a higher throughput than online coding with feedback on innovative rate when the communication occurs over multiple hops, in extremely volatile environments.
Previous research on physical layer network coding (PNC) focuses on the improvements in bandwidth usage efficiency. In this paper, we propose a PNC-based node localization mechanism. When two signal sequences collide ...
详细信息
Previous research on physical layer network coding (PNC) focuses on the improvements in bandwidth usage efficiency. In this paper, we propose a PNC-based node localization mechanism. When two signal sequences collide at the receiver, the starting point of collision is determined by the distances between the receiver and senders. When the signal interference results from two receivers are combined together, we can determine a hyperbola with two senders as the respective focal points. In this way, by using multiple pairs of anchor nodes as senders, we can determine multiple hyperbolas and the node position will be at the intersection point of these hyperbolas. The proposed approach does not require the wireless nodes to be equipped with any special hardware such as synchronized clocks. We propose several schemes at the physical and network layers to transform the idea into a practical approach. We also investigate the overhead, localization accuracy, and safety of the approach.
This paper proposes the ideas of interference alignment with physical-layer network coding (IAPNC). While conventional interference alignment (IA) aligns interfering signals and then treats them as noise, IAPNC treats...
详细信息
ISBN:
(纸本)9781479966653
This paper proposes the ideas of interference alignment with physical-layer network coding (IAPNC). While conventional interference alignment (IA) aligns interfering signals and then treats them as noise, IAPNC treats the aligned signals as combined signals and utilizes them to convey data streams to receivers. We show the ideas of IAPNC in multi-hop multiple-input multiple-output (MIMO) channels consisting of 3 transmitter-receiver pairs and 2 half-duplex decode-and-forward (DF) relays in each intermediate layer, i.e., 3-2-...-2-3 MIMO channels. We consider three users want to convey independent data streams to distinct destinations with the aid of relays. Simulation results show that IAPNC scheme in the 3-2-3 MIMO channel achieves the same degrees of freedom (DoF) as conventional IA scheme in the 3-3-3 MIMO channel which has one more relay. The results also show that the end-to-end sum-rate of IAPNC scheme outperforms that of zero-forcing (ZF) filtering scheme in medium-to-high signal-to-noise ratio (SNR) regime for the 3-2-3 MIMO channel. The performance improvement of IAPNC scheme mainly comes from efficient utilization of signals in interfering signal subspaces.
In-band southbound connectivity provides a cost-efficient way to share control traffic between the software-defined network controller and underlying forwarding devices; without having to worry about establishing and ...
详细信息
ISBN:
(纸本)9781538646342
In-band southbound connectivity provides a cost-efficient way to share control traffic between the software-defined network controller and underlying forwarding devices; without having to worry about establishing and maintaining a separate transport network. However, the adoption of such a design also exposes the control plane traffic to non-negligible delay and losses; incurred from burdening a single transport network with an increased number of transmissions. These drawbacks can severely degrade network performance. For instance, when the requests in the form of control packets from switch-to-controller (or vice-versa) are dropped, the information may not get updated promptly and thus, the system would not behave as desired or in the worst case scenario can collapse altogether. To mitigate these constraints, in this paper, we propose the use of network coding which encourages information mixing as packets traverse the network. We show that network coding when applied to control plane traffic in an in-band design can help overcome losses due to congestion and link impairments. Evaluation results suggest that network coding aware in-band design can mitigate number of transmissions as well as total delay incurred by control packet losses.
The multiple-unicast conjecture in network coding states that for multiple unicast sessions in an undirected network, network coding has no advantage over routing in improving the throughput or saving bandwidth. In th...
详细信息
ISBN:
(纸本)9781509018079
The multiple-unicast conjecture in network coding states that for multiple unicast sessions in an undirected network, network coding has no advantage over routing in improving the throughput or saving bandwidth. In this work, we propose a reduction method to study the multiple-unicast conjecture, and prove the conjecture for a new class of networks that are characterized by relations between cut-sets and source-receiver paths. This class subsumes the two known types of networks with non-zero max-flow min-cut gaps. Further combing this result with a computer-aided search, we derive as a corollary that network coding is unnecessary in networks with up to 6 nodes. We also prove the multiple-unicast conjecture for almost all unit-link-length networks with up to 3 sessions and 7 nodes.
This work investigates the energy consumption rate of an energy-constrained wireless sensor network and demonstrates that sensor energy dissipation can be reduced by employing network coding in terms of routing the sa...
详细信息
This work investigates the energy consumption rate of an energy-constrained wireless sensor network and demonstrates that sensor energy dissipation can be reduced by employing network coding in terms of routing the same amount of sensing data to base stations through theoretical and simulation perspectives. In addition,this work examines the interplays between network parameters such as node density, traffic rate,and coding strategy and the performance gain of employing network coding for energy conservation in a grid wireless sensor *** provides insights into the design of wireless sensor networks and the deployment of network coding for energy conservation in practice.
暂无评论