Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational compl...Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational complexity.During the analysis, some interesting properties shared by the proposed procedures are described.Finally, the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm, and achieves a bit-error rate close to that of the optimum receiver.展开更多
Combining named data networking（NDN） and software-defined networking（SDN） has been considered as an important trend and attracted a lot of attention in recent years. Although much work has been carried out on the ...Combining named data networking（NDN） and software-defined networking（SDN） has been considered as an important trend and attracted a lot of attention in recent years. Although much work has been carried out on the integration of NDN and SDN, the forwarding mechanism to solve the inherent problems caused by the flooding scheme and discard of interest packets in traditional NDN is not well considered. To fill this gap, by taking advantage of SDN, we design a novel forwarding mechanism in NDN architecture with distributed controllers, where routing decisions are made globally. Then we show how the forwarding mechanism is operated for interest and data packets. In addition, we propose a novel routing algorithm considering quality of service（QoS） applied in the proposed forwarding mechanism and carried out in controllers. We take both resource consumption and network load balancing into consideration and introduce a genetic algorithm（GA） to solve the QoS constrained routing problem using global network information. Simulation results are presented to demonstrate the performance of the proposed routing scheme.展开更多
基金Supported by National Natural Science Foundation of China (No. 60372107, 10371106, 10471114)Natural Science Foundation of Jiangsu Province (No. 04KJB110097)
文摘Based on the synthesis and analysis of recursive receivers, a new algorithm, namely partial grouping maximization likelihood algorithm, is proposed to achieve satisfactory performance with moderate computational complexity.During the analysis, some interesting properties shared by the proposed procedures are described.Finally, the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm, and achieves a bit-error rate close to that of the optimum receiver.
基金supported by the Fundamental Research Funds for the Central Universities,China(No.2018PTB-00-03)the National Natural Science Foundation of China(No.61501042)
文摘Combining named data networking（NDN） and software-defined networking（SDN） has been considered as an important trend and attracted a lot of attention in recent years. Although much work has been carried out on the integration of NDN and SDN, the forwarding mechanism to solve the inherent problems caused by the flooding scheme and discard of interest packets in traditional NDN is not well considered. To fill this gap, by taking advantage of SDN, we design a novel forwarding mechanism in NDN architecture with distributed controllers, where routing decisions are made globally. Then we show how the forwarding mechanism is operated for interest and data packets. In addition, we propose a novel routing algorithm considering quality of service（QoS） applied in the proposed forwarding mechanism and carried out in controllers. We take both resource consumption and network load balancing into consideration and introduce a genetic algorithm（GA） to solve the QoS constrained routing problem using global network information. Simulation results are presented to demonstrate the performance of the proposed routing scheme.
