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

network-coding Solutions for Minimal Combination networks and Their Sub-networks

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第11期66卷 6786-6798页

作者： Cai, Han Chrisnata, Johan Etzion, Tuvi Schwartz, Moshe Wachter-Zeh, Antonia Ben Gurion Univ Negev Sch Elect & Comp Engn IL-8410501 Beer Sheva Israel Nanyang Technol Univ Sch Phys & Math Sci Singapore 639798 Singapore Technion Israel Inst Technol Dept Comp Sci IL-3200003 Haifa Israel Tech Univ Munich Inst Commun Engn D-80333 Munich Germany

Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some constraints on their possible solutions. We then focus on the combination network, which is one of the simplest and most insightful network in network-coding theory. Of particular interest are minimal combination networks. We study the gap in alphabet size between vector-linear and scalar-linear network-coding solutions for such minimal combination networks and some of their sub-networks. For minimal multicast networks with two source messages we find the maximum possible gap. We define and study sub- networks of the combination network, which we call Kneser networks, and prove that they attain the upper bound on the gap with equality. We also prove that the study of this gap may be limited to the study of sub-networks of minimal combination networks, by using graph homomorphisms connected with the q-analog of Kneser graphs. Additionally, we prove a gap for minimal multicast networks with three or more source messages by studying Kneser networks. Finally, an upper bound on the gap for full minimal combination networks shows nearly no gap, or none in some cases. This is obtained using an MDS-like bound for subspaces over a finite field.

关键词： linear network coding minimal networks combination network graph coloring q-Kneser graphs

来源：评论

学校读者我要写书评

暂无评论

Binary Soliton-Like Rateless coding for the Y-network

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2011年第12期59卷 3217-3222页

作者： Liau, Andrew Yousefi, Shahram Kim, Il-Min Queens Univ Dept Elect & Comp Engn Kingston ON K7L 3N6 Canada

For the binary erasure channel, Luby Transform (LT) and Raptors codes have been shown to achieve capacity by carefully designed degree distributions for multicasting scenarios. Generalizing fountain codes to multihop networks requires transport nodes to perform network coding (NC). However, if intermediate nodes perform decentralized NC blindly, the statistical properties imposed by the fountain code are lost, and thus, a Gaussian elimination decoder must be used at the sink at the cost of significant increase in complexity compared to a belief propagation (BP) decoder. Addressing this problem, in this paper, we propose a new protocol, namely Soliton-like rateless coding (SLRC), by exploiting the benefits of fountain coding and NC coding over a Y-network. Ensuring key properties of the fountain code are preserved;BP can be effectively applied when transport nodes perform NC. Additionally, the proposed coding protocol is resilient to nodes churn rates. The SLRC scheme is evaluated against buffer-and-forwarding, and the distributed LT (DLT) codes;SLRC exhibits a 5% reduction in overhead compared to the state of the art DLT code at high decoding success rates. Simulations show that the proposed scheme preserves the benefits of NC and fountain coding.

关键词： Distributed LT codes fountain codes linear network coding LT codes

来源：评论

学校读者我要写书评

暂无评论

A network coding and DES Based Dynamic Encryption Scheme for Moving Target Defense

引用

IEEE ACCESS 2018年 6卷 26059-26068页

作者： Tang, Hanqi Sun, Qifu Tyler Yang, Xiaolong Long, Keping Univ Sci & Technol Beijing Sch Comp & Commun Engn Beijing 10083 Peoples R China Univ Sci & Technol Beijing Sch Comp & Commun Engn Inst Adv Networking Technol & Serv Beijing 10083 Peoples R China

