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

Latency and Alphabet Size in the Context of Multicast network coding

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第7期68卷 4289-4300页

作者： Gonen, Mira Langberg, Michael Sprintson, Alex Ariel Univ Dept Comp Sci IL-40700 Ariel Israel SUNY Buffalo Dept Elect Engn Buffalo NY 14260 USA Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

We study the relation between latency and alphabet size in the context of Multicast network coding. Given a graph G = (V, E) representing a communication network, a subset S subset of V of sources, each of which initially holds a set of information messages, and a set T subset of V of terminals;we consider the problem in which one wishes to design a communication scheme that eventually allows all terminals to obtain all the messages held by the sources. In this study we assume that communication is performed in rounds, where in each round each network node may transmit a single (possibly encoded) information packet on any of its outgoing edges. The objective is to minimize the communication latency, i.e., number of communication rounds needed until all terminals have all the messages of the source nodes. For sufficiently large alphabet sizes (i.e., large block length, packet sizes), it is known that traditional linear multicast network coding techniques (such as random linear network coding) minimize latency. In this work we seek to study the task of minimizing latency in the setting of limited alphabet sizes (i.e., finite block length), and alternatively, the task of minimizing the alphabet size in the setting of bounded latency. We focus on the establishing the computation complexity of the problem and present several intractability results. In particular, through reductive arguments, we prove that it is NP-hard to (i) approximate (and in particular to determine) the minimum alphabet size given a latency constraint;(ii) approximate (and in particular to determine) the minimum latency of communication schemes in the setting of limited alphabet sizes.

关键词： network coding multicast latency

来源：评论

学校读者我要写书评

暂无评论

Survivable Virtual network Link Protection Method Based on network coding and Protection Cricuit

引用

IEEE ACCESS 2018年 6卷 67477-67493页

作者： Su, Yuze Meng, Xiangru Kang, Qiaoyan Han, Xiaoyang Air Force Engn Univ Coll Informat & Nav Xian 710077 Shaanxi Peoples R China

network virtualization is believed to be a promising way for the next generation Internet to overcome network ossification. It allows multiple heterogeneous virtual networks (VNs) to be embedded onto the shared substrate network (SN) to offer more flexibility and better manageability. With the increasing deployments of VNs in a variety of networks, how to protect the VNs against the single substrate link failure has become a key challenge. In this paper, we propose a survivable VN link protection method based on network coding and protection circuit. First, we provide an integer linear programming formulation for the survivable VN link protection to maximize the long-term average revenue to cost ratio. Second, a novel protection circuit technology is introduced to augment the VN at the VN level to reduce the backup resource consumption and provide more flexible VN management. Then, an efficient heuristic virtual network embedding algorithm is developed, which makes full use of the limited resources and transforms the single substrate link protection into the single virtual link protection in multiple protection circuits. Finally, the data units from different links are encoded using network coding, which not only provides 1 + N protection to virtual links but also reduces the recovery delay. The evaluation results show that our method not only has the best acceptance ratio and long-term average revenue to cost ratio, but it also greatly enhances the achievable backup sharing and shortens the average network recovery delay.

关键词： Survivable virtual networks link protection single substrate link failure augmented VN network coding protection circuit

来源：评论

学校读者我要写书评

暂无评论

A random linear network coding approach to multicast

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第10期52卷 4413-4430页

作者： Ho, Tracey Medard, Muriel Koetter, Ralf Karger, David R. Effros, Michelle Shi, Jun Leong, Ben MIT LIDS Cambridge MA 02139 USA Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA MIT CSAIL Cambridge MA 02139 USA

We present a distributed random linear network coding approach for transmission and compression of information in general multisource multicast networks. network nodes independently and randomly select linear mappings from inputs onto output links over some field. We show that this achieves capacity with probability exponentially approaching I with the code length. We also demonstrate that random linear coding performs compression when necessary in a network, generalizing error exponents for linear Slepian-Wolf coding in a natural way. Benefits of this approach are decentralized operation and robustness to network changes or link failures. We show that this approach can take advantage of redundant network capacity for improved success probability and robustness. We illustrate some potential advantages of random linear network coding over routing in two examples of practical scenarios: distributed network operation and networks with dynamically varying connections. Our derivation of these results also yields a new bound on required field size for centralized network coding on general multicast networks.

关键词： distributed compression distributed networking multicast network coding random linear coding

来源：评论

学校读者我要写书评

暂无评论

Hamming-distance-based adaptive quantum-inspired evolutionary algorithm for network coding resources optimization

引用

The Journal of China Universities of Posts and Telecommunications 2015年第3期22卷 92-99页

