检索结果-内蒙古大学图书馆

Pruning Network coding Traffic by Network coding-A New Class of Max-Flow Algorithms

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第4期56卷 1909-1929页

作者： Wang, Chih-Chun Purdue Univ Sch Elect & Comp Engn CWSA W Lafayette IN 47906 USA

This work explores new graph-theoretic and algebraic behaviors of network codes and provides a new class of coding-based, distributed max-flow algorithms. The proposed algorithm starts from broadcasting the coded packets, followed by continuously trimming the redundant traffic that does not constitute the maximum flow of the network information. The convergence speed of the proposed algorithms is no slower than that of the existing push-&-relabel max-flow algorithms. The algorithmic results in this work also possess several unique features that are especially suitable for practical network implementation with low control, communication, and complexity overhead.

关键词： Coded-feedback network coding network multicast max-flow algorithms multipath routing random linear coding

来源：评论

学校读者我要写书评

暂无评论

Guessing random Additive Noise Decoding of Network Coded Data Transmitted Over Burst Error Channels

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第9期73卷 12842-12857页

作者： Chatzigeorgiou, Ioannis Savostyanov, Dmitry Univ Lancaster Sch Comp & Commun Lancaster LA1 4WA England Univ Essex Sch Math Stat & Actuarial Sci Colchester CO4 3SQ England

We consider a transmitter that encodes data packets using network coding and broadcasts coded packets. A receiver employing network decoding recovers the data packets if a sufficient number of error-free coded packets are gathered. The receiver does not abandon its efforts to recover the data packets if network decoding is unsuccessful;instead, it employs syndrome decoding (SD) in an effort to repair erroneous received coded packets, and then reattempts network decoding. Most decoding techniques, including SD, assume that errors are independently and identically distributed within received coded packets. Motivated by the guessing random additive noise decoding (GRAND) framework, we propose transversal GRAND (T-GRAND): an algorithm that exploits statistical dependence in the occurrence of errors, complements network decoding and recovers all data packets with a higher probability than SD. T-GRAND examines error vectors in order of their likelihood of occurring and altering the transmitted packets. Calculation and sorting of the likelihood values of all error vectors is a simple but computationally expensive process. To reduce the complexity of T-GRAND, we take advantage of the properties of the likelihood function and develop an efficient method, which identifies the most likely error vectors without computing and ordering all likelihood values.

关键词： Burst noise guessing random additive noise decoding (GRAND) network coding network decoding random linear coding syndrome decoding Burst noise guessing random additive noise decoding (GRAND) network coding network decoding random linear coding syndrome decoding

来源：评论

学校读者我要写书评

暂无评论

Data Dissemination in Wireless Broadcast Channels: Network coding versus Cooperation

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2009年第4期8卷 1726-1732页

作者： Stojanovic, Ivana Wu, Zeyu Sharif, Masoud Starobinski, David Boston Univ ECE Dept Boston MA 02215 USA

Network coding and cooperative diversity have each extensively been explored in the literature as a means to substantially improve the performance of wireless networks. Yet, little work has been conducted to compare their performance under a common framework. Our goal in this paper is to fill in this gap. Specifically, we consider a single-hop wireless network consisting of a base station and N receivers. We perform an asymptotic analysis, as N -> infinity, of the expected delay associated with the broadcasting of a file consisting of K packets. We show that if K is fixed, cooperation outperforms network coding, in the sense that the expected delay is proportional to K (and thus within a constant factor of the optimal delay) in the former case while it grows logarithmically with N in the latter case. On the other hand, if K grows with N at a rate at least as fast as (log N)(r), for r > 1, then we show that the average delay of network coding is also proportional to K and lower than the average delay of cooperation if the packet error probability is smaller than 0.36. Our analytical findings are validated through extensive numerical simulations.

关键词： random linear coding scheduling delay analysis

来源：评论

学校读者我要写书评

暂无评论

Joint Scheduling and coding for Low In-Order Delivery Delay Over Lossy Paths With Delayed Feedback

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2019年第5期27卷 1987-2000页

作者： Garrido, Pablo Leith, Douglas J. Aguero, Ramon Informat & Commun Technol Ikerlan 20500 Arrasate Spain Trinity Coll Dublin Sch Comp Sci & Stat Dublin 2 Ireland Univ Cantabria Dept Commun Engn E-39005 Santander Spain

