To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middl...To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.展开更多
Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency(RF)spectrum utilization.However,there are several challenges to realize them in real systems,such as sensing uncertain...Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency(RF)spectrum utilization.However,there are several challenges to realize them in real systems,such as sensing uncertainty causing issues to licensed users,business models for licensed service providers.Wireless virtualization is regarded as a technology that leverages service level agreements to sublease unused or underutilized RF spectrum that addresses aforementioned issues and helps to significantly enhance the utilization of the RF spectrum,offer improved coverage and capacity of networks,enhance network security and reduce energy consumption.With wireless virtualization,wireless networks'physical substrate is shared and reconfigured dynamically between virtual wireless networks through Mobile Virtual Network Operations(MVNOs).Wireless virtualization with dynamic configurable features of Wireless Infrastructure Providers(WIPs),virtualized wireless networks are vulnerable to a multitude of attacks,including jamming attacks and eavesdropping attacks.This paper investigates a means of defense through the employment of coalition game theory when jammers try to degrade the signal quality of legitimate users,and eavesdroppers aim to reduce secrecy rates.Specifically,we consider a virtual wireless network where MVNO users'job is to improve their Signal to Interference plus Noise Ratio(SINR)while the jammers target to collectively enhance their Jammer Received Signal Strength(JRSS),and an eavesdropper's goal is to reduce the overall secrecy rate.Numerical results have demonstrated that the proposed game strategies are effective(in terms of data rate,secrecy rate and latency)against such attackers compared to the traditional approaches.展开更多
In this paper, we investigate the influences of network delay on QoE (Quality of Experience) such as the operability of haptic interface device and the fairness between players for soft objects in a networked real-tim...In this paper, we investigate the influences of network delay on QoE (Quality of Experience) such as the operability of haptic interface device and the fairness between players for soft objects in a networked real-time game subjectively and objectively. We handle a networked balloon bursting game in which two players burst balloons (i.e., soft objects) in a 3D virtual space by using haptic interface devices, and the players compete for the number of burst balloons. As a result, we find that the operability depends on the network delay from the local terminal to the other terminal, and the fairness is mainly dependent on the difference in network delay between the players’ terminals. We confirm that there exists a trade-off relationship between the operability and the fairness. We also see that the contribution of the fairness is larger than that of the operability to the comprehensive quality (i.e., the weighted sum of the operability and fairness). Assessment results further show that the output timing of terminals should be adjusted to the terminal which has the latest output timing to maintain the fairness when the difference in network delay between the terminals is large. In this way, the comprehensive quality at each terminal can be maintained as high as possible.展开更多
Through investigating a particular blog, several factors were found which have significant influence on reader actions. This study uses the term “memetic primers” for those styles that most often cause readers to ta...Through investigating a particular blog, several factors were found which have significant influence on reader actions. This study uses the term “memetic primers” for those styles that most often cause readers to take notice of a particular comment, remember information included in it, and take action. The memetic primers were derived in a discourse analysis. The study discovered the memetic primers using logic-of-inquire approach to the online comments. While evidence indicated that the usefulness of some primers was low, it emerged those negatively written comments where the most common impact on a comment’s volume.展开更多
针对服务功能链(service function chain,SFC)请求动态变化导致的航空信息网络中平台负载不均问题,提出了一种基于联盟博弈的SFC迁移算法。该算法将航空平台作为博弈参与者,将SFC实例作为博弈商品,以网络能耗和迁移开销联合优化为目标...针对服务功能链(service function chain,SFC)请求动态变化导致的航空信息网络中平台负载不均问题,提出了一种基于联盟博弈的SFC迁移算法。该算法将航空平台作为博弈参与者,将SFC实例作为博弈商品,以网络能耗和迁移开销联合优化为目标。在算法执行过程中,各航空平台之间相互协作构建博弈联盟,通过联盟之间的比较与交换行为实现SFC迁移及网络资源整合。研究结果表明,所提算法具有较低的计算复杂度、较好的收敛性且能够形成纳什稳定结构。此外,在不同的网络规模下,所提算法均能有效降低网络能耗及网络迁移开销,同时保持较高的不同规模网络的资源利用率。展开更多
In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the V...In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the VR from a unique mobile network operator(MNO) is considered. Our objective is two folds. The first is to guarantee the minimum rate requirements of the MNO and the WSPs. The second is to distribute the system rate among the MNO and the WSPs in the Pareto optimal manner. To this end, an efficient VR allocation scheme based on bargaining game theory is proposed, and the Nash bargaining solution(NBS) method is used to solve the proposed game problem. The proposed game problem is proved to be a convex optimization problem. By using standard convex optimization method, the global optimal NBS of the game is obtained in closed form. The effectiveness of the proposed VR allocation game is testified through numerical results.展开更多
针对传统无线网络中功率不能动态分配共享的问题,采用无线网络虚拟化,设计了一种基于博弈的两阶段功率分配方法(G2SPA,game theory based two steps power allocation scheme for wireless network virtualization),首先利用买卖博弈模...针对传统无线网络中功率不能动态分配共享的问题,采用无线网络虚拟化,设计了一种基于博弈的两阶段功率分配方法(G2SPA,game theory based two steps power allocation scheme for wireless network virtualization),首先利用买卖博弈模拟了服务提供商(SP,service provide)和移动用户(MUE,mobile user equipment)之间的相互影响,提出了基于斯坦博格均衡(SE,stackelberg equilibrium)的报价策略。然后,利用拍卖理论对空闲下行功率资源进行再分配,采取Mc Afee机制保证拍卖的诚实性。通过仿真实验证明G2SPA算法的正确性和有效性。展开更多
基金supported by The National Basic Research Program of China (973) (Grant No. 2012CB315901, 2013CB329104)The National Natural Science Foundation of China (Grant No. 61521003, 61372121, 61309019, 61572519, 61502530)The National High Technology Research and Development Program of China (863) (Grant No. 2015AA016102)
文摘To address the issues that middleboxes as a fundamental part of today's networks are facing, Network Function Virtualization(NFV)has been recently proposed, which in essence asserts to migrate hardware-based middleboxes into software-based virtualized function entities.Due to the demands of virtual services placement in NFV network environment, this paper models the service amount placement problem involving with the resources allocation as a cooperative game and proposes the placement policy by Nash Bargaining Solution(NBS). Specifically,we first introduce the system overview and apply the rigorous cooperative game-theoretic guide to build the mathematical model, which can give consideration to both the responding efficiency of service requirements and the allocation fairness.Then a distributed algorithm corresponding to NBS is designed to achieve predictable network performance for virtual instances placement.Finally, with simulations under various scenarios,the results show that our placement approach can achieve high utilization of network through the analysis of evaluation metrics namely the satisfaction degree and fairness index. With the suitable demand amount of services, the average values of two metrics can reach above 90%. And by tuning the base placement, our solution can enable operators to flexibly balance the tradeoff between satisfaction and fairness of resourcessharing in service platforms.
基金This work was supported in part by the US NSF under grants CNS 1650831 and HRD 1828811by the U.S.Department of Homeland Security under grant DHS 2017-ST-062-000003by the DoE's National Nuclear Security Administration(NNSA)Award#DE-NA0003946.
文摘Dynamic spectrum sharing and cognitive radio networks were proposed to enhance the Radio Frequency(RF)spectrum utilization.However,there are several challenges to realize them in real systems,such as sensing uncertainty causing issues to licensed users,business models for licensed service providers.Wireless virtualization is regarded as a technology that leverages service level agreements to sublease unused or underutilized RF spectrum that addresses aforementioned issues and helps to significantly enhance the utilization of the RF spectrum,offer improved coverage and capacity of networks,enhance network security and reduce energy consumption.With wireless virtualization,wireless networks'physical substrate is shared and reconfigured dynamically between virtual wireless networks through Mobile Virtual Network Operations(MVNOs).Wireless virtualization with dynamic configurable features of Wireless Infrastructure Providers(WIPs),virtualized wireless networks are vulnerable to a multitude of attacks,including jamming attacks and eavesdropping attacks.This paper investigates a means of defense through the employment of coalition game theory when jammers try to degrade the signal quality of legitimate users,and eavesdroppers aim to reduce secrecy rates.Specifically,we consider a virtual wireless network where MVNO users'job is to improve their Signal to Interference plus Noise Ratio(SINR)while the jammers target to collectively enhance their Jammer Received Signal Strength(JRSS),and an eavesdropper's goal is to reduce the overall secrecy rate.Numerical results have demonstrated that the proposed game strategies are effective(in terms of data rate,secrecy rate and latency)against such attackers compared to the traditional approaches.
文摘In this paper, we investigate the influences of network delay on QoE (Quality of Experience) such as the operability of haptic interface device and the fairness between players for soft objects in a networked real-time game subjectively and objectively. We handle a networked balloon bursting game in which two players burst balloons (i.e., soft objects) in a 3D virtual space by using haptic interface devices, and the players compete for the number of burst balloons. As a result, we find that the operability depends on the network delay from the local terminal to the other terminal, and the fairness is mainly dependent on the difference in network delay between the players’ terminals. We confirm that there exists a trade-off relationship between the operability and the fairness. We also see that the contribution of the fairness is larger than that of the operability to the comprehensive quality (i.e., the weighted sum of the operability and fairness). Assessment results further show that the output timing of terminals should be adjusted to the terminal which has the latest output timing to maintain the fairness when the difference in network delay between the terminals is large. In this way, the comprehensive quality at each terminal can be maintained as high as possible.
文摘Through investigating a particular blog, several factors were found which have significant influence on reader actions. This study uses the term “memetic primers” for those styles that most often cause readers to take notice of a particular comment, remember information included in it, and take action. The memetic primers were derived in a discourse analysis. The study discovered the memetic primers using logic-of-inquire approach to the online comments. While evidence indicated that the usefulness of some primers was low, it emerged those negatively written comments where the most common impact on a comment’s volume.
文摘针对服务功能链(service function chain,SFC)请求动态变化导致的航空信息网络中平台负载不均问题,提出了一种基于联盟博弈的SFC迁移算法。该算法将航空平台作为博弈参与者,将SFC实例作为博弈商品,以网络能耗和迁移开销联合优化为目标。在算法执行过程中,各航空平台之间相互协作构建博弈联盟,通过联盟之间的比较与交换行为实现SFC迁移及网络资源整合。研究结果表明,所提算法具有较低的计算复杂度、较好的收敛性且能够形成纳什稳定结构。此外,在不同的网络规模下,所提算法均能有效降低网络能耗及网络迁移开销,同时保持较高的不同规模网络的资源利用率。
基金supported in part by China University of Mining and Technology Funds for Academic Frontier Research(Grant No.2015XKQY18)National High-tech R&D Program of China(863 Program)(Grant Nos.2015AA015701+1 种基金2015AA01A705)National Natural Science Foundation of China(Grant No.61100167)
文摘In this paper, we study the virtual resource(VR) allocation problem in LTE-based wireless network virtualization(WNV). A practical network scenario, where multiple virtual wireless service providers(WSPs)request the VR from a unique mobile network operator(MNO) is considered. Our objective is two folds. The first is to guarantee the minimum rate requirements of the MNO and the WSPs. The second is to distribute the system rate among the MNO and the WSPs in the Pareto optimal manner. To this end, an efficient VR allocation scheme based on bargaining game theory is proposed, and the Nash bargaining solution(NBS) method is used to solve the proposed game problem. The proposed game problem is proved to be a convex optimization problem. By using standard convex optimization method, the global optimal NBS of the game is obtained in closed form. The effectiveness of the proposed VR allocation game is testified through numerical results.
文摘针对传统无线网络中功率不能动态分配共享的问题,采用无线网络虚拟化,设计了一种基于博弈的两阶段功率分配方法(G2SPA,game theory based two steps power allocation scheme for wireless network virtualization),首先利用买卖博弈模拟了服务提供商(SP,service provide)和移动用户(MUE,mobile user equipment)之间的相互影响,提出了基于斯坦博格均衡(SE,stackelberg equilibrium)的报价策略。然后,利用拍卖理论对空闲下行功率资源进行再分配,采取Mc Afee机制保证拍卖的诚实性。通过仿真实验证明G2SPA算法的正确性和有效性。