Unlike prior efforts in cybersecurity research, a dynamic defense theory, called moving target defense, increases the complexity and costs for attacks by effectively restricting the vulnerability exposure and the attack opportunities through various continually-changing evaluation, development mechanisms and strategy. Data encryption standard (DES) was the classical scheme of the traditional symmetrickey encryption schemes. Now it has been gradually replaced by the triple DES or advanced encryption standard (AES) so that the encoder has a larger key space. However, both the triple DES and AES cannot meet the dynamic security requirements of dynamic defense due to their static extension to the key space. In this paper, we propose a dynamic three-layer encryption scheme based on DES and network coding, with a low-complexity partial key update mechanism. Based on the theoretical analysis, the new scheme is shown to have the benefit to achieve a dynamic transition between efficiency and security, which increases its adaptability to various cyber conditions. The simulation results also show that the running ratio of the new scheme is relatively lower than or comparable to the triple DES.

关键词： Moving target defense dynamic defense theory cyber security linear network coding DES

来源：评论

学校读者我要写书评

暂无评论

Wireless network coding for Multi Radio Multi Channel Mesh networks

引用

WIRELESS PERSONAL COMMUNICATIONS 2019年第3期106卷 1629-1647页

作者： Alabady, Salah Abdulghani Salleh, Mohd Fadzli Mohd Univ Mosul Comp Engn Mosul Iraq Univ Sains Malaysia Sch Elect & Elect Engn Nibong Tebal 14300 Pulau Pinang Malaysia

In wireless networks packets are lost because of queue congestion during high traffic, collisions, hidden nodes, and link failures. The problem of dropped packets becomes more critical in real-time applications, such as video conferences and remote controls. This paper presents a new wireless network coding (WNC) scheme and router detection packet loss (RDPL) algorithm for retrieving packets that are lost in a wireless network. In the WNC scheme, a router combines (encodes) packets originating from the same or different sources and forwards the packets to another router. In the RDPL algorithm, the coding router sends a negative acknowledge to the upper layer routers whenever it receives only one packet or two identical packets. The proposed WNC-RDPL method increases the transmission capacity and packet delivery ratio (PDR). The architecture has been evaluated for one, two, three, and four link failures. The simulation results show that the WNC-RDPL approach obtain 100% PDR gains compared with well-known linear network coding schemes.

关键词： Wireless network coding network coding linear network coding Link failures

来源：评论

学校读者我要写书评

暂无评论

A minimum cost cache management framework for information-centric networks with network coding

引用

COMPUTER networkS 2016年第Dec.9期110卷 1-17页

作者： Wang, Jin Ren, Jing Lu, Kejie Wang, Jianping Liu, Shucheng Westphal, Cedric Soochow Univ Dept Comp Sci & Technol 1 Shizi Rd Suzhou 215006 Peoples R China Univ Elect Sci & Technol China Sch Commun & Informat Engn 2006 Xiyuan Ave Chengdu 611731 Peoples R China Shanghai Univ Elect Power Coll Comp Sci & Technol 2588 Changyang Rd Shanghai 200090 Peoples R China Univ Puerto Rico Mayaguez Dept Elect & Comp Engn Mayaguez PR 00681 USA City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Huawei Technol Co Ltd Longgang DIST Bantian Shenzhen 518129 Peoples R China Univ Calif Santa Cruz Dept Comp Engn Santa Cruz CA 95064 USA

In recent years, the increasing demand for media-rich content has driven many efforts to redesign the Internet architecture. As one of the main candidates, information-centric network (ICN) has attracted significant attention, where in-network cache is a key component in different ICN architectures. In this paper, we propose a novel framework for optimal cache management in ICNs that jointly considers caching strategy and content routing. Specifically, our framework is based on software-defined networking (SDN) where a controller is responsible for determining the optimal caching strategy and content routing via linear network coding (LNC). For the proposed cache management framework, we first formulate an optimization problem to minimize the network bandwidth cost and cache cost by jointly considering caching strategy and content routing with LNC. We then develop an efficient network coding based cache management (NCCM) algorithm to obtain a near-optimal caching and routing solution for ICNs. We further derive the upper and lower bounds of the problem and conduct extensive experiments to compare the performance of the NCCM algorithm with these bounds. Simulation results validate the effectiveness of the NCCM algorithm and the framework. (C) 2016 Elsevier B.V. All rights reserved.