作者： Qu Zhijian Liu Xiaohong Zhang Xianwei Xie Yinbao Li Caihong School of Computer Science and Technology Shandong University of Technology

An adaptive quantum-inspired evolutionary algorithm based on Hamming distance （HD-QEA） was presented to optimize the network coding resources in multicast networks. In the HD-QEA, the diversity among individuals was taken into consideration, and a suitable rotation angle step （RAS） was assigned to each individual according to the Hamming distance. Performance comparisons were conducted among the HD-QEA, a basic quantum-inspired evolutionary algorithm （QEA） and an individual＇s fitness based adaptive QEA. A solid demonstration was provided that the proposed HD-QEA is better than the other two algorithms in terms of the convergence speed and the global optimization capability when they are employed to optimize the network coding resources in multicast networks.

关键词： network coding quantum-inspired evolutionary algorithm Hamming distance multicast network

来源：评论

学校读者我要写书评

暂无评论

RS-RLNC: A Reinforcement Learning-Based Selective Random Linear network coding Framework for Tactile Internet

引用

IEEE ACCESS 2023年 11卷 141277-141288页

作者： Shahzad Ali, Rashid Haider, Amir Kim, Hyung Seok Sejong Univ Dept Intelligent Mechatron Engn Seoul 05006 South Korea Univ West Dept Engn Sci S-46132 Trollhattan Sweden

Tactile Internet (TI) has very stringent networking requirements and the transport layer plays a crucial role in meeting these requirements. However, the transport layer has several inherent limitations (e.g., bufferbloat, incast issue, and head of line blocking) due to which the performance of the current transport layer solutions is not optimal. We advocate replacing the "store-and-forward" strategy in transport layer solutions with the "compute-and-forward" strategy. One way to implement the "compute-and-forward" strategy is random linear network coding (RLNC). This paper proposes a learning-based RLNC framework called RS-RLNC that utilizes network and receiver feedback to optimally select between block-RLNC and sliding-RLNC to improve overall network performance. We present a simulation-based performance evaluation of current transport layer solutions against the state-of-the-art RLNC and RS-RLNC in terms of throughput, latency, and decoding complexity. Delay is reduced by a factor of 8.5% and decoding complexity is improved up to 20% compared to the state-of-the-art. Simulation results indicate that RS-RLNC has the potential to meet the stringent requirements of TI applications. Additionally, we present three future directions outlining the evolution of RS-RLNC to enhance the transport layer for TI compatibility.

关键词： network coding RLNC reinforcement learning tactile internet URLLC

来源：评论

学校读者我要写书评

暂无评论

All-to-all data dissemination with network coding in dynamic MANETs

引用

COMPUTER networkS 2014年第PartB期74卷 34-47页

作者： Vingelmann, Peter Heide, Janus Pedersen, Morten Videbaek Zhang, Qi Fitzek, Frank H. P. Budapest Univ Technol & Econ Budapest Hungary Aalborg Univ Dept Elect Syst Aalborg Denmark Aarhus Univ Dept Engn DK-8000 Aarhus C Denmark

This paper investigates the problem of efficient data dissemination in Mobile Ad hoc NET-work (MANETs). A testbed is presented;which provides a realistic degree of mobility in experiments. The testbed consists of ten autonomous robots with mobile phones mounted on them. The mobile phones form an IEEE 802.11g ad hoc network to communicate with each other. A dynamic network topology is assumed, where the mobile devices form a cooperative cluster in order to communicate directly with each other. In the investigated scenario, the initial state is that each device carries a unique fragment of the full data set, and the goal is to exchange this data set among all devices. Several alternative strategies are presented that use UDP broadcast transmissions and Random Linear network coding (RLNC) to facilitate the efficient exchange of information in the wireless network. An application is introduced;which implements these strategies on Nokia phones. Results collected during an extensive measurement campaign are presented, and the performance of several strategies is compared using numerous metrics. We observe that network coding can substantially reduce the completion time in our scenario, which also leads to significant energy savings. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Data dissemination MANET Testbed Mobility Robots network coding

来源：评论

学校读者我要写书评

暂无评论

A unification of network coding and tree-packing (routing) theorems

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第6期52卷 2398-2409页

作者： Wu, Yunnan Jain, Kamal Kung, Sun-Yuan Microsoft Res Redmond WA 98052 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA

