This paper introduces a network coding-based protection scheme against single-and multiple-link failures. The proposed strategy ensures that in a connection, each node receives two copies of the same data unit: one co...
详细信息
This paper introduces a network coding-based protection scheme against single-and multiple-link failures. The proposed strategy ensures that in a connection, each node receives two copies of the same data unit: one copy on the working circuit and a second copy that can be extracted from linear combinations of data units transmitted on a shared protection path. This guarantees instantaneous recovery of data units upon the failure of a working circuit. The strategy can be implemented at an overlay layer, which makes its deployment simple and scalable. While the proposed strategy is similar in spirit to the work of Kamal in 2007 2010, there are significant differences. In particular, it provides protection against multiple-link failures. The new scheme is simpler, less expensive, and does not require the synchronization required by the original scheme. The sharing of the protection circuit by a number of connections is the key to the reduction of the cost of protection. This paper also conducts a comparison of the cost of the proposed scheme to the 1+1 and shared backup path protection (SBPP) strategies and establishes the benefits of our strategy.
This paper addresses the problem of monitoring networks for congestion by making active end-to-end measurements with probe sequences over overlay networks. Traditionally, link loss rates are inferred by sending probe ...
详细信息
ISBN:
(纸本)9781467300926
This paper addresses the problem of monitoring networks for congestion by making active end-to-end measurements with probe sequences over overlay networks. Traditionally, link loss rates are inferred by sending probe packets from a set of sources at the network edge to a set of receivers over a mesh of multicast trees. We first approached this problem in [3] where we showed that enabling internal nodes of the overlay with network coding capability delivers increased bandwidth efficiency and estimation accuracy when compared to multicast-based tomography. Taking our initial work in [3](1) as a starting point, in this paper we develop sophisticated link loss estimators and present a wide range of experimental results. These estimators are distributed, low-complexity link-loss inference heuristics that can be applied to arbitrary network topologies.
The main difference between centralized and decentralized control is the communication. Controllers in a decentralized system can communicate with each other to achieve their common goal. In this paper, we argue that ...
详细信息
ISBN:
(纸本)9781612848013
The main difference between centralized and decentralized control is the communication. Controllers in a decentralized system can communicate with each other to achieve their common goal. In this paper, we argue that even linear time-invariant controllers in a decentralized linear system "communicate" via linear network coding to stabilize the plant. To justify this argument, we propose an algorithm to "externalize" the implicit communication between controllers that we believe must be occurring to stabilize the plant. Based on this, we show that the stabilizability condition for decentralized linear systems comes from an underlying communication limit, which can be described by an algebraic mincut-maxflow theorem.
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in mult...
详细信息
ISBN:
(纸本)9781424413973
We present a graph theoretic upper bound on speedup needed to achieve 100% throughput in a multicast switch using network coding. By bounding speedup, we show the equivalence between network coding and speedup in multicast switches - i.e. network coding, which is usually implemented using software, can in many cases substitute speedup, which is often achieved by adding extra switch fabrics. This bound is based on an approach to network coding problems called the "enhanced conflict graph". We show that the "imperfection ratio" of the enhanced conflict graph gives an upper bound on speedup. In particular, we apply this result to K x N switches with traffic patterns consisting of unicasts and broadcasts only to obtain an upper bound of min (2K-1/K, 2N/N+1).
Stereoscopic 3D video is a key enabler of advanced immersive multimedia systems. network coding on the other hand is a promising technology that would be implemented on the future internet that has the capability to i...
详细信息
ISBN:
(纸本)9781467357531
Stereoscopic 3D video is a key enabler of advanced immersive multimedia systems. network coding on the other hand is a promising technology that would be implemented on the future internet that has the capability to increase the throughput of networks. This paper considers a methodology for 3D video transmission over network coding enabled networks. Specifically, by way of extensive simulations, we compare the error resilient performance of network coding with redundant packets and redundant coding of video streams. Simulation results indicate that in terms of error resilience, packet redundancies at network layer in network coding enabled networks is superior to application level redundancies such as redundant coding of video streams. Thus, this paper illustrates how bandwidth hungry applications such as 3D video distribution could benefit from network coding.
Wireless Sensor networks (WSNs) are immensely deployed for monitoring information like humidity, temperature and soil fertility. As the sensor nodes sense data and floods them in the network, the network traffic incre...
详细信息
ISBN:
(纸本)9781424448364
Wireless Sensor networks (WSNs) are immensely deployed for monitoring information like humidity, temperature and soil fertility. As the sensor nodes sense data and floods them in the network, the network traffic increases and may result in congestion which leads to broadcast storm problem. This paper addresses the utility of network coding to optimize data aggregation and to decrease the number of transmitted messages in a WSN. A coding-aware deployment strategy is presented which create opportunity for network coding at aggregate sensor nodes. Our deployment strategy leads to a topology which supports many-to-many network flows (multiple sources and multiple sink network flow). It also gives protection against multiple failures in the network. Furthermore, we propose a heuristic that restricts unnecessary transmissions.
Advancements in hardware, software, and computing technologies make the design and application of series and diverse kinds of networks deployment in several environments possible. An instance of such networks greeted ...
详细信息
ISBN:
(纸本)9781479982677
Advancements in hardware, software, and computing technologies make the design and application of series and diverse kinds of networks deployment in several environments possible. An instance of such networks greeted with the enormous interest in research and industries is the vehicular ad-hoc networks (VANETs). Currently, information dissemination in the practical communication networks is achieved by routing. However, network coding can be thought of as the hopeful generalisation of routing that has further potential to network changing situations. Despite the existence of numerous studies on the applicability of network coding to broadcasting communications for mobile ad-hoc networks, there are few broadcasting protocols designed for VANETs that applied network coding. This paper reviews some of the applications of network coding for reliable safety message communication in VANETs, classifying them based on the transmission orientation and divulging the gain realized when the method is used. A summary table presenting the comparative study of the protocols is provided.
We consider a broadcast erasure channel where a single transmitter broadcasts to M receivers, where the channel between the transmitter and each receiver is an independent erasure channel with success probabilities q ...
详细信息
ISBN:
(纸本)9781467346481
We consider a broadcast erasure channel where a single transmitter broadcasts to M receivers, where the channel between the transmitter and each receiver is an independent erasure channel with success probabilities q = (q(1), ... , q(M)). Prior work on this model by Cogill, Shrader and Ephremides (2011) established bounds on the expected delays incurred in transmitting a collection of C packets to each of the M receivers using both scheduling and random linear network coding (RLNC). In this work we extend these results in several ways. First, we provide exact expressions and tight upper and lower bounds for the expected delay under uncoded transmissions (UT) for arbitrary q. Second, we provide a recurrence relationship for the expected delay under RLNC that allows one to compute the exact delay for any finite C. Third, we prove convergence in probability and in rth mean of the normalized expected delay under RLNC as C -> infinity to 1/min(j) q(j), with the implication that the normalized delay is solely a function of the quality of the worst erasure channel. Finally, we note our results are of general interest in probability theory as they address the moments of the maximum of (sums of) independent geometric random variables (UT, RLNC) and the convergence of moments of functions of sums of independent geometric random variables (RLNC).
Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region requires determination of the set of al...
详细信息
ISBN:
(纸本)9781424443123
Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region requires determination of the set of all entropic vectors Gamma*, which is known to be an extremely hard problem. On the other hand, calculating the explicitly known linear programming bound is very hard in practice due to an exponential growth in complexity as a function of network size. We give a new, easily computable outer bound, based on characterization of all functional dependencies in networks. We also show that the proposed bound is tighter than some known bounds.
In this paper, we consider a point-to-point communication network of discrete memoryless channels. In the network, there are a source node and possibly more than one sink node. Information is generated at the source n...
详细信息
In this paper, we consider a point-to-point communication network of discrete memoryless channels. In the network, there are a source node and possibly more than one sink node. Information is generated at the source node and is multicast to each sink node. We allow a node to encode its received information before loading it onto an outgoing channel, where the channels are independent of each other. We also allow the nodes to pass along messages asynchronously. In this paper, we characterize the admissibility of single-source multi-sink communication networks. Our result can be regarded as a network generalization of Shannon's result that feedback does not increase the capacity of a discrete memoryless channels (DMCs), and it implies a separation theorem for network coding and channel coding in such a communication network.
暂无评论