With the increasing maritime activities and the rapidly developing maritime economy, the fifth-generation(5G) mobile communication system is expected to be deployed at the ocean. New technologies need to be explored t...With the increasing maritime activities and the rapidly developing maritime economy, the fifth-generation(5G) mobile communication system is expected to be deployed at the ocean. New technologies need to be explored to meet the requirements of ultra-reliable and low latency communications(URLLC) in the maritime communication network(MCN). Mobile edge computing(MEC) can achieve high energy efficiency in MCN at the cost of suffering from high control plane latency and low reliability. In terms of this issue, the mobile edge communications, computing, and caching(MEC3) technology is proposed to sink mobile computing, network control, and storage to the edge of the network. New methods that enable resource-efficient configurations and reduce redundant data transmissions can enable the reliable implementation of computing-intension and latency-sensitive applications. The key technologies of MEC3 to enable URLLC are analyzed and optimized in MCN. The best response-based offloading algorithm(BROA) is adopted to optimize task offloading. The simulation results show that the task latency can be decreased by 26.5’ ms, and the energy consumption in terminal users can be reduced to 66.6%.展开更多
Heterogeneous cellular networks(HCNs), by introducing caching capability, has been considered as a promising technique in 5 G era, which can bring contents closer to users to reduce the transmission delay, save scarce...Heterogeneous cellular networks(HCNs), by introducing caching capability, has been considered as a promising technique in 5 G era, which can bring contents closer to users to reduce the transmission delay, save scarce bandwidth resource. Although many works have been done for caching in HCNs, from an energy perspective, there still exists much space to develop a more energy-efficient system when considering the fact that the majority of base stations are under-utilized in the most of the time. Therefore, in this paper, by taking the activation mechanism for the base stations into account, we study a joint caching and activation mechanism design to further improve the energy efficiency, then we formulate the optimization problem as an Integer Linear Programming problem(ILP) to maximize the system energy saving. Due to the enormous computation complexity for finding the optimal solution, we introduced a Quantum-inspired Evolutionary Algorithm(QEA) to iteratively provide the global best solution. Numerical results show that our proposed algorithm presents an excellent performance, which is far better than the strategy of only considering caching without deactivation mechanism in the actual, normal situation. We also provide performance comparison amongour QEA, random sleeping algorithm and greedy algorithm, numerical results illustrate our introduced QEA performs best in accuracy and global optimality.展开更多
Streaming media data have strict delay and loss requirements, which cannot be adequately supported by the current Internet. Proxy caching technology is introduced to alleviate the effect of the bottleneck bandwidth on...Streaming media data have strict delay and loss requirements, which cannot be adequately supported by the current Internet. Proxy caching technology is introduced to alleviate the effect of the bottleneck bandwidth on the transporting quality. A new architecture of multimedia proxy caching is given to solve the problem of the traditional Web caching technology for the multimedia streaming. The mixed media management module and the (resource) management module are added to this architecture, the prefetching and replacement method is studied considering the characteristics of streaming media data, the concept of weighed popularity is given to enhance the (exactness) of the replacement algorithm.展开更多
LRU替换算法在单核处理器中得到了广泛应用,而多核环境大都采用多核共享最后一级Cache(LLC)的策略,随着LLC容量和相联度的增加以及多核应用的工作集增大,LRU替换算法和理论最优替换算法之间的差距越来越大。该文提出了一种平均划分下基...LRU替换算法在单核处理器中得到了广泛应用,而多核环境大都采用多核共享最后一级Cache(LLC)的策略,随着LLC容量和相联度的增加以及多核应用的工作集增大,LRU替换算法和理论最优替换算法之间的差距越来越大。该文提出了一种平均划分下基于频率的多核共享Cache替换算法(ALRU-F)。该算法将当前所需要的部分工作集保留在Cache内,逐出无用块,同时还提出了块粒度动态划分下基于频率的替换算法(BLRU-F)。该文提出的ALRU-F算法相比传统的LRU算法缺失率降低了26.59%,CPU每一时钟周期内所执行的指令数IPC(Instruction Per Clock)则提升了13.59%。在此基础上提出的块粒度动态划分下,基于频率的BLUR-F算法相比较传统的LRU算法性能提高更大,缺失率降低了33.72%,而IPC则提升了16.59%。提出的两种算法在性能提升的同时,并没有明显地增加能耗。展开更多
在多核环境下,对共享L2 Cache的优化显得尤为重要,因为当被访问的数据块不在L2 Cache中时(发生L2缺失),CPU需要花费几百个周期访问主存的代价是相当大的.在设计Cache时,替换算法是考虑的一个重要因素,替换算法的好坏直接影响Cache的性...在多核环境下,对共享L2 Cache的优化显得尤为重要,因为当被访问的数据块不在L2 Cache中时(发生L2缺失),CPU需要花费几百个周期访问主存的代价是相当大的.在设计Cache时,替换算法是考虑的一个重要因素,替换算法的好坏直接影响Cache的性能和计算机的整体性能.虽然LRU替换算法已经被广泛应用在片上Cache中,但是也存在着一些不足:当Cache容量小于程序工作集时,容易产生冲突缺失;且LRU替换算法不考虑数据块被访问的频率.文中把冒泡替换算法应用到多核共享Cache中,同时考虑数据块被访问的频率和最近访问的信息.通过分析实验数据,与LRU替换算法相比,采用冒泡替换算法可以使MPKI(Misses per Kilo instructions)和L2 Cache命中率均有所改善.展开更多
FLUSH+RELOAD attack is recently proposed as a new type of Cache timing attacks.There are three essential factors in this attack,which are monitored instructions.threshold and waiting interval.However,existing literatu...FLUSH+RELOAD attack is recently proposed as a new type of Cache timing attacks.There are three essential factors in this attack,which are monitored instructions.threshold and waiting interval.However,existing literature seldom exploit how and why they could affect the system.This paper aims to study the impacts of these three parameters,and the method of how to choose optimal values.The complete rules for choosing the monitored instructions based on necessary and sufficient condition are proposed.How to select the optimal threshold based on Bayesian binary signal detection principal is also proposed.Meanwhile,the time sequence model of monitoring is constructed and the calculation of the optimal waiting interval is specified.Extensive experiments are conducted on RSA implemented with binary square-and-multiply algorithm.The results show that the average success rate of full RSA key recovery is89.67%.展开更多
Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allo...Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.展开更多
In recent years,Delay Tolerant Networks(DTN)have received more and more attention.At the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceiv...In recent years,Delay Tolerant Networks(DTN)have received more and more attention.At the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network environment.This paper proposes an AdaptiveSpray routing algorithm.The algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination node.In the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding strategies.The simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.展开更多
基金the National S&T Major Project (No. 2018ZX03001011)the National Key R&D Program(No.2018YFB1801102)+1 种基金the National Natural Science Foundation of China (No. 61671072)the Beijing Natural Science Foundation (No. L192025)
文摘With the increasing maritime activities and the rapidly developing maritime economy, the fifth-generation(5G) mobile communication system is expected to be deployed at the ocean. New technologies need to be explored to meet the requirements of ultra-reliable and low latency communications(URLLC) in the maritime communication network(MCN). Mobile edge computing(MEC) can achieve high energy efficiency in MCN at the cost of suffering from high control plane latency and low reliability. In terms of this issue, the mobile edge communications, computing, and caching(MEC3) technology is proposed to sink mobile computing, network control, and storage to the edge of the network. New methods that enable resource-efficient configurations and reduce redundant data transmissions can enable the reliable implementation of computing-intension and latency-sensitive applications. The key technologies of MEC3 to enable URLLC are analyzed and optimized in MCN. The best response-based offloading algorithm(BROA) is adopted to optimize task offloading. The simulation results show that the task latency can be decreased by 26.5’ ms, and the energy consumption in terminal users can be reduced to 66.6%.
基金jointly supported by the National Natural Science Foundation of China (No.61501042)the National High Technology Research and Development Program(863) of China (2015AA016101)+1 种基金Beijing Nova Program(Z151100000315078)Information Network Open Source Platform and Technology Development Strategy(No.2016-XY-09)
文摘Heterogeneous cellular networks(HCNs), by introducing caching capability, has been considered as a promising technique in 5 G era, which can bring contents closer to users to reduce the transmission delay, save scarce bandwidth resource. Although many works have been done for caching in HCNs, from an energy perspective, there still exists much space to develop a more energy-efficient system when considering the fact that the majority of base stations are under-utilized in the most of the time. Therefore, in this paper, by taking the activation mechanism for the base stations into account, we study a joint caching and activation mechanism design to further improve the energy efficiency, then we formulate the optimization problem as an Integer Linear Programming problem(ILP) to maximize the system energy saving. Due to the enormous computation complexity for finding the optimal solution, we introduced a Quantum-inspired Evolutionary Algorithm(QEA) to iteratively provide the global best solution. Numerical results show that our proposed algorithm presents an excellent performance, which is far better than the strategy of only considering caching without deactivation mechanism in the actual, normal situation. We also provide performance comparison amongour QEA, random sleeping algorithm and greedy algorithm, numerical results illustrate our introduced QEA performs best in accuracy and global optimality.
文摘Streaming media data have strict delay and loss requirements, which cannot be adequately supported by the current Internet. Proxy caching technology is introduced to alleviate the effect of the bottleneck bandwidth on the transporting quality. A new architecture of multimedia proxy caching is given to solve the problem of the traditional Web caching technology for the multimedia streaming. The mixed media management module and the (resource) management module are added to this architecture, the prefetching and replacement method is studied considering the characteristics of streaming media data, the concept of weighed popularity is given to enhance the (exactness) of the replacement algorithm.
文摘LRU替换算法在单核处理器中得到了广泛应用,而多核环境大都采用多核共享最后一级Cache(LLC)的策略,随着LLC容量和相联度的增加以及多核应用的工作集增大,LRU替换算法和理论最优替换算法之间的差距越来越大。该文提出了一种平均划分下基于频率的多核共享Cache替换算法(ALRU-F)。该算法将当前所需要的部分工作集保留在Cache内,逐出无用块,同时还提出了块粒度动态划分下基于频率的替换算法(BLRU-F)。该文提出的ALRU-F算法相比传统的LRU算法缺失率降低了26.59%,CPU每一时钟周期内所执行的指令数IPC(Instruction Per Clock)则提升了13.59%。在此基础上提出的块粒度动态划分下,基于频率的BLUR-F算法相比较传统的LRU算法性能提高更大,缺失率降低了33.72%,而IPC则提升了16.59%。提出的两种算法在性能提升的同时,并没有明显地增加能耗。
文摘在多核环境下,对共享L2 Cache的优化显得尤为重要,因为当被访问的数据块不在L2 Cache中时(发生L2缺失),CPU需要花费几百个周期访问主存的代价是相当大的.在设计Cache时,替换算法是考虑的一个重要因素,替换算法的好坏直接影响Cache的性能和计算机的整体性能.虽然LRU替换算法已经被广泛应用在片上Cache中,但是也存在着一些不足:当Cache容量小于程序工作集时,容易产生冲突缺失;且LRU替换算法不考虑数据块被访问的频率.文中把冒泡替换算法应用到多核共享Cache中,同时考虑数据块被访问的频率和最近访问的信息.通过分析实验数据,与LRU替换算法相比,采用冒泡替换算法可以使MPKI(Misses per Kilo instructions)和L2 Cache命中率均有所改善.
基金supported by National Natural Science Foundation of China (No.61472357,No.61309021,No.61272491, No.61173191)the Major State Basic Research Development Program(973 Plan) of China under the grant 2013CB338004
文摘FLUSH+RELOAD attack is recently proposed as a new type of Cache timing attacks.There are three essential factors in this attack,which are monitored instructions.threshold and waiting interval.However,existing literature seldom exploit how and why they could affect the system.This paper aims to study the impacts of these three parameters,and the method of how to choose optimal values.The complete rules for choosing the monitored instructions based on necessary and sufficient condition are proposed.How to select the optimal threshold based on Bayesian binary signal detection principal is also proposed.Meanwhile,the time sequence model of monitoring is constructed and the calculation of the optimal waiting interval is specified.Extensive experiments are conducted on RSA implemented with binary square-and-multiply algorithm.The results show that the average success rate of full RSA key recovery is89.67%.
基金supported by National Natural Science Foundation of China under Grants No. 61371087 and 61531013The Research Fund of Ministry of Education-China Mobile (MCM20150102)
文摘Cache-enabled small cell networks have been regarded as a promising approach for network operators to cope with the explosive data traffic growth in future 5 G networks. However, the user association and resource allocation mechanism has not been thoroughly studied under given content placement situation. In this paper, we formulate the joint optimization problem of user association and resource allocation as a mixed integer nonlinear programming(MINLP) problem aiming at deriving a balance between the total utility of data rates and the total data rates retrieved from caches. To solve this problem, we propose a distributed relaxing-rounding method. Simulation results demonstrate that the distributed relaxing-rounding method outperforms traditional max-SINR method and range-expansion method in terms of both total utility of data rates and total data rates retrieved from caches in practical scenarios. In addition, effects of storage and backhaul capacities on the performance are also studied.
基金National Key R&D Program of China(2020YFB1807805,2020YFB1807800)CERNET Innovation Project(NGII20190806).
文摘In recent years,Delay Tolerant Networks(DTN)have received more and more attention.At the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network environment.This paper proposes an AdaptiveSpray routing algorithm.The algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination node.In the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding strategies.The simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.
