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

5th International Conference on Broadband Communications networks and Systems

作者： Pappas, Nikolaos Traganitis, Apostolos Univ Crete Telecommun & Networks Lab Inst Comp Sci FORTH N Plastira 100 Vassilika Vouton GR-70013 Iraklion Crete Greece Univ Crete Dept Comp sci GR-70013 Iraklion Crete Greece

ISBN: (纸本)9781424423910

The alphabet size of a network code is a crucial parameter for the existence of a code in a network topology. In this paper we present a method to compute the alphabet size of a linear network code for an one-source acyclic directed graph using only the outgoing edges from the source. In addition we show a method to reduce the alphabet size for a class of combination networks.

关键词： linear network coding Alphabet size Galois Fields

来源：评论

学校读者我要写书评

暂无评论

Capacity of Sum-networks for Different Message Alphabets

Capacity of Sum-networks for Different Message Alphabets

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Tripathy, Ardhendu Ramamoorthy, Aditya Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

ISBN: (纸本)9781467377041

A sum-network is a directed acyclic network in which all terminal nodes demand the 'sum' of the independent information observed at the source nodes. Many characteristics of the well-studied multiple-unicast network communication problem also hold for sum-networks due to a known reduction between instances of these two problems. Our main result is that unlike a multiple unicast network, the coding capacity of a sum-network is dependent on the message alphabet. We demonstrate this using a construction procedure and show that the choice of a message alphabet can reduce the coding capacity of a sum-network from 1 to close to 0.

关键词： capacity function computation linear network coding network coding sum-network

来源：评论

学校读者我要写书评

暂无评论

Content Distribution network for Streaming using Multiple Galois Fields 53

Content Distribution Network for Streaming using Multiple Ga...

引用

IEEE International Symposium on Circuits and Systems (IEEE ISCAS)

作者： Hung, Tsung-Kang Kaushal, Sachin K. Hsiao, Hsu-Feng Natl Yang Ming Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan Natl Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (纸本)9781728192017

In this paper, the architecture of random linear network coding based on the hybrid coding in multiple Galois field sizes is proposed. Random linear network coding is an efficient network coding approach that enables network to generate independently and randomly linear mapping between input and output symbols over finite field. With the proposed reduction method, coded symbols and coefficients in higher degree of Galois field can be converted to symbols and coefficients in GF(2) so that hybrid coding in multiple Galois field sizes can be made possible. Therefore, peers in the heterogeneous environments can all benefit from the proposed content distribution network for streaming to better utilize the network resource.

关键词： linear network coding CDN Galois field

来源：评论

学校读者我要写书评

暂无评论

A novel secure coding-based approach for multi-cast transmission

A novel secure coding-based approach for multi-cast transmis...

引用

18th IEEE International Conference on High Performance Computing and Communications (HPCC) / 14th IEEE International Conference on Smart City (Smart City) / 2nd IEEE International Conference on Data Science and Systems (DSS)

作者： Ning, Zuoting Zhang, Dafang Xie, Kun Bi, Xiaan Hunan Univ Coll Comp Sci & Elect Engn Changsha 410082 Hunan Peoples R China Hunan Normal Univ Coll Math & Comp Sci Changsha 410081 Hunan Peoples R China

ISBN: (纸本)9781509042975

A lot of research shows that network coding can significantly improve the performance of multi-cast transmission. However, due to the inherent disadvantage of network coding, it is very vulnerable to pollution attacks in which adversaries can inject bogus data. Moreover, those bogus data will be used with legitimate data at the downstream nodes, resulting in the failure of decoding original data as well as a sharp decrease of the network performance. In this paper, we propose a novel approach to identify pollution attacks, so that malicious nodes can be rapidly identified and isolated from the networks. In our scheme, in order to prevent malicious attacks, we design a secure infrastructure in which we exploit key pre-distribution and Message Authentication Codes(MACs);Meanwhile, we propose a secure transmission protocol. Each node registers a key from center server and appends MACs to each packet. Furthermore, in order to make verification, each node needs to carry out hash computation for every incoming packet under the secure transmission protocol. Experimental results demonstrate that our scheme has practical advantages in the presence of endto- end delay, network throughput and identification delay.

