WTB总线协议网络数据传输调度与控制协同策略研究

在研究WTB总线协议网络数据传输特性的基础上,提出一种协调控制周期数据和非周期数据传输的PMTS调度策略;采用实时控制系统的调度理论和控制策略,实时构建周期数据调度轮询机制,设计非周期数据动态抢占调度控制方法,从而实现对网络数据传输的协同控制和调度;搭建WTB总线协议网络数据传输试验平台,将PMTS调度策略应用于自主设计的列车通信网关系统中。结果表明,该调度策略可灵活分配WTB总线网络编组的常规运行周期,实现底层数据传输与上层协议间的协同配合。

Hierarchical multicast with inter-layer random network coding

To maximize the aggregate throughput achieved in heterogeneous networks, this paper investigates inter-session network coding for the distribution of layered source data. We define inter-layer hierarchical random linear network codes （IHRLNC）, which not only take the flexibility of intersession network coding for layer mixing but also consider the strict priority inherent in the layered source data. Furthermore, we propose the inter-layer hierarchical multicast （IHM）, which performs IHRLNC in the network such that each sink can recover some source layers according to its individu- al capacity. To determine the optimal type of IHRLNC that should be performed on each edge in IHM, we formulate an optimization problem based on 0-1 integer linear programming, and propose a heuristic approach to approximate the optimal solution in polynomial time. Simulation results show that the proposed IHM can achieve throughput gains over the layered muhicast schemes.

Network coding resources optimization with transmission delay constraint in multicast networks

Minimizing network coding resources of multicast networks,such as the number of coding nodes or links,has been proved to be NP-hard,and taking propagation delay into account makes the problem more complicated. To resolve this optimal problem,an integer encoding routing-based genetic algorithm( REGA) is presented to map the optimization problem into a genetic algorithm( GA)framework. Moreover,to speed up the search process of the algorithm,an efficient local search procedure which can reduce the searching space size is designed for searching the feasible solution.Compared with the binary link state encoding representation genetic algorithm( BLSGA),the chromosome length of REGA is shorter and just depends on the number of sinks. Simulation results show the advantages of the algorithm in terms of getting the optimal solution and algorithmic convergence speed.

Algebraic Approach to Random Convolutional Network Coding over Wireless Packet Networks

To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is deduced, and the coding condition is also presented. Analyses and simulations show that random convolutional coding is capacity-achieving with probability approaching 1.

Network Coding Based on Linear Block Codes for Multi-source Cooperative Relaying Networks

In order to improve link performance of future wireless relay networks,a network coding scheme with linear block codes was proposed,which could be deployed in a relay network consisting of multi-source sending data to a common base station(BS) with the assistance of one relay node.At BS,an iterative decoding structure between one cooperative decoder and a number of single-source decoders was established using the relayed network codes and source codes.Further,the extrinsic information transfer(EXIT) chart technique was used to predict and analyze the convergence behavior of iterative decoder.The analysis and simulation results show that the bit error ratio(BER) performance of the proposed scheme outperforms reference scheme under different relay network coding matrices.Compared with a reference scheme without the multisource cooperation,the proposed scheme can obtain network coding gain from the relay network while not reduce its code rate.

Efficient Broadcast Retransmission Based on Network Coding for InterPlaNetary Internet

In traditional wireless broadcast networks,a corrupted packet must be retransmitted even if it has been lost by only one receiver.Obviously,this is not bandwidth-efficient for the receivers that already hold the retransmitted packet.Therefore,it is important to develop a method to realise efficient broadcast transmission.Network coding is a promising technique in this scenario.However,none of the proposed schemes achieves both high transmission efficiency and low computational complexity simultaneously so far.To address this problem,a novel Efficient Opportunistic Network Coding Retransmission(EONCR)scheme is proposed in this paper.This scheme employs a new packet scheduling algorithm which uses a Packet Distribution Matrix(PDM)directly to select the coded packets.The analysis and simulation results indicate that transmission efficiency of EONCR is over 0.1,more than the schemes proposed previously in some simulation conditions,and the computational overhead is reduced substantially.Hence,it has great application prospects in wireless broadcast networks,especially energyand bandwidth-limited systems such as satellite broadcast systems and Planetary Networks(PNs).

Towards high-performance packet processing on commodity multi-cores: current issues and future directions

The demands of programmability have become more and more exigent as novel network services appear, such as E-commerce, social softwares, and online videos. Commodity multi-core CPUs have been widely applied in network packet processing to get high programmability and reduce the time-to-market. However,there is a great gap between the packet processing performance of commodity multi-core and that of the traditional packet processing hardware, e.g., NP(Network Process). Recently, optimization of the packet processing performance of commodity multi-cores has become a hot topic in industry and academia. In this paper, based on a detailed analysis of the packet processing procedure, firstly we identify two dominating overheads, namely the virtual-to-physical address translation and the packet buffer management. Secondly, we make a comprehensive survey on the current optimization methods. Thirdly, based on the survey, the heterogeneous architecture of the commodity multi-core + FPGA is proposed as a promising way to improve the packet processing performance.Fourthly, a novel Self-Described Buffer(SDB) management technology is introduced to eliminate the overheads of the allocation and deallocation of the packet buffers offloaded to FPGA. Then, an evaluation testbed, named PIOT(Packet I/O Testbed), is designed and implemented to evaluate the packet forwarding performance. I/O capacity of different commodity multi-core CPUs and the performance of optimization methods are assessed and compared based on PIOT. At last, the future work of packet processing optimization on multi-core CPUs is discussed.