Proving or disproving an information inequality is a crucial step in establishing the converse results in the coding theorems of communication networks. However, next generation networks are very large-scale, typicall...
详细信息
ISBN:
(纸本)9781479958320
Proving or disproving an information inequality is a crucial step in establishing the converse results in the coding theorems of communication networks. However, next generation networks are very large-scale, typically involving multiple users and many transceivers and relays. This means that an information inequality involving many random variables can be difficult to be proved or disproved manually. In HI, Yeung developed a framework that uses linear programming for verifying linear information inequalities, and it was recently shown in 121 that this framework can be used to explicitly construct an analytic proof of an information inequality or an analytic counterexample to disprove it if the inequality is not true in general. In this paper, we consider the construction of the smallest counterexample, and also give sufficient conditions for that the inequality can be manipulated to become true. We also describe the software development of automating this analytical framework enabled by cloud computing to analytically verify information inequalities in large-scale problem setting.
networks-on-Chip (NoC) has been applied widely in Chip Multi-processors (CMPs). With the development of multi processors systems, multicast communications have been commonly used in these systems. Current multicast al...
networks-on-Chip (NoC) has been applied widely in Chip Multi-processors (CMPs). With the development of multi processors systems, multicast communications have been commonly used in these systems. Current multicast algorithms may cause deadlock and suffer from long latency and low throughput. In this paper, we proposed a new multicast algorithm for mesh-based on-chip networks. This new multicast routing method reduces the latency and increases the saturation point. This routing scheme can dynamically make routing decisions based on the network conditions and the distribution of destination nodes. The simulation result, implemented under OPNET, shows that the saturation point of the proposed algorithm is higher than the efficient partition-based routing scheme LADPM [1]. The latency of our routing algorithm is about 21% and 42% smaller than LADPM when the number of the destination nodes is 8 and 4 respectively under high injection rates.
networks-on-Chip（NoC） has been applied widely in Chip Multi-processors（CMPs）.With the development of multi processors systems,multicast communications have been commonly used in these *** multicast algorithms may ...
networks-on-Chip（NoC） has been applied widely in Chip Multi-processors（CMPs）.With the development of multi processors systems,multicast communications have been commonly used in these *** multicast algorithms may cause deadlock and suffer from long latency and low *** this paper,we proposed a new multicast algorithm for mesh-based on-chip *** new multicast routing method reduces the latency and increases the saturation *** routing scheme can dynamically make routing decisions based on the network conditions and the distribution of destination *** simulation result,implemented under OPNET,shows that the saturation point of the proposed algorithm is higher than the efficient partition-based routing scheme LADPM[1].The latency of our routing algorithm is about 21%and 42%smaller than LADPM when the number of the destination nodes is 8 and 4 respectively under high injection rates.
BATS code is a low-complexity random linear networkcoding scheme that can achieve asymptotic bandwidth optimality for many types of networks with packet loss. In this paper, we propose a BATS code based network proto...
详细信息
ISBN:
(纸本)9781479980109
BATS code is a low-complexity random linear networkcoding scheme that can achieve asymptotic bandwidth optimality for many types of networks with packet loss. In this paper, we propose a BATS code based network protocol and evaluate the performance by real-device experiments. Our results demonstrate significant ready-to-implement gain of networkcoding over forwarding in multi-hop network transmission with packet loss. We also propose an improved protocol to handle the practical issues observed in the experiments.
We present a new family of maximal-distance separable (MDS) array codes which can tolerate five disk failures. The encoding is based on bit-wise exclusive OR (XOR) and bit-wise cyclic shifts, and hence is amenable to ...
详细信息
ISBN:
(纸本)9781479935130
We present a new family of maximal-distance separable (MDS) array codes which can tolerate five disk failures. The encoding is based on bit-wise exclusive OR (XOR) and bit-wise cyclic shifts, and hence is amenable to practical implementation. Efficient repair method for correcting up to two disk failures is also given. The proposed coding scheme provides a larger spectrum of parameters, with comparable encoding and repairing complexities in compare with existing MDS array codes, such as the row-diagonal parity (RDP) code and the EVENODD code.
Broadcast is one of the most fundamental services provided by the communication protocol for wireless sensor networks. In this paper, we design an energy-aware reliable deterministic broadcast scheduling protocol by u...
详细信息
ISBN:
(纸本)9781479974719
Broadcast is one of the most fundamental services provided by the communication protocol for wireless sensor networks. In this paper, we design an energy-aware reliable deterministic broadcast scheduling protocol by using user-irrepressible (UI) protocol sequences. Each user transmits a packet in a time slot if and only if the sequence value is equal to one. A collision occurs if two or more users transmit at the same slot. UI sequences ensure that each user can receive at least one packet error-free from each other within the sequence period. Moreover, it does not require any time synchronization among the users. In the protocol, a new construction of UI sequences is presented and a sleeping mechanism is proposed. Simulation results show that the new protocol has a significant energy saving compared with traditional UI-sequences-based schemes. In addition, the delay can in fact be reduced by employing new UI sequences instead.
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually. In [1...
详细信息
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually. In [1], Yeung developed a framework that uses linear programming for verifying linear information inequalities. Under this framework, this paper considers a few other problems that can be solved by using Lagrange duality and convex approximation. We will demonstrate how linear programming can be used to find an analytic proof of an information inequality. The way to find a shortest proof is explored. When a given information inequality cannot be proved, the sufficient conditions for a counterexample to disprove the information inequality are found by linear programming.
Regenerating code is a class of storage codes that achieve the optimal trade-off between storage capacity and repair bandwidth, which are two important performance metrics in data storage systems. However, existing co...
详细信息
ISBN:
(纸本)9781479904440
Regenerating code is a class of storage codes that achieve the optimal trade-off between storage capacity and repair bandwidth, which are two important performance metrics in data storage systems. However, existing constructions of regenerating codes rely on expensive computational operations such as finite field multiplication. The high coding and repair complexity limit their applications in large-scale practical storage systems. In this paper, we show that it is possible to achieve the full potential of regenerating codes with low computational complexity. In particular, we propose a new class of regenerating codes, called BASIC codes, that can achieve two specific points (i.e., minimum-bandwidth and minimum-storage regenerating points) on the storage and repair bandwidth trade-off curve, using only binary addition and shift operations in the coding and repair processes. Although in this paper we focus on constructing and analyzing BASIC codes for two specific exact-repair settings, our framework can be generalized to develop BASIC codes for more general exact- and functional-repair regenerating codes.
暂无评论