Fog computing is a new paradigm providing network services such as computing, storage between the end users and cloud. The distributed and open structure are the characteristics of fog computing, which make it vulnera...Fog computing is a new paradigm providing network services such as computing, storage between the end users and cloud. The distributed and open structure are the characteristics of fog computing, which make it vulnerable and very weak to security threats. In this article, the interaction between vulnerable nodes and malicious nodes in the fog computing is investigated as a non-cooperative differential game. The complex decision making process is reviewed and analyzed. To solve the game, a fictitious play-based algorithm is which the vulnerable node and the malicious nodes reach a feedback Nash equilibrium. We attain optimal strategy of energy consumption with Qo S guarantee for the system, which are conveniently operated and suitable for fog nodes. The system simulation identifies the propagation of malicious nodes. We also determine the effects of various parameters on the optimal strategy. The simulation results support a theoretical foundation to limit malicious nodes in fog computing, which can help fog service providers make the optimal dynamic strategies when different types of nodes dynamically change their strategies.展开更多
为解决命名数据网络中的拥塞控制问题,提出一种博弈拥塞控制算法。将路由器为数据流分配带宽问题构建成单主多从的Stackelberg博弈模型,建立路由器和数据流的效用函数,证明数据流非合作动态博弈纳什均衡解的存在性,运用分布式迭代方法,...为解决命名数据网络中的拥塞控制问题,提出一种博弈拥塞控制算法。将路由器为数据流分配带宽问题构建成单主多从的Stackelberg博弈模型,建立路由器和数据流的效用函数,证明数据流非合作动态博弈纳什均衡解的存在性,运用分布式迭代方法,获得数据流最优带宽需求量和路由器最优价格策略,通过数据包将数据流最优带宽需求量对应的速率反馈给下游路由器和请求端。基于ndnSIM平台对该算法与ICP(interest control protocol)和HR-ICP(hop-by-hop and receiver-driven interest control protocol)算法进行仿真试验,结果表明该算法能有效提升瓶颈链路利用率并保证较低的丢包率。展开更多
基金supported by the National Science Foundation Project of P. R. China (No. 61501026,61572072)Fundamental Research Funds for the Central Universities (No. FRF-TP-15-032A1)
文摘Fog computing is a new paradigm providing network services such as computing, storage between the end users and cloud. The distributed and open structure are the characteristics of fog computing, which make it vulnerable and very weak to security threats. In this article, the interaction between vulnerable nodes and malicious nodes in the fog computing is investigated as a non-cooperative differential game. The complex decision making process is reviewed and analyzed. To solve the game, a fictitious play-based algorithm is which the vulnerable node and the malicious nodes reach a feedback Nash equilibrium. We attain optimal strategy of energy consumption with Qo S guarantee for the system, which are conveniently operated and suitable for fog nodes. The system simulation identifies the propagation of malicious nodes. We also determine the effects of various parameters on the optimal strategy. The simulation results support a theoretical foundation to limit malicious nodes in fog computing, which can help fog service providers make the optimal dynamic strategies when different types of nodes dynamically change their strategies.
文摘为解决命名数据网络中的拥塞控制问题,提出一种博弈拥塞控制算法。将路由器为数据流分配带宽问题构建成单主多从的Stackelberg博弈模型,建立路由器和数据流的效用函数,证明数据流非合作动态博弈纳什均衡解的存在性,运用分布式迭代方法,获得数据流最优带宽需求量和路由器最优价格策略,通过数据包将数据流最优带宽需求量对应的速率反馈给下游路由器和请求端。基于ndnSIM平台对该算法与ICP(interest control protocol)和HR-ICP(hop-by-hop and receiver-driven interest control protocol)算法进行仿真试验,结果表明该算法能有效提升瓶颈链路利用率并保证较低的丢包率。