We consider the transmission of packets across a lossy end-to-end network path so as to achieve low in-order delivery delay. This can be formulated as a decision problem, namely deciding whether the next packet to send should be an information packet or a coded packet. Importantly, this decision is made based on delayed feedback from the receiver. While an exact solution to this decision problem is challenging, we exploit ideas from queueing theory to derive scheduling policies based on prediction of a receiver queue length that, while suboptimal, can be efficiently implemented and offer substantially better performance than state of the art approaches. We obtain a number of useful analytic bounds that help characterise design trade-offs and our analysis highlights that the use of prediction plays a key role in achieving good performance in the presence of significant feedback delay. Our approach readily generalises to networks of paths and we illustrate this by application to multipath trans port scheduler design.

关键词： Optimal scheduling forward error correction random linear coding low delay coding ARQ multi-path

来源：评论

学校读者我要写书评

暂无评论

Multiple-Relay Slotted ALOHA: Performance Analysis and Bounds

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2021年第3期69卷 1578-1594页

作者： Munari, Andrea Clazzer, Federico Liva, Gianluigi Heindlmaier, Michael German Aerosp Ctr DLR Inst Commun & Nav D-82234 Wessling Germany Tech Univ Munich Inst Commun Engn D-80333 Munich Germany Cadami GmbH D-81667 Munich Germany

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple receivers has recently emerged as a promising option. We study the potential of this approach considering a population of users that transmit data packets following a simple slotted ALOHA policy to a set of uncoordinated relays (phase-1). These, in turn, independently forward - part of - what decoded towards a collecting sink (phase-2). For an on-off fading channel model, we provide exact expressions for phase-1 throughput and packet loss rate for an arbitrary number of relays, characterising the benefits of multi-receiver schemes. Moreover, a lower bound on the minimum amount of phase-2 resources needed to deliver all information collected at the relays is provided. The bound is proven to be achievable via random linear coding when no constraints in terms of latency are set, with an overhead that approaches zero with the inverse of the packet length. We complement our study discussing a family of simple forwarding policies that require no packet-level coding, and optimising their performance based on the amount of available phase-2 resources. The behaviour of both random linear coding and simplified policies is also characterised when receivers are equipped with finite buffers, revealing non-trivial tradeoffs.

关键词： Receivers Relays Encoding Throughput Spatial diversity Fading channels Statistics Machine type communications grant-free access multiple receivers random linear coding

来源：评论

学校读者我要写书评

暂无评论

Secure Multi-Source Multicast

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2019年第1期67卷 708-723页

作者： Cohen, Alejandro Cohen, Asaf Medard, Muriel Gurewitz, Omer Ben Gurion Univ Negev Dept Commun Syst Engn IL-84105 Beer Sheva Israel MIT Lab Informat & Decis Syst Cambridge MA 02139 USA

The principal mission of multi-source multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In many of them, securing the messages disseminated is critical. A common secure model is to consider a network where there is an eavesdropper which is able to observe a subset of the network links, and seeks a code which keeps the eavesdropper ignorant regarding all the messages. While this is solved when all messages are located at a single source, secure MSM (SMSM) is an open problem, and the rates required are hard to characterize in general. In this paper, we consider individual security, which promises that the eavesdropper has zero mutual information with each message individually, or, more generally, with sub sets of messages. We completely characterize the rate region for SMSM under individual security, and show that such a security level is achievable at the full capacity of the network, that is, the cut-set bound is the matching converse, similar to non-secure MSM. Moreover, we show that the field size is similar to non-secure MSM and does not have to be larger due to the security constraint.

关键词： Information-theoretic security multi-source multicast communication network coding random linear coding secure network coding secure distributed storage

来源：评论

学校读者我要写书评

暂无评论

Reading Damaged Scripts: Partial Packet Recovery Based on Compressive Sensing for Efficient random linear Coded Transmission

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第8期64卷 3296-3310页

作者： Mohammadi, Mohammad Sadegh Zhang, Qi Dutkiewicz, Eryk Aarhus Univ Dept Engn DK-8200 Aarhus Denmark Macquarie Univ Sydney NSW 2109 Australia Univ Technol Sydney Sch Comp & Commun Ultimo NSW 2007 Australia

random linear coding (RLC) can improve the performance of multicast transmissions in terms of throughput and energy efficiency. However, RLC and linear codes in general cannot necessarily attain the optimal performance in arbitrary networks. In this regard, partial packet recovery can be considered as a nonlinear strategy to complement such approaches for more general networks. In this paper, we propose a partial packet recovery scheme that benefits from the sparsity of bit errors in partially corrupted RLC packets. As opposed to many previous schemes, it performs without introducing preliminary checksums or preambles, demanding physical layer soft information, or requesting post-redundancy from the transmitter. It relies only on algebraic coding and data processing techniques, the existing knowledge at the receiver, and the conventional acknowledgment messages in RLC. By reconstructing and utilizing the partially corrupted packets that are usually discarded, it can reduce the average number of transmitted RLC packets required for successful decoding by typically 50%, which improves throughput and energy efficiency at the transmitter. We formulate our partial packet recovery in the form of a sparse recovery problem, present its different solutions using compressive sensing theory, discuss their complexity, and present and evaluate a Markov chain model for its performance.