Given a network of lossless links with rate constraints, a source node, and a set of destination nodes, the multicast capacity is the maximum rate at which the source can transfer common information to the destinations. The multicast capacity cannot exceed the capacity of any cut separating the source from a destination;the minimum of the cut capacities is called the cut bound. A fundamental theorem in graph theory by Edmonds established that if all nodes other than the source are destinations, the cut bound can be achieved by routing. In general, however, the cut bound cannot be achieved by routing. Ahlswede et al established that the cut bound can be achieved by performing network coding, which generalizes routing by allowing information to be mixed. This paper presents a unifying theorem that includes Edmonds' theorem and Ahlswede et al.'s theorem as special cases. Specifically, it shows that the multicast capacity can still be achieved even if information mixing is only allowed on edges entering relay nodes. This unifying theorem is established via a graph theoretic hardiviring theorem, together with the network coding theorems for multicasting. The proof of the hardwiring theorem implies a new proof of Edmonds' theorem.

关键词： flow multicast network coding routing Steiner tree

来源：评论

学校读者我要写书评

暂无评论

network coding with Remix Qualification for Multicasting in Delay-Tolerant networks

Network Coding with Remix Qualification for Multicasting in ...

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Hsu, Yu-Feng Hu, Chih-Lin Natl Cent Univ Dept Commun Engn Tao Yuan Taiwan

ISBN: (纸本)9781467359399;9781467359382

In delay-tolerant networks where connectivity between nodes is intermittent, replication-based delivery mechanisms are often employed to deliver messages in a store-carry-forward manner instead of end-to-end delivery techniques that are mainly used in traditional computer networks and mobile ad-hoc networks. However, multicasting with replication-based methodologies can induce considerable message traffic and longer delivery delay time, thereby being vulnerable upon system performance. This paper exploits the potential of network coding to design an efficient network-coding multicast mechanism in delay-tolerant networks. In this design, intermediate nodes in a network can perform a specific remix qualification approach which can not only alleviate the dependency problem among coded blocks but also generate more innovative coded blocks for restoring the original message by destination nodes. Simulation results show that the proposed mechanism is able to achieve cost-effective performance as compared with the naive network-coding and the replication-based delivery mechanisms for message multicasting in delay-tolerant networks.

关键词： computer networks delay tolerant networks mobile ad hoc networks multicast communication network coding telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

network coding Efficiency In The Presence Of An Intermittent Backhaul network

Network Coding Efficiency In The Presence Of An Intermittent...

引用

IEEE International Conference on Communications (ICC)

作者： Achleitner, Stefan La Porta, Thomas Krishnamurthy, Srikanth V. Quizhpi, Victor S. Penn State Univ Comp Sci & Engn University Pk PA 16802 USA Univ Calif Riverside Comp Sci & Engn Riverside CA 92521 USA United States Army CERDEC Radio Freq Comm Div Aberdeen Proving Ground MD 21005 USA

ISBN: (纸本)9781479966646

In infrastructure-lacking environments, like military areas of operation, the intermittent availability of backhaul networks leads to greater reliance on peer to peer data exchange. In such settings, mobile nodes use Delay Tolerant network (DTN) protocols for exchanging location specific data. High transmission delay, packet loss and intermittent connectivity increases the need for efficient data transmission in such scenarios. In this paper, we evaluate network coding for efficient data exchange between mobile wireless nodes under the presence of an intermittent backhaul network, like a satellite or cellular link. We analyze the upper bound of savings achievable with network coding for single-hop packet transmission, and introduce a network coding algorithm focused on reducing the required number of packet transmissions in such a setting. Evaluation of our proposed data exchange protocol shows how network coding can be applied to reduce transmission delay and minimize the dependency on an intermittent backhaul network in a communication scenario typical of a military environment.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network coding for Critical Infrastructure networks 26

Network Coding for Critical Infrastructure Networks

引用

26th IEEE International Conference on network Protocols (INCP)

作者： Kumar, Rakesh Babu, Vignesh Nicol, David Univ Illinois Elect & Comp Engn Dept Urbana IL 61801 USA

ISBN: (纸本)9781538660430

The applications in the critical infrastructure systems pose simultaneous resilience and performance requirements to the underlying computer network. To meet such requirements, the networks that use the store-and-forward paradigm poses stringent conditions on the redundancy in the network topology and results in problems that becoming computationally challenging to solve at scale. However, with the advent of programmable data-planes, it is now possible to use linear network coding (NC) at the intermediate network nodes to meet resilience requirements of the applications. To that end, we propose an architecture that realizes linear NC in programmable networks by decomposing the linear NC functions into the atomic coding primitives. We designed and implemented the primitives using the features offered by the P4 ecosystem. Using an empirical evaluation, we show that the theoretical gains promised by linear network coding can be realized with a per-packet processing cost.

关键词： Resilience network coding Software Defined networking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：