Research On Network Coding For Weakly Secure Multicast With Integral Rates

In recent years,with the rapid development of the next generation network technologies and multimedia applications,the traditional unicast is not suitable for the large data volume and high-speed transmission due to the limitations of bandwith,delay and so on.The multicast provides an efficient and feasible solution for it.However,how to provide efficient and secure data transmission in multicast has become an urgent problem to be solved.Previous studies have shown that the linear network coding(LNC)can achieve theoretical upper bound of the transmission rate in multicast.Moreover,LNC can provide data confidentiality easily due to its characteristics.Therefore,the LNC and the multicast can be considered jointly to achieve the efficient and secure transmission for large data volume.Most of the existing researches for multicast based on LNC are focused on the real number link rates.In practical applications,however,data is transmitted in the form of packets,and the data transmission rate based on LNC is an integer multiple of data packets.In this paper,secure and efficient data transmission strategies based on LNC are studied to minimize the communication and computation resources consumption,which meet the weak security requirements.The details are as follows:1.In multicast of content delivery network,we consider the transmission topology construction and the LNC design.These designs aim to(1)satisfy the requirements of weak security,(2)maximize integral transmission rate,(3)minimize the transmission cost.Firstly,we give the network model of the multicast and the definition of the weak security.Next,we present and prove the necessary and sufficient condition of the existence of the weakly secure LNC.Then,we formulate the problem as an integer linear programming(ILP)and design an efficient transmission topology construction algorithm to optimally solve the ILP within polynomial time.Moreover,we also analyze the size of the finite field required to construct the deterministic LNC and the random LNC which are satisfied with the problem requirements.2.In multicast,we consider the design of the weakly secure LNC for data shuffling with integral rate and the computing task assignment for the distributed edge computing based on Map Reduce,in order to reduce the computation redundancy and save the network resources.Firstly,we give the model of the distributed edge computing based on Map Reduce and introduce the coded distributed computing(CDC)scheme for data shuffling with integral rates.We also give the definitions of the weak security and the problem.Then,we prove that the CDC scheme can be weakly secure in data shuffling with the given contractions.Moreover,we further propose the redundancy reduction algorithm when security is guaranteed and prove the correctness of the algorithm.The results of the simulations show that the proposed strategies in this paper can provide the data confidentiality of transmission,improve the transmission/computation efficiency and save the network resources.Therefore,the research in this paper is of great significance to the further research of multicast and the next generation network technologies.