We consider a peer to peer (P2P) content distribution simulation system based on network coding. In such a system, the data transmitted among peers is an encoded version of the original content. With network coding, t...
详细信息
We consider a peer to peer (P2P) content distribution simulation system based on network coding. In such a system, the data transmitted among peers is an encoded version of the original content. With network coding, the system can achieve the maximum theoretical network flow bound. However, in practical applications, the operation of network coding causes additional computational consumption and storage overhead, and whether the P2P system can benefit from network coding remains a controversial issue. In this paper, we introduce some new network coding parameters to gain more insights to the properties of network coding and have an extensive analysis from simulation. Based on these parameters, we construct an implementation of the network coding-based content distribution scheme in NS-2 platform. According to our simulation results, in some cases, network coding can not obtain a better performance compared to the traditional P2P scheme. However, when the parameters of network coding are chosen properly, the network coding-based system will gain a better performance compared to the traditional P2P system by at most 20% to 30%, which means that the use of network coding can give considerable benefit to the P2P content distribution system.
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.
Wireless network coding has the potential to enhance the capacity of wireless mesh networks (WMNs). However, most of the work considering the practical deployment of network coding in WMNs considers only IEEE 802.11 b...
详细信息
Wireless network coding has the potential to enhance the capacity of wireless mesh networks (WMNs). However, most of the work considering the practical deployment of network coding in WMNs considers only IEEE 802.11 based medium access control (MAC) layers. The recent emergence of sophisticated MAC standards supporting WMNs (e.g. IEEE 802.16) make it necessary to view the deployment issues for network coding from a new perspective. This paper outlines the challenges for deploying network coding in sophisticated, reservation based MAC layers such as the IEEE 802.16 MeSH mode. We present simple yet efficient metrics to quantify and measure the gain which can be obtained via deployment of network coding in the MeSH mode. We also present extensions to the standard's reservation mechanisms to support network coding. Additionally, initial simulation results are provided demonstrating the proof-of-concept for the presented solutions thereby providing a framework for further investigation and deployment of wireless network coding in sophisticated MAC layers.
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 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.
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 presents a receiver-driven video delivery algorithm that exploits a novel Randomized network coding (RNC) scheme for unequal error protection (UEP). The main idea of our approach is to account for the unequ...
详细信息
This paper presents a receiver-driven video delivery algorithm that exploits a novel Randomized network coding (RNC) scheme for unequal error protection (UEP). The main idea of our approach is to account for the unequal importance of media packets in the network coding algorithm for efficient stream delivery in lossy overlay networks. Based on the requests from their neighbours, the network nodes properly combine packets and forward them to their children nodes. The network coding operations at every node are formulated as a log-concave optimization problem, which is solved with a greedy algorithm in only a few iterations. Our experimental results demonstrate that the proposed scheme permits to respect the priorities between the different packet classes. It further outperforms baseline network coding techniques for video streaming in overlay networks.
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.
Full characterization of Intersession network coding (INC), i.e., coding across multiple unicast sessions, is notoriously challenging. Nonetheless, the problem can be made tractable when considering practical constrai...
详细信息
ISBN:
(纸本)9781424458257
Full characterization of Intersession network coding (INC), i.e., coding across multiple unicast sessions, is notoriously challenging. Nonetheless, the problem can be made tractable when considering practical constraints that restrict the types of INC schemes of interest. This paper characterizes the INC capacity of 2-session wireless 2-hop relay networks with a packet erasure channel model and a round-based feedback schedule motivated by the usage of ¿reception reports¿ in practical protocols such as COPE. The capacity regions are formulated as linear programming problems, which admit simple concatenation with other competing techniques such as opportunistic routing (OpR), and cross-layer (CL) optimization. Extensive numerical evaluation is conducted on 1000 random topologies, which compares and quantifies the throughput benefits of INC, OpR, and CL, and their arbitrary combinations. The results show that by combining all three techniques of INC, OpR, and CL, the throughput of a wireless 2-hop relay network can be improved by 100-500% over the benchmark single-path routing solution depending on the number of sessions to be coded together.
Tactical and emergency-response networks require efficient communication without a managed infrastructure. Recent work demonstrates that applying information-centric paradigms to the tactical edge can provide performa...
详细信息
ISBN:
(纸本)9781479935130
Tactical and emergency-response networks require efficient communication without a managed infrastructure. Recent work demonstrates that applying information-centric paradigms to the tactical edge can provide performance benefits over traditional address centric approaches. We propose SOCRATIC (SOCial RATe control for Information Centric networks), an approach that unifies replication and network coding to disseminate content by taking advantage of social content and context heuristics. SOCRATIC replicates network encoded blocks according to a popularity index metric that is shared during neighbor discovery. The number of encoded blocks that is relayed to a node depends on its own interest in a data object and its social popularity, i.e., how often and for how long the node meets other nodes. These blocks are subsequently replicated towards the subscriber if a stable path exists. We evaluate an implementation of SOCRATIC through network emulation of a tactical scenario and demonstrate that it can achieve better performance than traditional socially agnostic approaches.
暂无评论