关键词： linear network coding Information-centric network Cache management Bandwidth cost Cache cost

来源：评论

学校读者我要写书评

暂无评论

Physical-layer network coding with multi-antenna transceivers in interference limited environments

引用

IET COMMUNICATIONS 2016年第4期10卷 363-371页

作者： Phan, Hoc Zheng, Fu-Chun Chu, Thi My Chinh Univ Reading Sch Syst Engn Reading RG6 6AY Berks England Blekinge Inst Technol Sch Comp SE-37179 Karlskrona Sweden

In this study, the authors first analyse system performance of beamforming amplify-and-forward two-way relay networks with physical-layer network coding under the impact of co-channel interference from multiple surrounding terminals and then propose the associated power allocation strategies. The performance of the two-way communications in terms of outage probability, symbol error rate (SER), and total ergodic channel capacity of the system is quantified. Asymptotic performance analysis for sufficiently high signal-to-noise ratio is also provided to obtain further valuable insights into system designs. Based on the analysis, power allocation strategies to minimise the asymptotic outage probability and SER as well as to maximise the ergodic channel capacity under the total power constraint are developed. The numerical results show that the proposed power allocation approaches outperform equal power allocation given the same total power budget and other system parameters.

关键词： linear network coding CHANNEL coding TELECOMMUNICATION network management RADIO transmitter-receivers INTERFERENCE (Telecommunication)

来源：评论

学校读者我要写书评

暂无评论

Space-Time network coding

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2011年第4期59卷 1706-1718页

作者： Lai, Hung-Quoc Liu, K. J. Ray USA RDECOM CERDEC RDER STA DS Aberdeen Proving Ground MD 21005 USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

Traditional cooperative communications can improve communication reliability. However, transmissions from multiple relay nodes are challenging in practice. Single transmissions in time-division multiple-access (TDMA) manner cause large transmission delay, but simultaneous transmissions from two or more nodes using frequency-division multiple access (FDMA) and code-division multiple access (CDMA) are associated with the issue of imperfect frequency and timing synchronization. In this work, a novel framework for cooperative communications is proposed to achieve full spatial diversity with low transmission delay and eliminate the issue of imperfect synchronization. This is realized by the use of space-time network codes (STNCs) associated with a novel concept of wireless network cocast. For a network of N client nodes, R relay nodes and a base node, the STNCs provide a diversity order of (R + 1) for each symbol with (N + R) time slots, a reduction from 2N time slots in traditional FDMA and CDMA cooperative communications for N being usually greater than R and from N(R + 1) time slots in traditional TDMA cooperative communications. The STNCs are also applied in networks, where the client nodes located in a cluster act as relays to help one another to improve their transmission performance. The performance in clustering setting is studied to show the improvement in power saving, range extension, and transmission rate.

关键词： Cooperative communications frequency synchronization linear network coding space-time network codes timing synchronization wireless network cocast

来源：评论

学校读者我要写书评

暂无评论

Multicast Switching Fabric Based on network coding and Algebraic Switching Theory

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第7期64卷 2999-3010页

作者： Chen, Fuxing Li, Hui Tan, Xuesong Li, Shuo-Yen Robert Peking Univ Shenzhen Grad Sch Sch Elect & Comp EngnShenzhen Engn Lab Converged Shenzhen Key Lab Informat Theory & Future Interne Shenzhen 518055 Peoples R China Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 610051 Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