关键词： Partial packet recovery compressive sensing random linear coding efficient transmission

来源：评论

学校读者我要写书评

暂无评论

Efficient Parallelized Network coding for P2P File Sharing Applications

Efficient Parallelized Network Coding for P2P File Sharing A...

引用

4th International Conference on Grid and Pervasive Computing

作者： Park, Karam Park, Joon-Sang Ro, Won W. Yonsei Univ Sch Elect & Elect Engn Seoul 120749 South Korea Hongik Univ Dept Comp Engn Seoul South Korea

ISBN: (纸本)9783642016707

In this paper, we investigate parallel implementation techniques for network coding to enhance the performance of Peer-to-Peer (P2P) file sharing applications. It is known that network coding mitigates peer/piece selection problems in P2P file sharing systems;however, due to the decoding complexity of network coding, there have been concerns about adoption of network coding in P2P file sharing systems and to improve the decoding speed the exploitation of parallelism has been proposed previously. In this paper, we argue that naive parallelization strategies of network coding may result in unbalanced workload distribution and thus limiting performance improvements. We further argue that higher performance enhancement can be achieved through load balancing in parallelized network coding and propose new parallelization techniques for network coding. Our experiments show that, on a quad-core processor system, proposed algorithms exhibit up to 30% of speed-up compared to an existing approach using 1 Mbytes data with 2048x2048 coefficient matrix size.

关键词： Network coding parallelization random linear coding

来源：评论

学校读者我要写书评

暂无评论

random linear Coded Distributed Caching for Video Streaming over D2D 14

Random Linear Coded Distributed Caching for Video Streaming ...

引用

14th Annual Conference on Wireless On-Demand Network Systems and Services (WONS)

作者： Pedersen, Hasti A. Sassatelli, Lucile Aparicio-Pardo, Ramon Univ Calif San Diego San Diego CA 92103 USA Univ Cote Azur CNRS I3S Sophia Antipolis France

ISBN: (纸本)9783903176010

In distributed file systems, random-linear-coding (RLC) reduces scheduler complexity and download time by eliminating the coupon collector problem [1]. Similar benefits for video streaming in Distributed Video Caching and Sharing (DVCS) systems require segmentation of videos into codeblocks, over which RLC can be applied, to ensure videos' quality. This research proposes RLC-based DVCS (RLC-DVCS), and shows that RLC reduces complexity of the distributed video caching decision from which video chunks to how many RLC chunks to cache at each mobile device, and better facilitates distributability of content among devices (more mobile devices dedicating fewer resources each). All while increasing the number of video requests served ontime from DVCS, despite the challenges of video streaming. RLC-DVCS utilizes optimization and approximation methods for video segmentation, cache selection and allocation, to ensure videos' quality and cache more videos of highest request probability by reducing distributed size of each video. Using lagrangian relaxation allows for distributed RLC-DVCS where each mobile device decides how many RLC chunks to cache with limited coordination from other devices or a centralized scheduler. Monte Carlo evaluation of the proposed methods shows that RLC-DVCS achieves higher recovery probability than symmetric allocation of RLC chunks across mobile devices or un-coded DVCS.

关键词： random linear coding Network coding Mobile Device Caching Wireless Networks Video Quality of Experience

来源：评论

学校读者我要写书评

暂无评论

Transversal GRAND for Network Coded Data

Transversal GRAND for Network Coded Data

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Chatzigeorgiou, Ioannis Univ Lancaster Sch Comp & Commun Lancaster England

ISBN: (纸本)9781665421607;9781665421591

This paper considers a transmitter, which uses random linear coding (RLC) to encode data packets. The generated coded packets are broadcast to one or more receivers. A receiver can recover the data packets if it gathers a sufficient number of coded packets. We assume that the receiver does not abandon its efforts to recover the data packets if RLC decoding has been unsuccessful;instead, it employs syndrome decoding in an effort to repair erroneously received coded packets before it attempts RLC decoding again. A key assumption of most decoding techniques, including syndrome decoding, is that errors are independently and identically distributed within the received coded packets. Motivated by the 'guessing random additive noise decoding' (GRAND) framework, we develop transversal GRAND: an algorithm that exploits statistical dependence in the occurrence of errors, complements RLC decoding and achieves a gain over syndrome decoding, in terms of the probability that the receiver will recover the original data packets.

关键词： Network coding fountain coding random linear coding GRAND syndrome decoding error burst

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：