关键词： Pollution attack Malicious nodes linear network coding Multi-cast

来源：评论

学校读者我要写书评

暂无评论

Multicast triangular semilattice network

引用

Involve 2019年第8期12卷 1307-1328页

作者： Grosso, Angelina Manganiello, Felice Varal, Shiwani Zhu, Emily Division of Applied Mathematics Brown University Providence RI United States School of Mathematical and Statistical Sciences Clemson University Clemson SC United States Faculty of Business Law and Politics University of Hull Hull United Kingdom Department of Mathematics University of California at San Diego La Jolla CA United States

We investigate the structure of the code graph of a multicast network that has a characteristic shape of an inverted equilateral triangle. We provide a criterion that determines the validity of a receiver placement within the code graph, present invariance properties of the determinants corresponding to receiver placements under symmetries, and provide a complete study of these networks’ receivers and required field sizes up to a network of four sources. We also improve on various definitions related to code graphs. © 2019 Mathematical Sciences Publishers.

关键词： code graph determinantal condition finite field linear network coding multicast communication multicast network multivariate polynomial triangular semilattice

来源：评论

学校读者我要写书评

暂无评论

Speeding Multicast by Acknowledgment Reduction Technique (SMART)

Speeding Multicast by Acknowledgment Reduction Technique (SM...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Rezaee, Arman Zeger, Linda Medard, Muriel MIT Elect Res Lab Cambridge MA 02139 USA MIT Lincoln Lab Lexington MA 02421 USA

ISBN: (纸本)9781424492688

We present a novel feedback protocol for wireless broadcast networks that utilize linear network coding. We consider transmission of packets from one source to many receivers over a single-hop broadcast erasure channel. Our method utilizes a predictive model to request feedback only when the probability that all receivers have completed decoding is significant. In addition, our proposed NACK-based feedback mechanism enables all receivers to request, within a single time slot, the number of retransmissions needed for successful decoding. We present simulation results as well as analytical results that show the favorable scalability of our technique as the number of receivers, file size, and packet erasure probability increase. We also show the robustness of this scheme to uncertainty in the predictive model, including uncertainty in the number of receiving nodes and the packet erasure probability, as well as to losses of the feedback itself. Our scheme, SMART, is shown to perform nearly as well as an omniscient transmitter that requires no feedback. Furthermore, SMART, is shown to outperform current state of the art methods at any given erasure probability, file size, and numbers of receivers.

关键词： Base stations NACK-based feedback mechanism Peer to peer computing Predictive models Receivers Robustness SMART Transmitters broadcast communication feedback protocol linear codes linear network coding network coding omniscient transmitter packet erasure probability probability protocols radio networks radio receiver radio receivers single-hop broadcast erasure channel speeding multicast by acknowledgment reduction technique wireless broadcast networks wireless channels

来源：评论

学校读者我要写书评

暂无评论

Weakly Secure Coded Distributed Computing 4

Weakly Secure Coded Distributed Computing

引用

IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)

作者： Zhao, Ruimin Wang, Jin Lu, Kejie Wang, Jianping Wang, Xiumin Zhou, Jingya Cao, Chunming Soochow Univ Dept Comp Sci & Technol Suzhou Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538693803

In recent years, edge computing has become a hot topic because it can significantly reduce the latency of network services by utilizing the computation resources at the edge of the network. To further improve the latency performance, several coded distributed computing (CDC) schemes have been proposed, in which computation and communication resources can be used to trade off the delay. To design CDC scheme, data shuffling among computing nodes has been studied but the security issue in data shuffling has not been fully investigated. Therefore, in this paper, we investigate secure data shuffling in edge computing. Specifically, we first formulate a weakly secure edge computing problem, namely, the secure coded distributed computing (SCDC) problem. We then theoretically analyze the existence of weakly secure data shuffling. Based on the analysis, we propose a redundancy reduction (RR) algorithm to assign computing tasks to distributed nodes to minimize the latency with security guarantee, where we prove the correctness of the algorithm and the reduction ratio when RR is compared to existing CDC schemes. Finally, we conduct extensive simulation experiments that confirm the efficiency of the proposed RR scheme.