Scheduling algorithms are crucial for most existing switches to improve the throughput. However, the delay of the switching fabric cannot be guaranteed with such scheduling algorithms. This paper aims to design a novel load-balanced wire-speed multicast switching fabric along with the attractive merits of network coding. We adopt a two-phase self-routing switching fabric constructed by Boolean-multicast concentrators (SRBMCs), where the first SRBMC distributes the incoming cells to its outputs uniformly and the second allows the distributed cells to be self-routed and multicast to their destinations concurrently. To further improve the switching performance, linear network coding is smoothly combined with SRBMC to reduce the packet loss rate. Theoretical analysis and numerical simulation demonstrate that the proposed switching fabric cannot only achieve wire-speed multicast switching but also be recursively constructed into an indefinite large-scale one with such merits as no internal buffers, low complexity, and guarantee in switching delay. Finally, we implement the proposed fabric on Field-Programmable Gate Array and verify its performance in multicast switching.

关键词： Load balance multicast switch Boolean concentrator linear network coding lattice theory

来源：评论

学校读者我要写书评

暂无评论

Optimisation of layer rate and wavelength allocation based on network coding for multirate optical multicast

引用

IET COMMUNICATIONS 2014年第9期8卷 1570-1577页

作者： Liu, Huanlin Hu, Ting Chen, Yong Chen, Qianbin Xie, Yunhui Chongqing Univ Posts & Telecommun Key Lab Opt Fiber Commun Technol Chongqing Key Lab Signal & Informat Proc Chongqing 400065 Peoples R China

Layered multicast, one of the multirate multicast, is effective in optimising network throughput for heterogeneous WDM (wavelength division multiplexed) networks. Compared with single layer multicast, layered multicast can achieve the maximal network throughput, making each layer multicast member receive the data with its maximal capacity. However, how to optimise each layer rate for multirate multicast network is a classical NP-hard problem. In this study, the authors propose a layer rate optimal allocation algorithm based on network coding (NC-LROA) to get the optical multicast network maximal throughput and to reduce wavelength number required by multicast. In the NC-LROA algorithm, the multicast layered rate is optimised with the heuristic algorithm, which runs to reachable network maximal throughput rather than the minimal value in each destination node's maximal flow. The authors use the network coding to compress the transmitting information among wavelength channels, which have high links sharing degree so as to improve wavelength utilisation. The high sharing degree links have the priority to assign wavelength bandwidth in the inter-layer multicast routing. Simulation results show that the proposed algorithm can, by optimising the layer rate, get network maximal throughput and at the same time reduce the wavelength bandwidth consumption for the optical multicast network.

关键词： linear network coding WAVELENGTH division multiplexing WAVELENGTHS HEURISTIC algorithms MULTICASTING (Computer networks) BANDWIDTH allocation (networks)

来源：评论

学校读者我要写书评

暂无评论

Improved Low-Complexity Soliton-Like network coding for a Resource-Limited Relay

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第8期61卷 3327-3335页

作者： Liau, Andrew Kim, Il-Min Yousefi, Shahram Queens Univ Dept Elect & Comp Engn Kingston ON K7L 3N6 Canada

In this paper, we examine the marriage of Fountain coding and network coding (NC). Fountain codes are capacity achieving erasure codes designed for point-to-point transmissions. NC is a throughput-optimal data dissemination technique, but its high-complexity decoding makes it unattractive for applications where limited resources are available. In this paper, we consider Fountain network coding to take advantage of efficient fountain decoders. Protocols such as Soliton-like rateless coding (SLRC) have previously addressed this issue, yet the re-encoding at the relay is expensive while there is still room for improving the performance. Extending SLRC, we propose the Improved Soliton-like Rateless coding (ISLRC) protocol, where the relay is designed to perform distribution shaping given limited resources. ISLRC preserves the same properties as SLRC, but also makes the aggregate degree distribution more efficient for Fountain decoding. We analyze ISLRC's degree distribution and perform an asymptotic error analysis for the case where resources are most scarce. The ISLRC scheme is compared against other existing schemes. Simulation results show that even under the worst-case scenario of ISLRC, better performance can be achieved compared to SLRC and other existing schemes.

关键词： Distributed LT codes fountain codes linear network coding LT codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：