关键词： edge computing linear network coding weakly secure computation redundancy data shuffling

来源：评论

学校读者我要写书评

暂无评论

network Function Computation for Vector linear Functions

Network Function Computation for Vector Linear Functions

引用

2024 Information Theory Workshop

作者： Zhou, Qin Fu, Fang-Wei Nankai Univ Chern Inst Math & LPMC Tianjin Peoples R China

ISBN: (纸本)9798350348941;9798350348934

In this paper, we consider the vector linear function computing problem in a network where communication links may suffer from errors. A sink node is required to compute with zero error a vector linear function over a finite field, and the inputs of the target function are generated by multiple source nodes. The nodes in this network can combat errors by network coding. Given a nonnegative integer tau, the robust computing capacity for the above model is defined as the maximum average number of times that the target function can be computed with zero error at the sink node for one use of the network, in which at most t links may suffer from errors. When tau = 0, the robust computing capacity degenerates into the computing capacity without errors. For tau >= 0, we propose two cut-set bounds on the robust computing capacity. By comparing their performance under the same conditions, we find that the latter bound is superior to the former. Furthermore, we present an improved Singleton bound for linear network codes in the above model, and show that the improved Singleton bound performs better and is tight in a specific scenario. Moreover, we present the Hamming bound and an improved Hamming bound for linear network codes.

关键词： network function computation vector linear function cut-set bound robust computing capacity linear network coding

来源：评论

学校读者我要写书评

暂无评论

Higher distances for constant dimensions codes: the case of osculating spaces to a Veronese variety

引用

AFRIKA MATEMATIKA 2016年第5-6期27卷 1003-1020页

作者： Ballico, Edoardo Univ Trento Dept Math I-38123 Povo TN Italy

In linear network coding the information is encoded in terms of a basis of a vector space and it is received as a basis of a possible altered vector space. In the constant dimension case Koetter and Kschischang introduced a metric on the Grassmannian and proved efficient and correct decoding in terms of this metric. Here we introduce a second order invariant of the code: the minimum dimension of the linear span of 3 different linear subspaces belonging to the code. This is the case s = 3 of a family d(s) and d(s)', s >= 3, of invariants of network codes. We study these invariants in a case recently proposed by Hansen (the set of all osculating spaces of a Veronese embedding of a finite projective space) and for a related case (the set of osculating spaces to curves of positive genus) with a complete description of the case of elliptic curves and the ones related to the Hermitian curve.

关键词： linear network coding Grassmannian Osculating space Generalized Hamming weight Constant dimension linear network coding Veronese embedding Elliptic curve Hermitian curve

来源：评论

学校读者我要写书评

暂无评论

Generation of Innovative and Sparse Encoding Vectors for Broadcast Systems with Feedback

Generation of Innovative and Sparse Encoding Vectors for Bro...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Kwan, Ho Yuet Shum, Kenneth W. Sung, Chi Wan CUNY Dept Elect Engn New York NY 10021 USA Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781457705953

In the application of linear network coding to wireless broadcasting with feedback, we prove that the problem of determining the existence of an innovative encoding vector is NP-complete when the finite field size is two. When the finite field size is larger than or equal to the number of users, it is shown that we can always find an encoding vector which is both innovative and sparse. The sparsity can be utilized in speeding up the decoding process. An efficient algorithm to generate innovative and sparse encoding vectors is developed. Simulations show that the delay performance of our scheme with binary finite field outperforms a number of existing schemes in terms of average and worst-case delay.

关键词： Complexity theory Decoding Delay Encoding NP-complete network coding Receivers Vectors binary finite field outperforms broadcast systems computational complexity decoding process delay performance linear codes linear network coding network coding optimisation radio broadcasting sparse encoding vectors wireless broadcasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：